An empirical comparison of parallel and distributed particle swarm optimization methods

The goal of this paper is to present four new parallel and distributed particle swarm optimization methods. and to experimentally compare their performances. These methods include a genetic algorithm whose individuals are co-evolving swarms, a different multi-swarm system and their respective variants enriched by adding a repulsive component to the particles. We have tried to carry out this comparison using the benchmark test suite that has been defined for the CEC-2005 numerical optimization competition and we have remarked that it is hard to have a clear picture of the experimental results on that benchmark suite. We believe that this is due to the fact that the CEC-2005 benchmark suite is only composed by either very easy or very hard test functions. For this reason, we introduce two new sets of test functions whose difficulty can be tuned by simply modifying the values of few real-valued parameters. We propose to integrate the CEC-2005 benchmark suite by adding these sets of test functions to it. Experimental results on these two sets of test functions clearly show that the proposed repulsive multi-swarm system outperforms all the other presented methods.

[1]  Jing J. Liang,et al.  Dynamic multi-swarm particle swarm optimizer with local search , 2005, 2005 IEEE Congress on Evolutionary Computation.

[2]  Changhe Li,et al.  Fast Multi-Swarm Optimization for Dynamic Optimization Problems , 2008, 2008 Fourth International Conference on Natural Computation.

[3]  Riccardo Poli,et al.  Analysis of the publications on the applications of particle swarm optimisation , 2008 .

[4]  Mihai Oltean,et al.  Evolving the Structure of the Particle Swarm Optimization Algorithms , 2006, EvoCOP.

[5]  Q. Henry Wu,et al.  MCPSO: A multi-swarm cooperative particle swarm optimizer , 2007, Appl. Math. Comput..

[6]  Roger Sauter,et al.  Introduction to Probability and Statistics for Engineers and Scientists , 2005, Technometrics.

[7]  Jacques Riget,et al.  A Diversity-Guided Particle Swarm Optimizer - the ARPSO , 2002 .

[8]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

[9]  Jian Li,et al.  Solving constrained optimization via a modified genetic particle swarm optimization , 2008, e-Forensics '08.

[10]  Tony White,et al.  Towards multi-swarm problem solving in networks , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[11]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[12]  Yi Jiang,et al.  Applying Multi-Swarm Accelerating Particle Swarm Optimization to Dynamic Continuous Functions , 2009, 2009 Second International Workshop on Knowledge Discovery and Data Mining.

[13]  Liu Zhiming,et al.  Solving Constrained Optimization via a Modified Genetic Particle Swarm Optimization , 2008, First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008).

[14]  Leonardo Vanneschi,et al.  Theory and practice for efficient genetic programming , 2004 .

[15]  Tim Jones.  Evolutionary Algorithms, Fitness Landscapes and Search , 1995 .

[16]  Leonardo Vanneschi,et al.  An Empirical Study of Multipopulation Genetic Programming , 2003, Genetic Programming and Evolvable Machines.

[17]  Min Huang,et al.  Multi-swarm particle swarm optimization based risk management model for virtual enterprise , 2009, GEC '09.

[18]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[19]  Jürgen Branke,et al.  Multi-swarm Optimization in Dynamic Environments , 2004, EvoWorkshops.

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