Simple Dynamic Particle Swarms without Velocity

摘要

The standard particle swarm optimiser uses update rules including both multiplicative randomness and velocity. In this paper, we look into a general particle swarm model that removes these two features, and study it mathematically. We derive the recursions and fixed points for the first four moments of the sampling distribution, and analyse the transient behaviour of the mean and the variance. Then we define actual instances of the algorithm by coupling the general update rule with specific recombination operators, and empirically test their optimisation efficiency.