An Angle-based Many-Objective evolutionary algorithm with Shift-based density estimation and sum of objectives

被引:8
作者
Zhang, Jianlin [1 ,2 ]
Cao, Jie [1 ,2 ]
Zhao, Fuqing [1 ,2 ]
Chen, Zuohan [1 ,2 ]
机构
[1] Lanzhou Univ Technol, Sch Comp & Commun Technol, Lanzhou 730050, Peoples R China
[2] Gansu Engn Res Ctr Mfg Informationizat, Lanzhou 730050, Peoples R China
基金
浙江省自然科学基金; 中国国家自然科学基金;
关键词
Many-objective optimization; Angle-based selection; Shift-based density estimation; Evolutionary optimization; NONDOMINATED SORTING APPROACH; DOMINANCE; DIVERSITY; SELECTION; MOEA/D;
D O I
10.1016/j.eswa.2022.118333
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Due to the curse of dimensionality, the existing evolutionary algorithms have difficulties in balancing convergence and diversity in many-objective problems. To address this shortcoming, this paper proposes an efficient many-objective optimizer named MaOEA-ASS. In the MaOEA-ASS, the angle-based selection strategy is used to obtain solutions with good diversity from the population. In addition, the combination of the shift-based density estimation and the sum of objectives, which uses the iteration information and emphasis the distribution of solutions, is employed to obtain the high-quality solutions approximating the optimal Pareto solutions. The proposed MaOEA-ASS is compared with eight state-of-the-art many-objective optimization algorithms (MaOEAs) on the DTLZ and WFG test suites, and its performance is verified on a practical many-objective problem. The experimental results demonstrate that the proposed MaOEA-ASS has a superior performance over the peer competitors on all considered many-objective problems.
引用
收藏
页数:17
相关论文
共 63 条
[1]   A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization [J].
Asafuddoula, M. ;
Ray, Tapabrata ;
Sarker, Ruhul .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (03) :445-460
[2]   HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization [J].
Bader, Johannes ;
Zitzler, Eckart .
EVOLUTIONARY COMPUTATION, 2011, 19 (01) :45-76
[3]   A Pareto-based many-objective evolutionary algorithm using space partitioning selection and angle-based truncation [J].
Bai, Hui ;
Zheng, Jinhua ;
Yu, Guo ;
Yang, Shengxiang ;
Zou, Juan .
INFORMATION SCIENCES, 2019, 478 :186-207
[4]   A new dominance-relation metric balancing convergence and diversity in multi- and many-objective optimization [J].
Bao, Chunteng ;
Xu, Lihong ;
Goodman, Erik D. .
EXPERT SYSTEMS WITH APPLICATIONS, 2019, 134 :14-27
[5]   A novel two-archive matching-based algorithm for multi- and many-objective optimization [J].
Bao, Chunteng ;
Xu, Lihong ;
Goodman, Erik D. .
INFORMATION SCIENCES, 2019, 497 :106-128
[6]   The balance between proximity and diversity in multiobjective evolutionary algorithms [J].
Bosman, PAN ;
Thierens, D .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :174-188
[7]   Decomposition-Based-Sorting and Angle-Based-Selection for Evolutionary Multiobjective and Many-Objective Optimization [J].
Cai, Xinye ;
Yang, Zhixiang ;
Fan, Zhun ;
Zhang, Qingfu .
IEEE TRANSACTIONS ON CYBERNETICS, 2017, 47 (09) :2824-2837
[8]   R2-IBMOLS applied to a practical case of the multiobjective knapsack problem [J].
Chabane, Brahim ;
Basseur, Matthieu ;
Hao, Jin-Kao .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 71 :457-468
[9]   An adaptive switching-based evolutionary algorithm for many-objective optimization [J].
Chen, Sanyan ;
Wang, Xuewu ;
Gao, Jin ;
Du, Wei ;
Gu, Xingsheng .
KNOWLEDGE-BASED SYSTEMS, 2022, 248
[10]   A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) :773-791