Journal
NEURAL COMPUTING & APPLICATIONS
Volume 25, Issue 7-8, Pages 1507-1516Publisher
SPRINGER LONDON LTD
DOI: 10.1007/s00521-014-1661-6
Keywords
Particle swarm optimisation; Optimisation; Dynamic optimisation problem
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available