.png){kind=icon}
返回
A Novel Dual-Stage Dual-Population Evolutionary Algorithm for Constrained Multiobjective Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2021.3131124.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Statistics
Sociology
Optimization
Search problems
Evolutionary computation
Convergence
Switches
Coevolution
constrained multiobjective optimization problems (CMOPs)
exploitation
exploration
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective OptimizationPlatEMO: 用于进化多目标优化的MATLAB平台
OAAI
OAAI分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏分享收藏An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏分享收藏
查看更多内容