logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

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

delete2022-01-01
delete8
delete
OA
AI
X
Xiaofang Guo *
DOI：10.1109/ACCESS.2022.3188762delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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.
Keywords:
Statistics
Sociology
Evolutionary computation
Convergence
Shape
Optimization
Licenses
Many-objective
decomposition
evolutionary algorithm

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

No organization information available