Particle swarm optimisation for dynamic optimisation problems: a review

摘要

Some real-world optimisation problems are dynamic; that is, their objective function and/or constraints vary over time. Solving such problems is very challenging. Particle swarm optimisation (PSO) is a well-known and efficient optimisation algorithm. In this paper, the PSO variants, devised for dynamic optimisation problems, are reviewed. This is the first comprehensive review that is conducted on PSO variants in dynamic environments. The author believes that this paper can be useful for researchers who intend to solve dynamic optimisation problems.