Dynamic particle swarm optimization via ring topologies

Particle Swarm Optimization (PSO) has been proven to be a fast and effective search algorithm capable of solving complex and varied problems. To date numerous swarm topologies have been proposed and investigated as a means of increasing the effectiveness of the generalized algorithm. Typical topologies employ static arrangements of particles defined at the beginning of execution and remaining constant throughout run-time. Topologies that do allow for restructuring, often do so according to predefined rules that limit the opportunity and manner in which the topology can change. Recent investigations have shown that dynamically redefining a topology by stochastically re-organizing the swarm at periodic intervals improves performance for certain types of problems. In this work the effectiveness of a novel topology "Dynamic Ring" and a derivative of the {}"Dynamic Multi Swarm PSO" topology dubbed "Dynamic Multi Swarm with Ring" are investigated. We show that these two new topologies show generally enhanced performance relative to previously proposed topologies on a suite of twelve test functions.