Self-Organizing Hierarchical Particle Swarm Optimizer With Time-Varying Acceleration Coefficients
Authors:
- S.K. HalgamugeSHS.K. Halgamuge
- H.C. WatsonHWH.C. Watson
Top Cited Papers
- 14 June 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 8 (3) , 240-255
Abstract
This paper introduces a novel parameter automation strategy for the particle swarm algorithm and two further extensions to improve its performance after a predefined number of generations. Initially, to efficiently control the local search and convergence to the global optimum solution, time-varying acceleration coefficients (TVAC) are introduced in addition to the time-varying inertia weight factor in particle swarm optimization (PSO). From the basis of TVAC, two new strategies are discussed to improve the performance of the PSO. First, the concept of "mutation" is introduced to the particle swarm optimization along with TVAC (MPSO-TVAC), by adding a small perturbation to a randomly selected modulus of the velocity vector of a random particle by predefined probability. Second, we introduce a novel particle swarm concept "self-organizing hierarchical particle swarm optimizer with TVAC (HPSO-TVAC)". Under this method, only the "social" part and the "cognitive" part of the particle swarm strategy are considered to estimate the new velocity of each particle and particles are reinitialized whenever they are stagnated in the search space. In addition, to overcome the difficulties of selecting an appropriate mutation step size for different problems, a time-varying mutation step size was introduced. Further, for most of the benchmarks, mutation probability is found to be insensitive to the performance of MPSO-TVAC method. On the other hand, the effect of reinitialization velocity on the performance of HPSO-TVAC method is also observed. Time-varying reinitialization step size is found to be an efficient parameter optimization strategy for HPSO-TVAC method. The HPSO-TVAC strategy outperformed all the methods considered in this investigation for most of the functions. Furthermore, it has also been observed that both the MPSO and HPSO strategies perform poorly when the acceleration coefficients are fixed at two.Keywords
This publication has 34 references indexed in Scilit:
- Optimisation of valve timing events of internal combustion engines with particle swarm optimisation2004
- Particle swarm optimization with Gaussian mutation2004
- A discrete binary version of the particle swarm algorithm2002
- Tracking and optimizing dynamic systems with particle swarms2002
- A particle swarm optimization for reactive power and voltage control in electric power systems2002
- Comparing inertia weights and constriction factors in particle swarm optimization2002
- The particle swarm - explosion, stability, and convergence in a multidimensional complex spaceIEEE Transactions on Evolutionary Computation, 2002
- Use of intelligent-particle swarm optimization in electromagneticsIEEE Transactions on Magnetics, 2002
- NC end milling optimization using evolutionary computationInternational Journal of Machine Tools and Manufacture, 2002
- Particle swarm optimization: developments, applications and resources2001