.png){kind=icon}
返回
Two-stage bidirectional coevolutionary algorithm for constrained multi-objective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2024.101784.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Objective optimization and constraint satisfaction are two primary and conflicting tasks in solving constrained multi-objective optimization problems (CMOPs). To better trade off them, this paper proposes a two-stage bidirectional coevolutionary algorithm, termed C-TBCEA, for constrained multi-objective optimization. It consists of two stages, with each concentrating on specific targets, i.e., the first stage primarily focuses on objective optimization while the second stage focuses on constraint satisfaction by employing different evolutionary strategies at each stage. Via the synergy of the two stages, a dynamic trade-off between objective optimization and constraint satisfaction can be achieved, thus overcoming the distinctive challenges that may be encountered at different stages of evolution. In addition, to take advantage of both feasible and infeasible solutions, we employ two populations, i.e., the main population that stores the non-dominated feasible solutions and the archive population that maintains the informative infeasible solutions, to prompt the bidirectional coevolution of them. To validate the effectiveness of the proposed C-TBCEA, experiments are carried out on 6 CMOP test suites and 17 real-world CMOPs. The results demonstrate that the proposed algorithm is very competitive with 9 state-of-the-art constrained multi-objective optimization evolutionary algorithms (CMOEAs).
Keyword:
Constrained multi-objective optimization
Two-stage
Bidirectional coevolution
Evolutionary algorithms
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
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 infeasible solutions diversity maintenance epsilon constraint handling method for evolutionary constrained multiobjective optimization.png)
SOFT COMPUTINGOAAI
SOFT COMPUTINGIF2.5
OAAI分享收藏
查看更多内容