Dynamic-probabilistic particle swarms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Particle Swarm Optimization with Discrete Recombination: An Online Optimizer for Evolvable Hardware
AHS '06 Proceedings of the first NASA/ESA conference on Adaptive Hardware and Systems
Fundamentals of Computational Swarm Intelligence
Fundamentals of Computational Swarm Intelligence
Understanding particle swarms through simplification: a study of recombinant PSO
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Journal of Artificial Evolution and Applications - Particle Swarms: The Second Decade
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
The tail of the particle swarm optimisation (PSO) position distribution at stagnation is shown to be describable by a power law. This tail fattening is attributed to particle bursting on all length scales. The origin of the power law is concluded to lie in multiplicative randomness, previously encountered in the study of first-order stochastic difference equations, and generalised here to second-order equations. It is argued that recombinant PSO, a competitive PSO variant without multiplicative randomness, does not experience tail fattening at stagnation.