Constrained Multiobjective Optimization With Escape and Expansion Forces
- 26 April 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 29 (1) , 2-15
Abstract
Constraints may scatter the Pareto optimal solutions of a constrained multiobjective optimization problem (CMOP) into multiple feasible regions. To avoid getting trapped in local optimal feasible regions or a part of the global optimal feasible regions, a constrained multiobjective evolutionary algorithm (CMOEA) should consider both the escape force and the expansion force carefully during the search process. However, most CMOEAs fail to provide these two forces effectively. As a remedy for this limitation, this article proposes a method called three-population evolutionary algorithm (TPEA). TPEA maintains three populations, termed Pop1, Pop2, and Pop3. Pop1 is a regular population, updated with a constrained NSGA-II variant. Pop2 and Pop3 are two auxiliary populations, containing the innermost and outermost nondominated infeasible solutions, respectively. The analysis reveals that these two types of nondominated infeasible solutions can contribute to the generation of escape and expansion forces, respectively. Due to these two forces, TPEA is likely to identify more global optimal feasible regions, which is crucial for constrained multiobjective optimization. Also, a mating selection strategy is developed in TPEA to coordinate the interaction among these three populations. Extensive experiments on 58 benchmark CMOPs and 35 real-world ones demonstrate that TPEA is significantly superior or comparable to six state-of-the-art CMOEAs on most test instances.Keywords
Funding Information
- National Natural Science Foundation of China (62206090, 61860206011)
- China Postdoctoral Science Foundation (2022M711112)
- National Key Research and Development Program of China (2020YFB2104000, 2021YFA1000600, 2021YFB0300102)
This publication has 52 references indexed in Scilit:
- Differential evolution with rankings-based fitness function for constrained optimization problemsApplied Soft Computing, 2021
- A multi-objective evolutionary algorithm for steady-state constrained multi-objective optimization problemsApplied Soft Computing, 2021
- A constrained multi-objective evolutionary algorithm based on decomposition and dynamic constraint-handling mechanismApplied Soft Computing, 2020
- AnD: A many-objective evolutionary algorithm with angle-based selection and shift-based density estimationInformation Sciences, 2020
- An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regionsSoft Computing, 2019
- A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/DApplied Soft Computing, 2013
- Infeasibility Driven Evolutionary Algorithm for Constrained Optimization2009
- KEEL: a software tool to assess evolutionary algorithms for data mining problemsSoft Computing, 2008
- Constrained Test Problems for Multi-objective Evolutionary Optimization2001
- Multiobjective optimization using evolutionary algorithms — A comparative case study1998