A novel multi-population evolutionary algorithm based on hybrid collaboration for constrained multi-objective optimization

被引:12
作者
Wang, Qiuzhen [1 ,2 ,3 ]
Li, Yanhong [1 ,2 ,3 ]
Hou, Zhanglu [1 ,2 ,3 ]
Zou, Juan [1 ,2 ,3 ]
Zheng, Jinhua [1 ,2 ,3 ]
机构
[1] Xiangtan Univ, Sch Comp Sci, Key Lab Intelligent Comp & Informat Proc, Minist Educ, Xiangtan, Hunan, Peoples R China
[2] Xiangtan Univ, Sch Cyberspace Sci, Xiangtan, Hunan, Peoples R China
[3] Xiangtan Univ, Fac Sch Comp Sci, Xiangtan 411105, Peoples R China
基金
中国国家自然科学基金;
关键词
Constrained multi-objective optimization; Multi-population algorithms; Hybrid collaboration; Constraint handling; HANDLING METHOD;
D O I
10.1016/j.swevo.2024.101581
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi -population -based methods are widely employed for solving constrained multiobjective optimization problems (CMOPs). The population collaboration strategy is a critical part of multi -population algorithms, and different collaboration strategies perform well on different complex CMOPs. However, these single -population collaboration strategies are still challenging to adapt to various CMOPs with different characteristics. To address this issue, we propose a novel tri-population hybrid collaboration evolutionary algorithm called TPHCEA, which includes a constraint -relaxed population (denoted as mainpop ), a constraint -ignored auxiliary population (denoted as auxpop 1 ), and an auxiliary population (denoted as auxpop 2 ) for the original CMOP, to search optimal solutions in the feasible region. Specifically, due to the different complementarities of the two auxiliary populations, mainpop collaborates with auxpop 1 and auxpop 2 in a dynamic choice between strong and weak cooperation. The effectiveness of TP-HCEA is validated through comparative analysis with seven state-of-the-art algorithms in four CMOP benchmark suites and nine real -world problems.
引用
收藏
页数:14
相关论文
共 53 条
[1]  
[Anonymous], Multi-Objective Demand Optimization Including an Air Conditioner, DOI DOI 10.5555/559152
[2]   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
[3]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[4]   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
[5]  
Deb K., 1995, Complex Systems, V9, P115
[6]  
Deb K., 1996, COMPUTER SCI INFORMA, V26, P30
[7]  
Deb K, 2019, STUD COMPUT INTELL, V779, P85, DOI 10.1007/978-3-319-91341-4_6
[8]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[9]   Multi-objective spotted hyena optimizer: A Multi-objective optimization algorithm for engineering problems [J].
Dhiman, Gaurav ;
Kumar, Vijay .
KNOWLEDGE-BASED SYSTEMS, 2018, 150 :175-197
[10]   An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions [J].
Fan, Zhun ;
Li, Wenji ;
Cai, Xinye ;
Huang, Han ;
Fang, Yi ;
You, Yugen ;
Mo, Jiajie ;
Wei, Caimin ;
Goodman, Erik .
SOFT COMPUTING, 2019, 23 (23) :12491-12510