particle swarm optimization, topology, communication
Particle Swarm Optimization (PSO) has typically been used with small swarms of about 50 particles. However, PSO is more efficiently parallelized with large swarms. We formally describe existing topologies and identify variations which are better suited to large swarms in both sequential and parallel computing environments. We examine the performance of PSO for benchmark functions with respect to swarm size and topology. We develop and demonstrate a new PSO variant which leverages the unique strengths of large swarms. “Hearsay PSO” allows for information to flow quickly through the swarm, even with very loosely connected topologies. These loosely connected topologies are well suited to large scale parallel computing environments because they require very little communication between particles. We consider the case where function evaluations are expensive with respect to communication as well as the case where function evaluations are relatively inexpensive. We also consider a situation where local communication is inexpensive compared to external communication, such as multicore systems in a cluster.
Original Publication Citation
Andrew McNabb, Matthew Gardner, and Kevin Seppi. "An Exploration of Topologies and Communication in Large Particle Swarms." In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 29). pp. 712-719. Trondheim, Norway.
BYU ScholarsArchive Citation
Gardner, Matthew; McNabb, Andrew; and Seppi, Kevin, "An Exploration of Topologies and Communication in Large Particle Swarms" (2009). All Faculty Publications. 869.
Physical and Mathematical Sciences
© 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Copyright Use Information