A novel coevolutionary multi-objective particle swarm optimization based on decomposition

被引:0
作者
Zhu, Sifeng [1 ]
Yang, Chengrui [1 ]
Hu, Jiaming [1 ]
Chen, Hao [1 ]
Zhang, Hui [1 ]
机构
[1] Tianjin Chengjian Univ, Sch Comp & Informat Engn, Tianjin 300384, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-objective particle swarm optimization; Coevolutionary mechanism; Best-effort strategy; Weighted maximum approach; EVOLUTIONARY ALGORITHMS;
D O I
10.1007/s12065-022-00797-w
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To improve the performance of particle swarm optimization (PSO) and balance convergence and diversity, we propose a coevolutionary multi-objective particle swarm optimization based on decomposition (CMOPSO). CMOPSO includes 3 strategies, coevolutionary mechanism, best-effort strategy and weighted maximum approach. Coevolutionary mechanism is used to maintain convergence, while PSO operator focuses on diversity. Best-effort strategy allows operators that perform well enough to execute again, which improves the utilization of computing resources. Weighted maximum approach is an environmental selection strategy based on decomposition, which selects by comparing the maximum of weighted objective values of the subproblem. Each new individual will be compared with the best individual of all subproblems, not only in the sub domain, which helps the PSO operator to maintain the diversity in search process. The CMOPSOD is tested against 6 other algorithms on the ZDT and UF test problems, the results show that the proposed CMOPSOD has significant advantages in terms of convergence and diversity.
引用
收藏
页码:643 / 652
页数:10
相关论文
共 22 条
[1]  
Coello CAC, 2002, IEEE C EVOL COMPUTAT, P1051, DOI 10.1109/CEC.2002.1004388
[2]  
Davis L., 1985, P 9 INT JOINT C ART, P162
[3]  
Deb K., 1996, Comput. Sci. Inf., V26, P30, DOI DOI 10.1007/978-3-662-03423-127
[4]  
Deb K, 2007, GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, P1187
[5]   AN EVOLUTIONARY APPROACH TO THE TRAVELING SALESMAN PROBLEM [J].
FOGEL, DB .
BIOLOGICAL CYBERNETICS, 1988, 60 (02) :139-144
[6]   PSO-based multiobjective optimization with dynamic population size and adaptive local archives [J].
Leong, Wen-Fung ;
Yen, Gary G. .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2008, 38 (05) :1270-1293
[7]   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
[8]   A novel multi-objective particle swarm optimization with multiple search strategies [J].
Lin, Qiuzhen ;
Li, Jianqiang ;
Du, Zhihua ;
Chen, Jianyong ;
Ming, Zhong .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 247 (03) :732-744
[9]  
Nebro AJ, 2009, MCDM: 2009 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN MULTI-CRITERIA DECISION-MAKING, P66
[10]   Collaborative and Adaptive Strategies of Different Scalarizing Functions in MOEA/D [J].
Pescador-Rojas, Miriam ;
Coello Coello, Carlos A. .
2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, :709-716