TY - JOUR
T1 - Automatic generation of interlock designs using genetic algorithms
AU - Lepar, Yeremia Yehuda
AU - Wang, Yu Chih
AU - Chang, Chuei Tin
N1 - Publisher Copyright:
© 2017 Elsevier Ltd
PY - 2017
Y1 - 2017
N2 - The hazardous units in a modern chemical plant are often equipped with safety interlocks to mitigate the detrimental effects of potential accidents. To achieve a desired level of reliability (or availability), not only the interlock configuration but also the maintenance policies of its components must be properly stipulated before actual installation. Although a number of deterministic programming models have already been developed for this purpose, their laborious formulation and solution steps are usually carried out on a case-by-case basis. To attain the essential qualities of conciseness, portability and maintainability for easy implementation, there is a definite need to develop a generic and modularized code according to an evolutionary algorithm. The structural and maintenance specifications of an interlock can be represented with: (1) the number of measurement channels and the corresponding alarm logic, (2) the numbers of online and spare sensors in each channel and the corresponding voting gate, (3) the number of shutdown channels and the corresponding tripping configuration, (4) the numbers of online and standby actuators in each channel, and the corresponding activation mechanism, and (5) the inspection intervals of shutdown channels. All of them are encoded in this study with binary numbers for use as inputs to implement the genetic algorithm (GA). An interlock superstructure is also developed to facilitate the search for the best configuration and maintenance plan in any application. By minimizing the overall life-cycle expenditure, a generic MATLAB code has been developed for generating all aforementioned specifications in any application. Four examples are provided to demonstrate the benefits of the proposed optimization approach.
AB - The hazardous units in a modern chemical plant are often equipped with safety interlocks to mitigate the detrimental effects of potential accidents. To achieve a desired level of reliability (or availability), not only the interlock configuration but also the maintenance policies of its components must be properly stipulated before actual installation. Although a number of deterministic programming models have already been developed for this purpose, their laborious formulation and solution steps are usually carried out on a case-by-case basis. To attain the essential qualities of conciseness, portability and maintainability for easy implementation, there is a definite need to develop a generic and modularized code according to an evolutionary algorithm. The structural and maintenance specifications of an interlock can be represented with: (1) the number of measurement channels and the corresponding alarm logic, (2) the numbers of online and spare sensors in each channel and the corresponding voting gate, (3) the number of shutdown channels and the corresponding tripping configuration, (4) the numbers of online and standby actuators in each channel, and the corresponding activation mechanism, and (5) the inspection intervals of shutdown channels. All of them are encoded in this study with binary numbers for use as inputs to implement the genetic algorithm (GA). An interlock superstructure is also developed to facilitate the search for the best configuration and maintenance plan in any application. By minimizing the overall life-cycle expenditure, a generic MATLAB code has been developed for generating all aforementioned specifications in any application. Four examples are provided to demonstrate the benefits of the proposed optimization approach.
UR - http://www.scopus.com/inward/record.url?scp=85016273877&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85016273877&partnerID=8YFLogxK
U2 - 10.1016/j.compchemeng.2017.02.042
DO - 10.1016/j.compchemeng.2017.02.042
M3 - Article
AN - SCOPUS:85016273877
SN - 0098-1354
VL - 101
SP - 167
EP - 192
JO - Computers and Chemical Engineering
JF - Computers and Chemical Engineering
ER -