Dynamic multi-swarm differential learning particle swarm optimizer

被引:73
作者
Chen, Yonggang [1 ,2 ]
Li, Lixiang [3 ]
Peng, Haipeng [3 ]
Xiao, Jinghua [4 ]
Wu, Qingtao [2 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Sci, Beijing 100876, Peoples R China
[2] Henan Univ Sci & Technol, Informat Engn Coll, Luoyang 471023, Peoples R China
[3] Beijing Univ Posts & Telecommun, Informat Secur Ctr, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
[4] Beijing Univ Posts & Telecommun, Sch Sci, State Key Lab Informat Photon & Opt Commun, Beijing 100876, Peoples R China
基金
中国国家自然科学基金;
关键词
Swarm intelligence; Particle swarm optimization; Dynamic sub-swarms; Differential mutation; ADAPTIVE INERTIA WEIGHT; GLOBAL OPTIMIZATION; SEARCH ALGORITHM; LOCAL SEARCH; EVOLUTION;
D O I
10.1016/j.swevo.2017.10.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Because different optimization algorithms have different search behaviors and advantages, hybrid strategy is one of the main research directions to improve the performance of PSO. Inspired by this idea, a dynamic multi swarm differential learning particle swarm optimizer (DMSDL-PSO) is proposed in this paper. We propose a novel method to merge the differential evolution operator into each sub-swarm of the DMSDL-PSO. Combining the exploration capability of the differential mutation and employing Quasi-Newton method as a local searcher to enhance the exploitation capability, DMSDL-PSO has a good exploration and exploitation capability. According to the characteristics of the DMSDL-PSO, three modified differential mutation operators are discussed. Differential mutation is adopted for the personal historically best particle. Because the velocity updating equation of the particles in PSO has some shortcomings, a modified velocity updating equation is adopted in DMSDL-PSO. In DMSDL-PSO, in which the particles are divided into several small and dynamic sub-swarms. The dynamic change of sub-swarms can promote the information exchange of the whole swarm. In order to test the performance of DMSDL-PSO, 41 benchmark functions are adopted. Lots of numerical experiments are conducted to compare DMSDL-PSO with other popular algorithms. The numerical results demonstrate that DMSDL-PSO performs better on some benchmark functions.
引用
收藏
页码:209 / 221
页数:13
相关论文
共 58 条
[1]  
[Anonymous], 2010, IEEE C EV COMP CEC 1, DOI DOI 10.1109/CEC.2010.5586323
[2]  
Ben Niu, 2013, Advances in Swarm Intelligence. 4th International Conference, ICSI 2013. Proceedings, P72, DOI 10.1007/978-3-642-38703-6_8
[3]   A hybridization of an improved particle swarm optimization and gravitational search algorithm for multi-robot path planning [J].
Das, P. K. ;
Behera, H. S. ;
Panigrahi, B. K. .
SWARM AND EVOLUTIONARY COMPUTATION, 2016, 28 :14-28
[4]  
Das S., 2010, PROBLEM DEFINITIONS, V1, P341
[5]   Recent advances in differential evolution - An updated survey [J].
Das, Swagatam ;
Mullick, Sankha Subhra ;
Suganthan, P. N. .
SWARM AND EVOLUTIONARY COMPUTATION, 2016, 27 :1-30
[6]   Ant system: Optimization by a colony of cooperating agents [J].
Dorigo, M ;
Maniezzo, V ;
Colorni, A .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41
[7]   Pigeon-inspired optimization: a news warm intelligence optimizer for air robot path planning [J].
Duan, Haibin ;
Qiao, Peixin .
INTERNATIONAL JOURNAL OF INTELLIGENT COMPUTING AND CYBERNETICS, 2014, 7 (01) :24-37
[8]  
Eberhart R., 1995, MHS95 P 6 INT S MICR, DOI [DOI 10.1109/MHS.1995.494215, 10.1109/MHS.1995.494215]
[9]   A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization [J].
El Dor, Abbas ;
Clerc, Maurice ;
Siarry, Patrick .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2012, 53 (01) :271-295
[10]   Interior search algorithm (ISA): A novel approach for global optimization [J].
Gandomi, Amir H. .
ISA TRANSACTIONS, 2014, 53 (04) :1168-1183