A Survey of Decomposition Based Evolutionary Algorithms for Many-Objective Optimization Problems
Xiaofang Guo
IEEE Access · 2022
doi:10.1109/access.2022.3188762 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY-NC-ND
References88
40 more references, whose wording the paper’s licence keeps private.
All 88 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.