Cyber Swarm Algorithms - Improving particle swarm optimization using adaptive memory strategies

摘要

Particle swarm optimization (PSO) has emerged as an acclaimed approach for solving complex optimization problems. The nature metaphors of flocking birds or schooling fish that originally motivated PSO have made the algorithm easy to describe but have also occluded the view of valuable strategies based on other foundations. From a complementary perspective, scatter search (SS) and path relinking (PR) provide an optimization framework based on the assumption that useful information about the global solution is typically contained in solutions that lie on paths from good solutions to other good solutions. Shared and contrasting principles underlying the PSO and the SS/PR methods provide a fertile basis for combining them. Drawing especially on the adaptive memory and responsive strategy elements of SS and PR, we create a combination to produce a Cyber Swarm Algorithm that proves more effective than the Standard PSO 2007 recently established as a leading form of PSO. Applied to the challenge of finding global minima for continuous nonlinear functions, the Cyber Swarm Algorithm not only is able to obtain better solutions to a well known set of benchmark functions, but also proves more robust under a wide range of experimental conditions.