New self-organising hierarchical PSO with jumping time-varying acceleration coefficients

Without doubt, one of the powerful and effective optimiser in the area of evolutionary algorithms and improved particle swarm optimisation (PSO) is the self-organising hierarchical PSO with time-varying acceleration coefficients (HPSO-TVAC) which has been implemented successfully in the many problems (cited by 2430 until now). Real-world problems are multi-variable problems with real-world different complexities. The classical HPSO-TVAC optimisation technique often converges to local optima solution for some of the real-world problems. Therefore, finding efficient modern versions of the PSO algorithm (here HPSO-TVAC) to solve the real-world problems are absorbing a growing attention in recent years. A novel HPSO-TVAC algorithm for real-world optimisation is proposed. The simulation results show that proposed HPSO-TVAC new version, NHPSO-JTVAC, is powerful and very competitive for real-world optimisation.

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

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

[3]  Qingfu Zhang,et al.  Differential Evolution With Composite Trial Vector Generation Strategies and Control Parameters , 2011, IEEE Transactions on Evolutionary Computation.

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

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

[6]  Yaochu Jin,et al.  A Competitive Swarm Optimizer for Large Scale Optimization , 2015, IEEE Transactions on Cybernetics.