A Population Cooperation based Particle Swarm Optimization algorithm for large-scale multi-objective optimization

被引:15
作者
Lu, Yongfan [1 ,2 ]
Li, Bingdong [1 ,2 ]
Liu, Shengcai [3 ]
Zhou, Aimin [1 ,2 ]
机构
[1] East China Normal Univ, Shanghai Inst AI Educ, Shanghai 200062, Peoples R China
[2] East China Normal Univ, Sch Comp Sci & Technol, Shanghai 200062, Peoples R China
[3] ASTAR, Ctr Frontier AI Res, Singapore 138632, Singapore
关键词
Particle swarm optimization; Large-scale; Multiple population cooperation; Multi-objective optimization; MANY-OBJECTIVE OPTIMIZATION; EVOLUTIONARY ALGORITHM; ADAPTATION;
D O I
10.1016/j.swevo.2023.101377
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
There are many multi-objective optimization problems (MOPs) in real life that contain a large number of decision variables, such as auto body parts design, financial investment, engineering design, adversarial textual attack and so on. These problems are known as large-scale multi-objective optimization problems (LSMOPs). Due to the curse of dimensionality, existing multi-objective evolutionary algorithm encounter difficulties in balancing convergence and diversity on LSMOPs. In this paper, a Population Cooperation based Particle Swarm Optimization algorithm (PCPSO) is proposed for tackling LSMOPs. To be specific, PCPSO is a two-stage optimizer with two key components: (1) In the first stage, an inter-population collaboration component named Auxiliary Population Cooperation (APC) is used to improve the convergence speed. (2) In the second stage, an intra-subpopulation collaboration component called SubPopulation Cooperation (SPC) is applied to balance convergence and diversity. Experimental results on benchmark problems with up to 5000 decision variables and 2, 3, 5, 10 objectives demonstrate that the proposed PCPSO achieves better performance than several state-of-the-art large-scale multi-objective evolutionary algorithms (LSMOEAs) on most test problems.
引用
收藏
页数:16
相关论文
共 45 条
[1]   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
[2]   Solving large-scale many-objective optimization problems by covariance matrix adaptation evolution strategy with scalable small subpopulations [J].
Chen, Huangke ;
Cheng, Ran ;
Wen, Jinming ;
Li, Haifeng ;
Weng, Jian .
INFORMATION SCIENCES, 2020, 509 :457-469
[3]   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
[4]   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
[5]  
Coello CAC, 2002, IEEE C EVOL COMPUTAT, P1051, DOI 10.1109/CEC.2002.1004388
[6]   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
[7]   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
[8]   A Multivariation Multifactorial Evolutionary Algorithm for Large-Scale Multiobjective Optimization [J].
Feng, Yinglan ;
Feng, Liang ;
Kwong, Sam ;
Tan, Kay Chen .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2022, 26 (02) :248-262
[9]  
Fleming PJ, 2005, LECT NOTES COMPUT SC, V3410, P14
[10]   Completely derandomized self-adaptation in evolution strategies [J].
Hansen, N ;
Ostermeier, A .
EVOLUTIONARY COMPUTATION, 2001, 9 (02) :159-195