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
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
Understanding particle swarms through simplification: a study of recombinant PSO
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Journal of Artificial Evolution and Applications - Particle Swarms: The Second Decade
Proceedings of the 10th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
The phenomenon of particle bursts, a well-known feature of PSO is investigated. Their origin is concluded to lie in multiplicative stochasticity, previously encountered in the study of first order stochastic difference equations. The work here demonstrates that bursts contribute to fattening of the tail of the particle position distribution and that these tails are well described by power laws. It is argued that recombinant PSO, a competitive PSO variant without multiplicative randomness, is burst-free.