An IGD+ Performance Indicator Based Particle Swarm Optimizer For Multi-objective Optimization

被引:2
作者
Li, Fei [1 ,2 ,3 ]
Dung, Shijian [4 ]
Liu, Yuanqu [5 ]
Shang, Zhengkun [1 ,2 ]
机构
[1] Anhui Univ Technol, Sch Elect & Informat Engn, Maanshan 243002, Peoples R China
[2] Anhui Univ Technol, AnHui Prov Key Lab Special Heavy Load Robot, Maanshan 243002, Peoples R China
[3] Maanshan Univ, Maanshan 243100, Peoples R China
[4] China Univ Min & Technol, Sch Informat & Control Engn, Xuzhou 221116, Jiangsu, Peoples R China
[5] North China Elect Power Univ, Dept Automat, Baoding 071003, Peoples R China
来源
PROCEEDINGS OF THE 33RD CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2021) | 2021年
基金
中国国家自然科学基金;
关键词
IGD(+) indicator; Particle swarm optimization; The external archive updated strategy; Objective space decomposition; Multi-objective optimization problems;
D O I
10.1109/CCDC52312.2021.9601927
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Particle swarm optimizer (PSO) is suitable for solving multi-objective optimization problems (MOPs). However, there are two main issues for any multi-objective particle swarm optimizers (MOPSOs). The first issue is how to balance the convergence and diversity. The second issue is how to enhance the exploitation and exploration during the evolutionary procedure. In order to address these issues, an modified inverted generational distance (IGD(+)) performance indicator based PSO (IGD(+)-MOPSO) is proposed. The external archive updating strategies based on the IGD(+) indicator and the objective space decomposition method are proposed to select the evenly distributed non-dominated solutions. The leader updated strategy of each particle is based on the IGD(+) indicator value which is associated to the corresponding reference vector. The genetic operator is embedded into the evolutionary procedure to reset the position in order to help the particle jump out of the local optimum. We have conducted the simulation on some related benchmark test instances. The experimental results have indicated that the proposed algorithm is competitive with some related algorithms.
引用
收藏
页码:3633 / 3638
页数:6
相关论文
共 27 条
[1]   D2MOPSO: MOPSO Based on Decomposition and Dominance with Archiving Using Crowding Distance in Objective and Solution Spaces [J].
Al Moubayed, N. ;
Petrovski, A. ;
McCall, J. .
EVOLUTIONARY COMPUTATION, 2014, 22 (01) :47-77
[2]  
[Anonymous], 2007, MULTIOBJECTIVE EVOLU
[3]   R2 Indicator-Based Multiobjective Search [J].
Brockhoff, Dimo ;
Wagner, Tobias ;
Trautmann, Heike .
EVOLUTIONARY COMPUTATION, 2015, 23 (03) :369-395
[4]  
[柴天佑 CHAI Tian-You], 2009, [自动化学报, Acta Automatica Sinica], V35, P641
[5]  
García IC, 2014, 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P266, DOI 10.1109/CEC.2014.6900540
[6]   Handling multiple objectives with particle swarm optimization [J].
Coello, CAC ;
Pulido, GT ;
Lechuga, MS .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (03) :256-279
[7]  
Coello CAC, 2002, IEEE C EVOL COMPUTAT, P1051, DOI 10.1109/CEC.2002.1004388
[8]  
Dai C, 2015, NEW MULTIOBJECTIVE P
[9]   Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems [J].
Das, I ;
Dennis, JE .
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) :631-657
[10]   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