.png){kind=icon}
.png){kind=icon}
Return
Cooperative Multiobjective Evolutionary Algorithm With Propulsive Population for Constrained Multiobjective Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2021.3069986.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Convergence, diversity and feasibility are three important issues when solving constrained multiobjective optimization problems (CMOPs). To deal with the balance among convergence, diversity and feasibility well, this article proposes a cooperative multiobjective evolutionary algorithm with propulsive population (CMOEA-PP) for solving CMOPs. CMOEA-PP has two populations, including propulsive population and normal population, and these two populations work cooperatively. Specifically, propulsive population focuses on convergence. Normal population gives priority to feasibility and is obligated to maintain diversity. To cross through the infeasible region and reach the Pareto front (PF), propulsive population does not consider constraints in the early stage and only considers constraints in the later stage. To further accelerate the speed of convergence, propulsive population only searches for corner solutions and center solutions, while normal population searches for the whole PF. As a result, propulsive population can cross through the infeasible region because of the lack of attention to feasibility. In addition, propulsive population also can guide and accelerate the convergence of the evolutionary process. Comprehensive experiment results on several sets of benchmark problems demonstrate that CMOEA-PP is better than existing state-of-the-art competitors.
Keywords:
Constrained multiobjective optimization
constraint handling
cooperative populations
propulsive population
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
View more organizations