Please use this identifier to cite or link to this item:
|Title:||An improved multi-objective differential evolution with a termination criterion for optimizing chemical processes||Authors:||Sharma, S.
|Issue Date:||3-Sep-2013||Citation:||Sharma, S., Rangaiah, G.P. (2013-09-03). An improved multi-objective differential evolution with a termination criterion for optimizing chemical processes. Computers and Chemical Engineering 56 : 155-173. ScholarBank@NUS Repository. https://doi.org/10.1016/j.compchemeng.2013.05.004||Abstract:||Application problems have conflicting objectives and constraints, and maximum number of generations is the most common termination criterion in evolutionary algorithms used for solving these applications. This study develops a termination criterion using the non-dominated solutions obtained as the search progresses. For this, several performance metrics are modified, and their variation with generations has been assessed on many test functions. Based on this analysis, it is proposed to terminate the search if the improvement in variance of two selected performance metrics obtained in recent generations is statistically insignificant. Additionally, evaluation of objectives and constraints is computationally expensive in many applications. This study uses taboo list with multi-objective differential evolution to avoid re-visits and for better exploration of search space. Benefits of the termination criterion and taboo list are assessed on constrained benchmark problems. The developed approach is then evaluated on three chemical engineering applications, namely, alkylation, Williams-Otto and fermentation processes. © 2013 Elsevier Ltd.||Source Title:||Computers and Chemical Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/63466||ISSN:||00981354||DOI:||10.1016/j.compchemeng.2013.05.004|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 16, 2021
WEB OF SCIENCETM
checked on Jun 8, 2021
checked on Jun 10, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.