Large-scale multimodal multiobjective evolutionary optimization based on hybrid hierarchical clustering

被引:25
作者
Ding, Zhuanlian [1 ]
Cao, Lve [1 ]
Chen, Lei [1 ]
Sun, Dengdi [2 ,4 ]
Zhang, Xingyi
Tao, Zhifu [3 ]
机构
[1] Anhui Univ, Sch Internet, Hefei 230039, Peoples R China
[2] Anhui Univ, Sch Artificial Intelligence, Key Lab Intelligent Comp & Signal Proc ICSP, Minist Educ, Hefei 230601, Peoples R China
[3] Anhui Univ, Sch Big Data & Stat, Hefei 230601, Peoples R China
[4] Hefei Comprehens Natl Sci Ctr, Inst Artificial Intelligence, Hefei 230026, Peoples R China
关键词
Multimodal multiobjective optimization; Evolutionary algorithm; Large-scale optimization; Hybrid hierarchical clustering; Sparse Pareto optimal solutions; SUBSET-SELECTION; ALGORITHM; BENCHMARKING; PERFORMANCE;
D O I
10.1016/j.knosys.2023.110398
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Large-scale multimodal multiobjective optimization problems (MMOPs) have different equivalent Pareto optimal solution sets (PSs) for the same Pareto front and contain a great number of decision variables. In particular, when most variables among the Pareto optimal solutions are zero, such problems are termed large-scale MMOPs with sparse Pareto optimal solutions. Due to the multimodal properties of these problems, the curse of dimensionality, and the unknown sparsity of the search space, it is extremely difficult for existing optimizers to solve them. In this study, we propose a multipopulation multimodal evolutionary algorithm based on hybrid hierarchical clustering to solve such problems. The proposed algorithm uses hybrid hierarchical clustering on subpopulations to distinguish the resources of different equivalent PSs and partition them into different subpopulations to achieve efficient cooperative coevolution among multiple subpopulations. Moreover, an adaptive variation method incorporating both local and global guiding information is designed, and an improved environmental selection method based on local guiding information is conducted to improve the convergence in a large search space and introduce diversity to the population. Experimental results verified that the proposed algorithm outperforms the state-of-the-art MOEAs in terms of performance and convergence speed, especially when the number of equivalent PSs is large.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:22
相关论文
共 57 条
[1]   A novel Whale Optimization Algorithm integrated with Nelder-Mead simplex for multi-objective optimization problems [J].
Abdel-Basset, Mohamed ;
Mohamed, Reda ;
Mirjalili, Seyedali .
KNOWLEDGE-BASED SYSTEMS, 2021, 212
[2]  
[Anonymous], 2012, P 21 ACM INT C INF K
[3]  
Bringmann K, 2014, LECT NOTES COMPUT SC, V8672, P518
[4]  
Chan K., 2005, INT C COMP ROB AUT S
[5]   A many-objective population extremal optimization algorithm with an adaptive hybrid mutation operation [J].
Chen, Min-Rong ;
Zeng, Guo-Qiang ;
Lu, Kang-Di .
INFORMATION SCIENCES, 2019, 498 :62-90
[6]   Test Problems for Large-Scale Multiobjective and Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON CYBERNETICS, 2017, 47 (12) :4108-4121
[7]  
Deb K, 2005, LECT NOTES COMPUT SC, V3410, P47
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]  
Deb K., 1995, Complex Systems, V9, P115
[10]  
Deb K., COMPUT SCI INFORM, V26, P30, DOI DOI 10.1109/TEVC.2007.895269