Dynamic multi-swarm particle swarm optimizer with sub-regional harmony search

In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) and a sub-regional harmony search (SHS) are hybridized to obtain DMS-PSO-SHS. A Modified multi-trajectory search (MTS) algorithm is also applied frequently on several selected solutions. Effective diversity maintaining properties of the dynamic multiple swarms in the DMS-PSO without crossover operation and strong exploitative properties of the HS with multi-parent crossover operation strengthen the overall search behavior of the proposed DMS-PSO-SHS. The whole PSO population is divided into a large number sub-swarms which is also the individual HS population. These sub-swarms are regrouped frequently by using various regrouping schedules and information is exchanged among the particles in the whole swarm. Therefore, different from the existing multi-swarm PSOs or local versions of PSO, our sub-swarms are dynamic and its size is small which is also appropriate to be the population of the harmony search. In addition, an external memory of selected past solutions is used to enhance the diversity of the swarm. The DMS-PSO-SHS is employed to solve the 20 numerical optimization problems for the CEC'2010 Special Session and Competition on Large Scale Global Optimization and competitive results are presented.

[1]  Jing J. Liang,et al.  A self-adaptive global best harmony search algorithm for continuous optimization problems , 2010, Appl. Math. Comput..

[2]  Mahamed G. H. Omran,et al.  Global-best harmony search , 2008, Appl. Math. Comput..

[3]  K. Lee,et al.  A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice , 2005 .

[4]  Roger Fletcher,et al.  A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[5]  James Kennedy,et al.  Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[6]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[7]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

[8]  Quan-Ke Pan,et al.  A local-best harmony search algorithm with dynamic subpopulations , 2010 .

[9]  Alain Pétrowski,et al.  A clearing procedure as a niching method for genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[10]  Andries Petrus Engelbrecht,et al.  A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[11]  Ponnuthurai N. Suganthan,et al.  Diversity enhanced particle swarm optimizer for global optimization of multimodal problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

[12]  William C. Davidon,et al.  Variable Metric Method for Minimization , 1959, SIAM J. Optim..

[13]  Mehmet Fatih Tasgetiren,et al.  A Harmony Search Algorithm with Ensemble of Parameter Sets , 2009, 2009 IEEE Congress on Evolutionary Computation.

[14]  K. Lee,et al.  A new metaheuristic algorithm for continuous engineering optimization : harmony search theory and practice , 2005 .

[15]  Jing J. Liang,et al.  Dynamic multi-swarm particle swarm optimizer with local search for Large Scale Global Optimization , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[16]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[17]  Chun Chen,et al.  Multiple trajectory search for Large Scale Global Optimization , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[18]  Bijaya K. Panigrahi,et al.  Exploratory Power of the Harmony Search Algorithm: Analysis and Improvements for Global Numerical Optimization , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[19]  Rainer Laur,et al.  Stopping Criteria for a Constrained Single-Objective Particle Swarm Optimization Algorithm , 2007, Informatica.

[20]  Z. Geem.  Particle-swarm harmony search for water network design , 2009 .

[21]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[22]  Xiaodong Li,et al.  Benchmark Functions for the CEC'2010 Special Session and Competition on Large-Scale , 2009 .

[23]  Jing J. Liang,et al.  Dynamic multi-swarm particle swarm optimizer , 2005, Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005..

[24]  C. G. Broyden.  The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations , 1970 .