Evolving cognitive and social experience in Particle Swarm Optimization through Differential Evolution: A hybrid approach

被引:115
作者
Epitropakis, M. G. [1 ]
Plagianakos, V. P. [1 ,2 ]
Vrahatis, M. N. [1 ]
机构
[1] Univ Patras, Dept Math, Computat Intelligence Lab CI Lab, GR-26110 Patras, Greece
[2] Univ Cent Greece, Dept Comp Sci & Biomed Informat, GR-35100 Lamia, Greece
关键词
Global Optimization; Particle Swarm Optimization; Differential Evolution; Hybrid approach; Social and cognitive experience; Swarm intelligence; GLOBAL OPTIMIZATION; INTELLIGENCE; ADAPTATION; CONVERGENCE; SCALABILITY; PERFORMANCE; COMPUTATION; ALGORITHMS; SEARCH; DESIGN;
D O I
10.1016/j.ins.2012.05.017
中图分类号
TP [自动化技术、计算机技术];
学科分类号
080201 [机械制造及其自动化];
摘要
In recent years, the Particle Swarm Optimization has rapidly gained increasing popularity and many variants and hybrid approaches have been proposed to improve it. In this paper, motivated by the behavior and the spatial characteristics of the social and cognitive experience of each particle in the swarm, we develop a hybrid framework that combines the Particle Swarm Optimization and the Differential Evolution algorithm. Particle Swarm Optimization has the tendency to distribute the best personal positions of the swarm particles near to the vicinity of problem's optima. In an attempt to efficiently guide the evolution and enhance the convergence, we evolve the personal experience or memory of the particles with the Differential Evolution algorithm, without destroying the search capabilities of the algorithm. The proposed framework can be applied to any Particle Swarm Optimization algorithm with minimal effort. To evaluate the performance and highlight the different aspects of the proposed framework, we initially incorporate six classic Differential Evolution mutation strategies in the canonical Particle Swarm Optimization, while afterwards we employ five state-of-the-art Particle Swarm Optimization variants and four popular Differential Evolution algorithms. Extensive experimental results on 25 high dimensional multimodal benchmark functions along with the corresponding statistical analysis, suggest that the hybrid variants are very promising and significantly improve the original algorithms in the majority of the studied cases. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:50 / 92
页数:43
相关论文
共 112 条
[1]
Angeline P. J., 1998, Evolutionary Programming VII. 7th International Conference, EP98. Proceedings, P601, DOI 10.1007/BFb0040811
[2]
[Anonymous], 2005, NAT COMPUT
[3]
[Anonymous], 2011, TECHNICAL REPORT
[4]
[Anonymous], 2002, Computational Intelligence an Introduction
[5]
[Anonymous], 1988, Algorithms for Clustering Data
[6]
Multiswarms, exclusion, and anti-convergence in dynamic environments [J].
Blackwell, Tim ;
Branke, Juergen .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (04) :459-472
[7]
Blackwell TM, 2002, IEEE C EVOL COMPUTAT, P1462, DOI 10.1109/CEC.2002.1004458
[8]
Defining a standard for particle swarm optimization [J].
Bratton, Daniel ;
Kennedy, James .
2007 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2007, :120-+
[9]
Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems [J].
Brest, Janez ;
Greiner, Saso ;
Boskovic, Borko ;
Mernik, Marjan ;
Zumer, Vijern .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (06) :646-657
[10]
Chakraborty UK, 2008, STUD COMPUT INTELL, V143, P1, DOI 10.1007/978-3-540-68830-3