.png){kind=icon}
.png){kind=icon}
Return
An overview on evolutionary algorithms for many-objective optimization problems
.png){kind=icon}
OA
AI
DOI：10.1002/widm.1267.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multiobjective evolutionary algorithms (MOEAs) effectively solve several complex optimization problems with two or three objectives. However, when they are applied to many-objective optimization, that is, when more than three criteria are simultaneously considered, the performance of most MOEAs is severely affected. Several alternatives have been reported to reproduce the same performance level that MOEAs have achieved in problems with up to three objectives when considering problems with higher dimensions. This work briefly reviews the main search difficulties, visualization, evaluation of algorithms, and new procedures in many-objective optimization using evolutionary methods. Approaches for the development of evolutionary many-objective algorithms are classified into: (a) based on preference relations, (b) aggregation-based, (c) decomposition-based, (d) indicator-based, and (e) based on dimensionality reduction. The analysis of the reviewed works indicates the promising future of such methods, especially decomposition-based approaches; however, much still need to be done to develop more robust, faster, and predictable evolutionary many-objective algorithms. This article is categorized under: Technologies > Computational Intelligence
Keywords:
evolutionary algorithms
many-objective optimization
many-objective evolutionary algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
11.7
Papers:
537
Citations:
5.3K