.png){kind=icon}
返回
Many-objective evolutionary optimization based on reference points
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2016.11.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many-objective optimization problems are common in real-world applications, few evolutionary optimization methods, however, are suitable for solving them up to date due to their difficulties. A reference points-based evolutionary algorithm (RPEA) was proposed in this paper to solve many-objective optimization problems. The aim of this study is to exploit the potential of the reference points-based approach to strengthen the selection pressure towards the Pareto front while maintaining an extensive and uniform distribution among solutions. In RPEA, a series of reference points with good performances in convergence and distribution are continuously generated according to the current population to guide the evolution. Furthermore, superior individuals are selected based on the evaluation of each individual by calculating the distances between the reference points and the individual in the objective space. The proposed algorithm was applied to seven benchmark optimization problems and compared with epsilon-MOEA, HypE, MOEA/D and NSGA-III. The results empirically show that the proposed algorithm has a good adaptability to problems with irregular or degenerate Pareto fronts, whereas the other reference points-based algorithms do not. Moreover, it outperforms the other four in 8 out of 21 test instances, demonstrating that it has an advantage in obtaining a Pareto optimal set with good performances. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Evolutionary optimization
Multi-objective optimization
Many-objective optimization
Reference point
Distance
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints使用基于参考点的非支配排序方法的进化多目标优化算法，第一部分: 解决框约束问题
PREAI
分享收藏
查看更多内容