Asynchronous Particle Swarm Optimization
Veysel Gazi · 2007
In this article we consider an asynchronous particle swarm optimization (PSO) algorithm. In addition to the fact that the particles can update their estimates independently time delays are also allowed in obtaining information from their neighbors. Moreover, we test the performance of the algorithm with a simulation example.