.png){kind=icon}
返回
A Scalar Projection and Angle-Based Evolutionary Algorithm for Many-Objective Optimization Problems
.png){kind=icon}
OA
AI
DOI：10.1109/TCYB.2018.2819360.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In decomposition-based multiobjective evolutionary algorithms, the setting of search directions (or weight vectors), and the choice of reference points (i.e., the ideal point or the nadir point) in scalarizing functions, are of great importance to the performance of the algorithms. This paper proposes a new decomposition-based many-objective optimizer by simultaneously using adaptive search directions and two reference points. For each parent, binary search directions are constructed by using its objective vector and the two reference points. Each individual is simultaneously evaluated on two fitness functions-which are motivated by scalar projections-that are deduced to be the differences between two penalty-based boundary intersection (PBI) functions, and two inverted PBI functions, respectively. Solutions with the best value on each fitness function are emphasized. Moreover, an angle-based elimination procedure is adopted to select diversified solutions for the next generation. The use of adaptive search directions aims at effectively handling problems with irregular Pareto-optimal fronts, and the philosophy of using the ideal and nadir points simultaneously is to take advantages of the complementary effects of the two points when handling problems with either concave or convex fronts. The performance of the proposed algorithm is compared with seven state-of-the-art multi-/many-objective evolutionary algorithms on 32 test problems with up to 15 objectives. It is shown by the experimental results that the proposed algorithm is flexible when handling problems with different types of Pareto-optimal fronts, obtaining promising results regarding both the quality of the returned solution set and the efficiency of the new algorithm.
Keyword:
Dynamic decomposition
evolutionary algorithms
many-objective optimization
reference points
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
An Improved Multiobjective Optimization Evolutionary Algorithm Based on Decomposition for Complex Pareto Fronts一种改进的基于复杂帕累托前沿分解的多目标优化进化算法OAAI
OAAI分享收藏Refining Estimates of Bird Collision and Electrocution Mortality at Power Lines in the United States.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAI分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
查看更多内容