A Survey of Decomposition Based Evolutionary Algorithms for Many-Objective Optimization Problems

被引:9
作者
Guo, Xiaofang [1 ]
机构
[1] Xian Technol Univ, Sch Sci, Xian 710021, Peoples R China
基金
中国国家自然科学基金;
关键词
Statistics; Sociology; Evolutionary computation; Convergence; Shape; Optimization; Licenses; Many-objective; decomposition; evolutionary algorithm; MULTIOBJECTIVE OPTIMIZATION; SCALARIZING FUNCTIONS; MOEA/D; REDUCTION; DIVERSITY; SELECTION; DESIGN; CONVERGENCE; ADJUSTMENT; OPERATOR;
D O I
10.1109/ACCESS.2022.3188762
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The framework of decomposition-based multi-objective evolutionary algorithms(MOEA/D) has evolved for more than ten years, and it has become irreplaceable tool for solving multi-objective optimization problems. In recent years, many scholars have investigated improved strategies from different directions. This paper gives a systematic comparison of six different components for decomposition-based algorithms, including framework analysis, weight vector generation scheme, aggregation evaluation function construction, reproduction operator, individual selection and update strategy, and the characteristics and application scope of various algorithms are also analyzed in detail in the survey. Different from previous survey on decomposition-based multi-objective evolutionary algorithms, a more detailed classification and experimental comparison are elaborated in the proposed paper.
引用
收藏
页码:72825 / 72838
页数:14
相关论文
共 50 条
[31]   A Decomposition-Based Many-Objective Evolutionary Algorithm With Two Types of Adjustments for Direction Vectors [J].
Cai, Xinye ;
Mei, Zhiwei ;
Fan, Zhun .
IEEE TRANSACTIONS ON CYBERNETICS, 2018, 48 (08) :2335-2348
[32]   A new uniform evolutionary algorithm based on decomposition and CDAS for many-objective optimization [J].
Dai Cai ;
Wang Yuping .
KNOWLEDGE-BASED SYSTEMS, 2015, 85 :131-142
[33]   A Many-Objective Evolutionary Algorithm With Pareto-Adaptive Reference Points [J].
Xiang, Yi ;
Zhou, Yuren ;
Yang, Xiaowei ;
Huang, Han .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (01) :99-113
[34]   An overview on evolutionary algorithms for many-objective optimization problems [J].
von Lucken, Christian ;
Brizuela, Carlos ;
Baran, Benjamin .
WILEY INTERDISCIPLINARY REVIEWS-DATA MINING AND KNOWLEDGE DISCOVERY, 2019, 9 (01)
[35]   Explicit Control of Implicit Parallelism in Decomposition-Based Evolutionary Many-Objective Optimization Algorithms [J].
Chen, Lei ;
Deb, Kalyanmoy ;
Liu, Hai-Lin .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2019, 14 (04) :52-64
[36]   A Two-Stage Evolutionary Algorithm With Balanced Convergence and Diversity for Many-Objective Optimization [J].
Ming, Fei ;
Gong, Wenyin ;
Wang, Ling .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022, 52 (10) :6222-6234
[37]   Survey on evolutionary many-objective optimization algorithms [J].
Liu, Jian-Chang ;
Li, Fei ;
Wang, Hong-Hai ;
Li, Tian-Jun .
Kongzhi yu Juece/Control and Decision, 2018, 33 (05) :879-887
[38]   An evolutionary based framework for many-objective optimization problems [J].
Lari, Kimia Bazargan ;
Hamzeh, Ali .
ENGINEERING COMPUTATIONS, 2018, 35 (04) :1805-1828
[39]   An evolutionary many-objective algorithm based on decomposition and hierarchical clustering selection [J].
Sun, Yuehong ;
Xiao, Kelian ;
Wang, Siqiong ;
Lv, Qiuyue .
APPLIED INTELLIGENCE, 2022, 52 (08) :8464-8509
[40]   An adaptive clustering-based evolutionary algorithm for many-objective optimization problems [J].
Liu, Songbai ;
Yu, Qiyuan ;
Lin, Qiuzhen ;
Tan, Kay Chen .
INFORMATION SCIENCES, 2020, 537 :261-283