A Novel Dual-Stage Dual-Population Evolutionary Algorithm for Constrained Multiobjective Optimization
- 29 November 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 26 (5) , 1129-1143
Abstract
In addition to the search for feasible solutions, the utilization of informative infeasible solutions is important for solving constrained multiobjective optimization problems (CMOPs). However, most of the existing constrained multiobjective evolutionary algorithms (CMOEAs) cannot effectively explore and exploit those solutions and, therefore, exhibit poor performance when facing problems with large infeasible regions. To address the issue, this article proposes a novel method, called DD-CMOEA, which features dual stages (i.e., exploration and exploitation) and dual populations. Specifically, the two populations, called mainPop and auxPop, first individually evolve with and without considering the constraints, responsible for exploring feasible and infeasible solutions, respectively. Then, in the exploitation stage, mainPop provides information about the location of feasible regions, which facilitates auxPop to find and exploit surrounding infeasible solutions. The promising infeasible solutions obtained by auxPop in turn help mainPop converge better toward the Pareto-optimal front. Extensive experiments on three well-known test suites and a real-world case study fully demonstrate that DD-CMOEA is more competitive than five state-of-the-art CMOEAs.Keywords
Funding Information
- National Natural Science Foundation of China (61773390, 61876075, 72071205)
- Hunan Youth Elite Program (2018RS3081)
- Stable Support Plan Program of Shenzhen Natural Science Fund (20200925174447003)
- Program for Guangdong Introducing Innovative and Enterpreneurial Teams (2017ZT07X386)
- Guangdong Provincial Key Laboratory (2020B121201001)
- National Science Fund for Outstanding Young Scholars (62122093)
- Scientific Key Research Project of National University of Defense Technology (ZZKY-ZX-11-04)
- Shenzhen Science and Technology Program (KQTD2016112514355531)
This publication has 33 references indexed in Scilit:
- Multi-objective Optimization with Dynamic Constraints and Objectives2015
- An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and DecompositionIEEE Transactions on Evolutionary Computation, 2014
- An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive ApproachIEEE Transactions on Evolutionary Computation, 2013
- A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/DApplied Soft Computing, 2013
- Constraint-handling in nature-inspired numerical optimization: Past, present and futureSwarm and Evolutionary Computation, 2011
- The balance between proximity and diversity in multiobjective evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Constrained Test Problems for Multi-objective Evolutionary Optimization2001
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A unified formulationIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 1998