THE PARTICLE SWARM AS COLLABORATIVE SAMPLING OF THE SEARCH SPACE
James C. Kennedy · Advances in Complex Systems · 2007
The particle swarm algorithm uses principles derived from social psychology to find optimal points in a search space. The present paper decomposes and reinterprets the particle swarm in order to discover new ways of implementing the algorithm. Some essential characteristics of the method are illuminated, and some inessential features are discarded. Various new forms are tested and found to perform well on a suite of test functions. In particular, it is shown that the traditional trajectory formulas can be replaced with random number generators sampling from various symmetrical probability distributions. The excellent performance of these new versions demonstrates that the strength of the algorithm is in the interactions of the particles, rather than in their behavior as individuals.