Clubs-based Particle Swarm Optimization
- 1 April 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2723, 289-296
Abstract
This paper introduces a new dynamic neighborhood network for particle swarm optimization. In the proposed clubs-based particle swarm optimization (C-PSO) algorithm, each particle initially joins a default number of what we call 'clubs'. Each particle is affected by its own experience and the experience of the best performing member of the clubs it is a member of. Clubs membership is dynamic, where the worst performing particles socialize more by joining more clubs to learn from other particles and the best performing particles are made to socialize less by leaving clubs to reduce their strong influence on other members. Particles return gradually to default membership level when they stop showing extreme performance. Inertia weights of swarm members are made random within a predefined range. This proposed dynamic neighborhood algorithm is compared with other two algorithms having static neighborhood topologies on a set of classic benchmark problems. The results showed superior performance for C-PSO regarding escaping local optima and convergence speedKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- A hierarchical particle swarm optimizer and its adaptive variantIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2005
- Particle Swarms2005
- Optimization Using Particle Swarms with Near Neighbor Interactions2003
- The particle swarm optimization algorithm: convergence analysis and parameter selectionInformation Processing Letters, 2003
- Particle swarm optimiser with neighbourhood operator2003
- Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance2003
- The immune system, adaptation, and machine learningPhysica D: Nonlinear Phenomena, 1986
- Optimization by Simulated AnnealingScience, 1983