arrow
Return

Maximum angle evolutionary selection for many-objective optimization algorithm with adaptive reference vector

delete2021-11-01
delete8
PRE
AI
Z
Zhijian Xiong
J
Jingming Yang
赵
赵志伟 (Zhiwei Zhao) *
Y
Yongqiang Wang
Z
Zhigang Yang
DOI:10.1007/s10845-021-01865-1delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
How to maintain a good balance between convergence and diversity is particularly important for the performance of the many-objective evolutionary algorithms. Especially, the many-objective optimization problem is a complicated Pareto front, the many-objective evolutionary algorithm can easily converge to a narrow of the Pareto front. An efficient environmental selection and normalization method are proposed to address this issue. The maximum angle selection method based on vector angle is used to enhance the diversity of the population. The maximum angle rule selects the solution as reference vector can work well on complicated Pareto front. A penalty-based adaptive vector distribution selection criterion is adopted to balance convergence and diversity of the solutions. As the evolution process progresses, the new normalization method dynamically adjusts the implementation of the normalization. The experimental results show that new algorithm obtains 30 best results out of 80 test problems compared with other five many-objective evolutionary algorithms. A large number of experiments show that the proposed algorithm has better performance, when dealing with numerous many-objective optimization problems with regular and irregular Pareto Fronts.
Keywords:
Penalty based vector distribution
Maximum angle based
Many-objective optimization
Evolutionary algorithms
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Journal of Intelligent Manufacturing cover
Journal of Intelligent Manufacturing
IF:
7.4
Papers:
3.5K
Citations:
1.1W

Organization

Y
Yanshan University
Scholars:
1.7W
Papers: 1.1W
Citations: 1.3W
T
Tangshan University
Scholars:
285
Papers: 191
Citations: 0
Cited Papers

Cited Papers

A Grid-Based Inverted Generational Distance for Multi/Many-Objective Optimization
err2021-02-01
err55
errOAAI
errCai, Xinye; Xiao, Yushun; Li, Miqing; Hu, Han; Ishibuchi, Hisao; Li, Xiaoping
errShare
errSave
errShare
errSave
A Novel Sigmoid-Function-Based Adaptive Weighted Particle Swarm Optimizer
err2021-02-01
err224
errOAAI
errLiu, Weibo; Wang, Zidong; Yuan, Yuan; Zeng, Nianyin; Hone, Kate; Liu, Xiaohui
errShare
errSave
On the Norm of Dominant Difference for Many-Objective Particle Swarm Optimization
err2021-04-01
err40
PREAI
errLi, Li; Chang, Liang; Gu, Tianlong; Sheng, Weiguo; Wang, Wanliang
errShare
errSave
researcher View more