Hierarchical Competition Framework for Particle Swarm Optimization

Particles in PSO algorithms evolve only in one group, or in many groups but without interaction between different groups. Inspired by the concept of social class evolution process, a hierarchical competition framework is proposed in this paper. Through the competition mechanism, particles can flow dynamically between different levels, and this can reduce the probability of top-level particles leading to a wrong direction and in this way enhance the global search ability. In this paper, the proposed framework is tested in combination with the canonical PSO and one of the most famous variant particle warm optimizers, named quantum-behaved particle swarm optimizer. All the experiments are run on the CEC’2013 benchmark function database, and the results show that the global search ability and the convergence speed are both improved compared to the basic optimizers.

[1]  Sidney D. Drell,et al.  Relativistic Quantum Mechanics , 1965 .

[2]  Agostinho C. Rosa,et al.  A study on time-varying partially connected topologies for the particle swarm , 2013, 2013 IEEE Congress on Evolutionary Computation.

[3]  M. Clerc.  Stagnation Analysis in Particle Swarm Optimisation or What Happens When Nothing Happens , 2006 .

[4]  Xiaodong Li,et al.  Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology , 2010, IEEE Transactions on Evolutionary Computation.

[5]  Teresa Bernarda Ludermir,et al.  Effect of the PSO Topologies on the Performance of the PSO-ELM , 2012, 2012 Brazilian Symposium on Neural Networks.

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

[7]  Swagatam Das,et al.  Particle swarm optimization with a modified learning strategy and blending crossover , 2017, 2017 IEEE Symposium Series on Computational Intelligence (SSCI).

[8]  Mark Richards,et al.  Choosing a starting configuration for particle swarm optimization , 2004, 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541).

[9]  Leandro dos Santos Coelho,et al.  Fuzzy Identification Based on a Chaotic Particle Swarm Optimization Approach Applied to a Nonlinear Yo-yo Motion System , 2007, IEEE Transactions on Industrial Electronics.

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

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

[12]  Kit Yan Chan,et al.  Improved Hybrid Particle Swarm Optimized Wavelet Neural Network for Modeling the Development of Fluid Dispensing for Electronic Packaging , 2008, IEEE Transactions on Industrial Electronics.

[13]  Jun Sun,et al.  A global search strategy of quantum-behaved particle swarm optimization , 2004, IEEE Conference on Cybernetics and Intelligent Systems, 2004..

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

[15]  Salman Mohagheghi,et al.  Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems , 2008, IEEE Transactions on Evolutionary Computation.

[16]  Riccardo Poli,et al.  Evolving problems to learn about particle swarm and other optimisers , 2005, 2005 IEEE Congress on Evolutionary Computation.