ABSTRACT
Particle Swarm Optimization (PSO) has been proven to be a fast and effective search algorithm capable of solving complex and varied problems. To date numerous swarm topologies have been proposed and investigated as a means of increasing the effectiveness of the generalized algorithm. Typical topologies employ static arrangements of particles defined at the beginning of execution and remaining constant throughout run-time. Topologies that do allow for restructuring, often do so according to predefined rules that limit the opportunity and manner in which the topology can change. Recent investigations have shown that dynamically redefining a topology by stochastically re-organizing the swarm at periodic intervals improves performance for certain types of problems. In this work the effectiveness of a novel topology "Dynamic Ring" and a derivative of the {}"Dynamic Multi Swarm PSO" topology dubbed "Dynamic Multi Swarm with Ring" are investigated. We show that these two new topologies show generally enhanced performance relative to previously proposed topologies on a suite of twelve test functions.
- J. Kennedy, and R. Eberhart, Particle swarm optimization, in Proc. of the IEEE Int. Conf. on Neural Networks, Piscataway, NJ pp. 1942--1948, 1995Google ScholarCross Ref
- J. Kennedy, R. Mendes, Population structure and particle swarm performance. In Proceedings of the 2002 Congress on Evolutionary Computation, 2002. CEC '02. Volume: 2, page(s): 1671--1676 Google ScholarDigital Library
- J.J. Liang, P.N. Suganthan: Dynamic Multi-Swarm Particle Swarm Optimizer. Swarm Intelligence Symposium, 2005. Proceedings 2005 IEEE. pp. 124--129Google Scholar
- J.J. Liang, P.N. Suganthan: Dynamic Multi-Swarm Particle Swarm Optimizer with Local Search. The 2005 IEEE Congress on Evolutionary Computation, 2005, Volume: 1, pp: 522--528Google Scholar
Index Terms
- Dynamic particle swarm optimization via ring topologies
Recommendations
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 ...
An improved cooperative quantum-behaved particle swarm optimization
Particle swarm optimization (PSO) is a population-based stochastic optimization. Its parameters are easy to control, and it operates easily. But, the particle swarm optimization is a local convergence algorithm. Quantum-behaved particle swarm ...
An enhanced particle swarm optimization with levy flight for global optimization
Enhanced PSO with levy flight.Random walk of the particles.High convergence rate.Provides solution accuracy and robust. Hüseyin Haklı and Harun Uguz (2014) proposed a novel approach for global function optimization using particle swarm optimization with ...
Comments