.png){kind=icon}
返回
An adaptive switching-based evolutionary algorithm for many-objective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2022.108915.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Pareto-based evolutionary algorithms are challenging in dealing with many-objective problems encountering many incomparable nondominated solutions. To reduce selection pressure and improve diversity, this paper proposes an adaptive switching strategy-based evolutionary algorithm for manyobjective optimization. This strategy contains two deletion criteria, which are switched adaptively between generations, aiming to delete poor solutions one by one in environmental selection. The first criterion is devised to delete the solution with poor convergence among the two most similar solutions. The second criterion is developed to delete the worse solution according to a designed indicator that takes into account both convergence and diversity. Finally, comparisons with five state-of-theart many-objective evolutionary algorithms on some widely used benchmark problems and the water resource planning problem are given to illustrate the effectiveness and advantages of the proposed algorithm. (C) 2022 Elsevier B.V. All rights reserved.
Keyword:
Convergence
Diversity
Adaptive switching
Evolutionary algorithm
Many-objective optimization
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
暂无机构信息
引用论文
Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization在进化多目标优化中使用平均Hausdorff距离作为性能度量
.png){kind=icon}
PREAI
分享收藏
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏分享收藏
分享收藏
查看更多内容