.png){kind=icon}
返回
Adaptive neighborhood selection for many-objective optimization problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.asoc.2017.11.041.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
It is generally accepted that conflicts between convergence and distribution deteriorate with an increase in the number of objectives. Furthermore, Pareto dominance loses its effectiveness in many-objectives optimization problems (MaOPs), which have more than three objectives. Therefore, a more valid selection method is needed to balance convergence and distribution. This paper presents a many objective evolutionary algorithm, called Adaptive Neighborhood Selection for Many-objective evolutionary algorithm(ANS-MOEA), to deal with MaOPs. This method defines the performance of each individual by two types of information, convergence information (CI) and distribution information (DI). In the critical layer, a well-converged individual is selected first from the population, and its neighbors, calculated by DI, are pushed into neighbor collection (NC) soon afterwards. Then, the proper distribution of the population is ensured by competition individuals with large DI go back to the population and individuals with small DI remain in the collection. Four state-of-the-art MaOEAs are selected as the competitive algorithms to validate ANS-MOEA. The experimental results show that ANS-MOEA can solve a MaOP and generate a set of remarkable solutions to balance convergence and distribution. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Many-objective optimization problems
Critical layer
Distribution
Convergence
Neighborhoods
Selection mechanism
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容