Bare bones particle swarms with jumps

Authors:
Mohammad Majid Al-Rifaie;Tim Blackwell
Affiliations:
Goldsmiths, University of London, London, UK;Goldsmiths, University of London, London, UK
Venue:
ANTS'12 Proceedings of the 8th international conference on Swarm Intelligence
Year:
2012

Citing 6
Cited 0

Lipschitzian optimization without the Lipschitz constant

Journal of Optimization Theory and Applications
The particle swarm optimization algorithm: convergence analysis and parameter selection

Information Processing Letters
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.
Fundamentals of Computational Swarm Intelligence

Fundamentals of Computational Swarm Intelligence
A study of particle swarm optimization particle trajectories

Information Sciences: an International Journal
The particle swarm - explosion, stability, and convergence in amultidimensional complex space

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bare Bones PSO was proposed by Kennedy as a model of PSO dynamics. Dependence on velocity is replaced by sampling from a Gaussian distribution. Although Kennedy's original formulation is not competitive to standard PSO, the addition of a component-wise jumping mechanism, and a tuning of the standard deviation, can produce a comparable optimisation algorithm. This algorithm, Bare Bones with Jumps, exists in a variety of formulations. Two particular models are empirically examined in this paper and comparisons are made to canonical PSO and standard Bare Bones.