Dynamic cluster in particle swarm optimization algorithm

Particle swarm optimization is an optimization method based on a simulated social behavior displayed by artificial particles in a swarm, inspired from bird flocks and fish schools. An underlying component that influences the exchange of information between particles in a swarm, is its topological structure. Therefore, this property has a great influence on the comportment of the optimization method. In this study, we propose DCluster: a dynamic topology, based on a combination of two well-known topologies viz. Four-cluster and Fitness. The proposed topology is analyzed, and compared to six other topologies used in the standard PSO algorithm using a set of benchmark test functions and several well-known constrained and unconstrained engineering design problems. Our comparisons demonstrate that DCluster outperforms the other tested topologies and leads to satisfactory performance while avoiding the problem of premature convergence.

[1]  Mahamod Ismail,et al.  Particle swarm optimization for mobile network design , 2009, IEICE Electron. Express.

[2]  R. Salomon Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms. , 1996, Bio Systems.

[3]  J. Kennedy Stereotyping: improving particle swarm performance with cluster analysis , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

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

[5]  S. N. Kramer,et al.  An Augmented Lagrange Multiplier Based Method for Mixed Integer Discrete Continuous Optimization and Its Applications to Mechanical Design , 1994 .

[6]  Yong Wang,et al.  Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization , 2010, Appl. Soft Comput..

[7]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[8]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..

[9]  K. M. Ragsdell,et al.  Optimal Design of a Class of Welded Structures Using Geometric Programming , 1976 .

[10]  J. Golinski,et al.  An adaptive optimization system applied to machine synthesis , 1973 .

[11]  P. N. Suganthan,et al.  A dynamic neighborhood learning based particle swarm optimizer for global numerical optimization , 2012, Inf. Sci..

[12]  José Neves,et al.  Watch thy neighbor or how the swarm can learn from its environment , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[13]  Yu-Xuan Wang,et al.  Exploring new learning strategies in Differential Evolution algorithm , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[14]  Mehmet Fatih Tasgetiren,et al.  Dynamic multi-swarm particle swarm optimizer with harmony search , 2011, Expert Syst. Appl..

[15]  Yu-Xuan Wang,et al.  Particle Swarms with dynamic ring topology , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[16]  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).

[17]  Shang-Jeng Tsai,et al.  Efficient Population Utilization Strategy for Particle Swarm Optimizer , 2009, IEEE Trans. Syst. Man Cybern. Part B.

[18]  Péricles B. C. de Miranda,et al.  Multi-ring Particle Swarm Optimization , 2008, 2008 10th Brazilian Symposium on Neural Networks.

[19]  Martin Middendorf,et al.  A hierarchical particle swarm optimizer and its adaptive variant , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[20]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[21]  Ali Mohades,et al.  Particle swarm optimization with voronoi neighborhood , 2009, 2009 14th International CSI Computer Conference.

[22]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[23]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization with spatially meaningful neighbours , 2008, 2008 IEEE Swarm Intelligence Symposium.

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

[25]  Millie Pant,et al.  Two modified differential evolution algorithms and their applications to engineering design problems , 2009 .

[26]  Carlos A. Coello Coello,et al.  Solving Engineering Optimization Problems with the Simple Constrained Particle Swarm Optimizer , 2008, Informatica.

[27]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[28]  Jing J. Liang,et al.  Dynamic Multi-Swarm Particle Swarm Optimizer with a Novel Constraint-Handling Mechanism , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[29]  Changhe Li,et al.  A Self-Learning Particle Swarm Optimizer for Global Optimization Problems , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[30]  Dan Ventura,et al.  Dynamic Sociometry in Particle Swarm Optimization , 2003 .

[31]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[32]  M. Clerc,et al.  Particle Swarm Optimization , 2006 .

[33]  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.

[34]  Patrick Siarry,et al.  A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization , 2012, Comput. Optim. Appl..

[35]  José Neves,et al.  The fully informed particle swarm: simpler, maybe better , 2004, IEEE Transactions on Evolutionary Computation.