Heterogeneous comprehensive learning particle swarm optimization with enhanced exploration and exploitation

被引:408
作者
Lynn, Nandar [1 ]
Suganthan, Pormuthurai Nagaratnam [1 ]
机构
[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
关键词
Comprehensive learning (CL); Exploration; Exploitation; Particle swarm optimization (PSO); Heterogeneous; CONVERGENCE;
D O I
10.1016/j.swevo.2015.05.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper presents a comprehensive learning particle swarm optimization algorithm with enhanced exploration and exploitation, named as "heterogeneous comprehensive learning particle swarm optimization" (HCLPSO). In this algorithm, the swarm population is divided into two subpopulations. Each subpopulation is assigned to focus solely on either exploration or exploitation. Comprehensive learning (CL) strategy is used to generate the exemplars for both subpopulations. In the exploration-subpopulation, the exemplars are generated by using personal best experiences of the particles in the exploration-subpopulation itself. In the exploitation-subpopulation, the personal best experiences of the entire swarm population are used to generate the exemplars. As the exploration-subpopulation does not learn from any particles in the exploitation-subpopulation, the diversity in the exploration-subpopulation can be retained even if the exploitation-subpopulation converges prematurely. The heterogeneous comprehensive learning particle swarm optimization algorithm is tested on shifted and rotated benchmark problems and compared with other recent particle swarm optimization algorithms to demonstrate superior performance of the proposed algorithm over other particle swarm optimization variants. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:11 / 24
页数:14
相关论文
共 39 条
[1]  
[Anonymous], 2010, STAT TXB MONOGRAPHS
[2]  
Bartz-Beielstein T., 2006, EXPT RES EVOLUTIONAR
[3]  
Blackwell T. M., 2002, P 4 ANN C GEN EV COM, P19
[4]   Multiswarms, exclusion, and anti-convergence in dynamic environments [J].
Blackwell, Tim ;
Branke, Juergen .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (04) :459-472
[5]  
Brits R., 2002, P 4 AS PAC C SIM EV, V2, P692
[6]   A Competitive Swarm Optimizer for Large Scale Optimization [J].
Cheng, Ran ;
Jin, Yaochu .
IEEE TRANSACTIONS ON CYBERNETICS, 2015, 45 (02) :191-204
[7]   The particle swarm - Explosion, stability, and convergence in a multidimensional complex space [J].
Clerc, M ;
Kennedy, J .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) :58-73
[8]   Exploration and Exploitation in Evolutionary Algorithms: A Survey [J].
Crepinsek, Matej ;
Liu, Shih-Hsi ;
Mernik, Marjan .
ACM COMPUTING SURVEYS, 2013, 45 (03)
[9]   Heterogeneous Particle Swarm Optimizers [J].
de Oca, Marco A. Montes ;
Pena, Jorge ;
Stuetzle, Thomas ;
Pinciroli, Carlo ;
Dorigo, Marco .
2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, :698-+
[10]   A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms [J].
Derrac, Joaquin ;
Garcia, Salvador ;
Molina, Daniel ;
Herrera, Francisco .
SWARM AND EVOLUTIONARY COMPUTATION, 2011, 1 (01) :3-18