Hybrid multi-objective optimization algorithm based on angle competition and neighborhood protection mechanism

被引:3
作者
Li, Yang [1 ,2 ]
Li, Weigang [1 ,2 ]
Zhao, Yuntao [1 ,2 ]
Li, Songtao [1 ,2 ]
机构
[1] Wuhan Univ Sci & Technol, Sch Informat Sci & Engn, Wuhan 430081, Peoples R China
[2] Wuhan Univ Sci & Technol, Minist Educ, Engn Res Ctr Met Automat & Measurement Technol, Wuhan 430081, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-objective optimization; Neighborhood protection strategy; Hybrid operator; Angle competition mechanism; MANY-OBJECTIVE OPTIMIZATION; NONDOMINATED SORTING APPROACH; EVOLUTIONARY ALGORITHM; MULTIPLE OBJECTIVES; DECOMPOSITION; STRATEGY; MOEA/D;
D O I
10.1007/s10489-022-03920-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
During recent decades, multi-objective optimization has aroused extensive attention, and a variety of related algorithms have been proposed. A hybrid multi-objective optimization algorithm based on angle competition and neighborhood protection mechanism (HCPMOEA) is proposed in this paper. First, an environmental selection strategy based on neighborhood protection is introduced to make great compromises between optimization performance and time consumption. Then, the difference between Genetic algorithm and Differential evolution is analyzed from the perspective of offspring distribution and a hybrid operator is proposed to obtain good balances between exploration and exploitation. Besides, an elite set is employed to improve chances of the superior solutions generating offspring, and angle competition strategy is adopted to realize optimization matching of parents, thus improving the quality of offspring. The performance of HCPMOEA has been proved by comparing with 13 classic or state-of-the-arts algorithms on 19 standard benchmark, and the corresponding results show the competitive advantages in effectiveness and efficiency. In addition, the practicality of the proposed HCPMOEA is further verified by two real-world instances. Therefore, all of the aforementioned results have proved the superiority of the proposed HCPMOEA in solving bi-objective and tri-objective problems.
引用
收藏
页码:9598 / 9620
页数:23
相关论文
共 62 条
[21]   A Clustering-Based Adaptive Evolutionary Algorithm for Multiobjective Optimization With Irregular Pareto Fronts [J].
Hua, Yicun ;
Jin, Yaochu ;
Hao, Kuangrong .
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (07) :2758-2770
[22]  
Ishibuchi H, 2008, IEEE C EVOL COMPUTAT, P2419, DOI 10.1109/CEC.2008.4631121
[23]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach [J].
Jain, Himanshu ;
Deb, Kalyanmoy .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :602-622
[24]   A Strength Pareto Evolutionary Algorithm Based on Reference Direction for Multiobjective and Many-Objective Optimization [J].
Jiang, Shouyong ;
Yang, Shengxiang .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2017, 21 (03) :329-346
[25]  
Kukkonen S, 2005, IEEE C EVOL COMPUTAT, P443
[26]   A multi-objective bat algorithm with a novel competitive mechanism and its application in controller tuning [J].
Li, Hu ;
Song, Bao ;
Tang, Xiaoqi ;
Xie, Yuanlong ;
Zhou, Xiangdong .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2021, 106 (106)
[27]   Biased Multiobjective Optimization and Decomposition Algorithm [J].
Li, Hui ;
Zhang, Qingfu ;
Deng, Jingda .
IEEE TRANSACTIONS ON CYBERNETICS, 2017, 47 (01) :52-66
[28]   Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II [J].
Li, Hui ;
Zhang, Qingfu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (02) :284-302
[29]   Two-Archive Evolutionary Algorithm for Constrained Multiobjective Optimization [J].
Li, Ke ;
Chen, Renzhi ;
Fu, Guangtao ;
Yao, Xin .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2019, 23 (02) :303-315
[30]   Pareto or Non-Pareto: Bi-Criterion Evolution in Multiobjective Optimization [J].
Li, Miqing ;
Yang, Shengxiang ;
Liu, Xiaohui .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) :645-665