.png){kind=icon}
返回
A coevolutionary algorithm based on reference line guided archive for constrained multiobjective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2023.110169.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The objective space of the constrained multiobjective optimization problem (CMOP) is constantly torn by the applied constraints. This makes evolutionary algorithms, which are driven by objectives, face greater difficulties in feasibility, convergence, and diversity. Most evolutionary algorithms will be trapped in local optimums such as a fake Pareto-optimal front or a mutilated Pareto-optimal front. To address this issue, this paper proposes an archive-assisted evolutionary framework with a novel archive structure and cooperative mechanism. A reference line guided archive (RA) is established to record the evolution of the unconstrained solutions. The updated criteria of RA are based on the distance from the individual to the reference line and the unconstrained dominance relation. A specially designed adaptive mating selection operator will select mating parents from RA and the main population according to the convergence of the main population and RA, respectively. The participation of RA in offspring reproduction is conducive to skipping infeasible regions for extensive searches. The performance of the archive-assisted nondominated sorting genetic algorithm (AA-NSGA), which embeds the proposed archive strategy into the nondominated sorting genetic algorithm II, is compared with four state-of-the-art constrained multiobjective evolutionary algorithms (MOEAs). The experimental results on 38 benchmark CMOPs and a reactor network design problem show that the proposed AA-NSGA has a high performance among the existing MOEAs in terms of feasibility, convergence, and diversity. (c) 2023 Published by Elsevier B.V.
Keyword:
Evolutionary algorithm
Nondominated sorting
Constrained multiobjective optimization
Archive strategy
Cooperative mechanism
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
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
分享收藏Duality evolution: an efficient approach to constraint handling in multi-objective particle swarm optimization.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms关于使用非参数统计检验作为比较进化和群体智能算法的方法的实用教程
PREAI
分享收藏An infeasible solutions diversity maintenance epsilon constraint handling method for evolutionary constrained multiobjective optimizationSOFT COMPUTINGOAAI
SOFT COMPUTINGIF2.5
OAAI分享收藏
查看更多内容