On the scalability of particle swarm optimisation
- 1 June 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 2505-2512
Abstract
Particle swarm has proven to be competitive to other evolutionary algorithms in the field of optimization, and in many cases enables a faster convergence to the ideal solution. However, like any optimization algorithm it seems to have difficulties handling optimization problems of high dimension. Here we first show that dimensionality is really a problem for the classical particle swarm algorithms. We then show that increasing the swarm size can be necessary to handle problem of high dimensions but is not enough. We also show that the issue of scalability occurs more quickly on some functions.Keywords
This publication has 7 references indexed in Scilit:
- Toward routine billion‐variable optimization using genetic algorithmsComplexity, 2007
- A Novel Micro-Particle Swarm Optimizer for Solving High Dimensional Optimization Problems2006
- A hierarchical particle swarm optimizer and its adaptive variantIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2005
- The Fully Informed Particle Swarm: Simpler, Maybe BetterIEEE Transactions on Evolutionary Computation, 2004
- An Empirical Comparison of Particle Swarm and Predator Prey Optimisation2002
- The particle swarm - explosion, stability, and convergence in a multidimensional complex spaceIEEE Transactions on Evolutionary Computation, 2002
- Population structure and particle swarm performance2002