.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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
Keyword:
evolutionary algorithms
many-objective optimization
many-objective evolutionary algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
11.7
论文数:
542
被引数:
5.3K
机构
引用论文
A new visualization method in many-objective optimization with chord diagram and angular mapping
PREAI
分享收藏
分享收藏Secale cereale inter-microsatellites (SCIMs): chromosomal location and genetic inheritance.png)
Genetica
GeneticaIF0
PREAI
分享收藏分享收藏
查看更多内容