arrow
返回

A dynamic dual-population co-evolution multi-objective evolutionary algorithm for constrained multi-objective optimization problems

delete2023-07-01
delete12
PRE
AI
孔祥松 封面图
孔祥松 (Xiangsong Kong)
杨永宽 封面图
杨永宽 (Y. Yang) *
Z
Zhisheng Lv
Z
Zhao Jing
R
Rong Fu
DOI:10.1016/j.asoc.2023.110311delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Many multi-objective evolutionary algorithms are proposed to handle constrained multi-objective optimization problems. Nevertheless, they often fail to appropriately balance feasibility, convergence and diversity of the population. This paper proposed a dynamic dual-population co-evolution multi -objective evolutionary algorithm (DDCMEA) to solve this issue. In DDCMEA, a dynamic dual-population co-evolution strategy is employed to balance the convergence and the feasibility by dynamically adjusting the offspring number of the two populations. In the early stage of evolution, the algorithm mainly focuses on the convergence and more offspring of the first population are generated. In the late stage of evolution, the algorithm mainly focuses on the feasibility and more offspring of the second population are generated. Finally, feasible solutions with good convergence could be obtained. To further enhance the diversity of the offspring and obtain feasible solutions with a wide spread of distribution, the evolution operators of the genetic algorithm and the differential evolution are chosen as the search engines for the first population and the second population, respectively. The performance of DDCMEA is further tested through thirty-one bench-mark test problems and two real-world problems in comparison with other five state-of-the-art algorithms. The results show the proposed algorithm DDCMEA achieves competitive performance when handling constrained multi-objective optimization problems. & COPY; 2023 Elsevier B.V. All rights reserved.
Keyword:
Evolutionary algorithms
Constrained multi -objective optimization
problems
Dual-population
Dynamic co-evolution

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

X
Xiamen University of Technology
学者数:
3.9K
论文数: 2.5K
被引数: 5.1K
引用论文

引用论文

Push and pull search for solving constrained multi-objective optimization problems
err2019-02-01
err342
errOAAI
errFan, Zhun; Li, Wenji; Cai, Xinye; Li, Hui; Wei, Caimin; Zhang, Qingfu; Deb, Kalyanmoy; Goodman, Erik
err分享
err收藏
学者 查看更多内容