Particle swarm optimizers with grow-and-reduce structure

This paper presents an improved version of PSO having grow-and-reduce structure. When a particle is trapped into a local optimum, a new particle is born at a position away from the trap and is connected to some/all of existing particles. If a particle can not escape from the trap, the particle is deleted in order to suppress excessive swarm grows. We have adopted three basic population topology: complete graph, ring and tree. Performing basic numerical experiments, the algorithm performance is investigated. The results suggest that the ldquogrow-and-reducerdquo is very effective for escape from a trap and the tree topology has effective flexibility to realize the optimization.

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

[2]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[3]  Tim M. Blackwell,et al.  The Lévy Particle Swarm , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[4]  Riccardo Poli,et al.  Evolving Problems to Learn About Particle Swarm Optimizers and Other Search Algorithms , 2006, IEEE Transactions on Evolutionary Computation.

[5]  Andries Petrus Engelbrecht,et al.  Determining RNA Secondary Structure using Set-based Particle Swarm Optimization , 2006, 2006 IEEE International Conference on Evolutionary Computation.

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

[7]  Frans van den Bergh,et al.  A NICHING PARTICLE SWARM OPTIMIZER , 2002 .

[8]  Toshimichi Saito,et al.  Expand-and-Reduce Algorithm of Particle Swarm Optimization , 2007, ICONIP.

[9]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization approaches to coevolve strategies for the iterated prisoner's dilemma , 2005, IEEE Transactions on Evolutionary Computation.

[10]  Xiaodong Li,et al.  This article has been accepted for inclusion in a future issue. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 Locating and Tracking Multiple Dynamic Optima by a Particle Swarm Model Using Speciation , 2022 .

[11]  Russell C. Eberhart,et al.  Multiobjective optimization using dynamic neighborhood particle swarm optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[12]  Guanrong Chen,et al.  Complex networks: small-world, scale-free and beyond , 2003 .

[13]  Zheng Fang,et al.  A Particle Swarm Optimized Particle Filter for Nonlinear System State Estimation , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[14]  Yuping Wang,et al.  An Evolutionary Algorithm for Global Optimization Based on Level-Set Evolution and Latin Squares , 2007, IEEE Transactions on Evolutionary Computation.

[15]  Toshio Fukuda,et al.  A PSO-based Mobile Sensor Network for Odor Source Localization in Dynamic Environment: Theory, Simulation and Measurement , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[16]  Tommy W. S. Chow,et al.  Self-Organizing and Self-Evolving Neurons: A New Neural Network for Optimization , 2007, IEEE Transactions on Neural Networks.

[17]  Saman K. Halgamuge,et al.  Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients , 2004, IEEE Transactions on Evolutionary Computation.