Evaluation of two termination criteria in evolutionary algorithms for multi-objective optimization of complex chemical processes

• Published in: Chemical engineering research & design Vol. 124; pp. 58 - 65
• Main Authors: Rangaiah, G.P., Sharma, Shivom, Lin, H.W.
• Format: Journal Article
• Language: English
• Published: Rugby Elsevier B.V 01-08-2017; Elsevier Science Ltd
• Subjects: Chemical engineering; Chemical process industries; Chemical processes; Computational efficiency; Computer simulation; Computing time; Criteria; Differential evolution; Evolutionary algorithms; Genetic algorithms; Global optimization; Iterative methods; Multi-objective optimization; Multiple objective analysis; Optimization algorithms; Searching; Simulators; Statistical tests; Studies; Termination/stopping criterion; Differential evolution; Multi-objective optimization; Chemical processes; Evolutionary algorithms; Termination/stopping criterion; Genetic algorithms
• ISSN: 0263-8762; 1744-3563
• DOI: 10.1016/j.cherd.2017.05.030

Multi-objective (or multi-criteria) optimization (MOO) is useful for gaining deeper insights into trade-offs among objectives of interest and then selecting one of the many optimal solutions found. It has attracted numerous applications in chemical engineering. Common techniques for MOO are adaptations of stochastic global optimization methods, which include metaheuristics and evolutionary methods, for single-objective optimization. These techniques have been used mostly with maximum number of generations (MNG) as the termination criterion for stopping the iterative search. This criterion is arbitrary and computationally inefficient. Hence, this study investigates two termination criteria based on search progress (i.e., performance or improvement in solutions), for MOO of three complex chemical processes modeled by process simulators, namely, Aspen Plus and Aspen HYSYS. They are Chi-Squared test based Termination Criterion (CSTC) and Steady-State Detection Termination Criterion (SSDTC). Both these criteria are evaluated in two evolutionary algorithms for MOO. Results show that CSTC and SSDTC are successful in giving optimal solutions close to those after MNG but well before MNG. Of the two criteria, CSTC is more reliable and terminates the search earlier, thus reducing computational time substantially.