A Many-Objective Evolutionary Algorithm with Local Shifted Density Estimation Based on Dynamic Decomposition

被引:2
作者
Wei, Li-sen [1 ]
Li, Er-chao [1 ]
机构
[1] Lanzhou Univ Technol, Coll Elect Engn & Informat Engn, Lanzhou 730050, Gansu, Peoples R China
关键词
Many objective optimization problems; Local shifted density estimation; Dynamic decomposition; OPTIMIZATION; DESIGN; MOEA/D;
D O I
10.1016/j.jksuci.2023.101693
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Pareto dominance-based many-objective evolutionary algorithms (PDMaOEAs) are challenging in dealing with many-objective problems (MaOPs) encountering many incomparable nondominated solutions. Recently, convergence-related metrics have been incorporated into PDMaOEAs to enhance the selection pressure approaching the true Pareto front and furtherly improve the balance of diversity and conver-gence, however these approaches still have limitations. To address the drawbacks of the previous approaches, a many objective evolutionary algorithm with local shifted density estimation based on dynamic decomposition (MaOEA/LSD-DD) is proposed in this paper. The proposed MaOEA/LSD-DD main-tains the convergence and diversity of populations through the dynamic synergy of dynamic decompo-sition and shifted density estimation. First, identifying potential regions through dynamic decomposition can reduce redundant evaluation to save computational resources and maintain good dis-tribution. Then, shifted density estimation is executed in potential regions to selected the individuals with good diversity and convergence into next generation population. Finally, this process is repeated until the population size is satisfied. The performance of the MaOEA/LSD-DD is investigated extensively on 28 test problem from three popular benchmark problem suites and a practical problem of water resource planning problem by comparing them with seven excellent MaOEAs. The experimental results show the effectiveness of the proposed MaOEA/LSD-DD in keeping a good tradeoff between diversity and convergence over other MaOEAs when solving most of these MaOPs.(c) 2023 The Authors. Published by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
引用
收藏
页数:22
相关论文
共 54 条
[51]   An efficient interval many-objective evolutionary algorithm for cloud task scheduling problem under uncertainty [J].
Zhang, Zhixia ;
Zhao, Mengkai ;
Wang, Hui ;
Cui, Zhihua ;
Zhang, Wensheng .
INFORMATION SCIENCES, 2022, 583 :56-72
[52]   Pressure point driven evolutionary algorithm for many-objective optimization [J].
Zhu, Jianghan ;
Chen, Huangke ;
Wu, Guohua ;
Chen, Li ;
Li, Haifeng .
SWARM AND EVOLUTIONARY COMPUTATION, 2019, 51
[53]  
Zitzler E, 2004, LECT NOTES COMPUT SC, V3242, P832
[54]   A many-objective evolutionary algorithm based on dominance and decomposition with reference point adaptation [J].
Zou, Juan ;
Zhang, Zhenghui ;
Zheng, Jinhua ;
Yang, Shengxiang .
KNOWLEDGE-BASED SYSTEMS, 2021, 231