A review of particle swarm optimization. Part I: background and development
By Alec Banks, Jonathan Vincent, Chukwudi Anyakoha. Natural Computing, 2007
638 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/d5844250670a303d1f3ca39f5b1ce54d8c21fe1a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Marco Dorigo
- Luca Maria Gambardella
- Mohammad Reza Bonyadi
- Leonora Bianchi
- Z. Michalewicz
- M. N. Ab Wahab
- Samia Nefti-Meziani
- Adham Atyabi
In Computational Theory and Mathematics
- Marco Dorigo
- Luca Maria Gambardella
- Leonora Bianchi
- Mohammad Reza Bonyadi
- M. N. Ab Wahab
- Samia Nefti-Meziani
- Adham Atyabi
- Walter J. Gutjahr
Citations in the corpus
- A survey on metaheuristics for stochastic combinatorial optimization (2009, background): “Recent and comprehensive overviews on PSO can be found in Banks et al. (2007, 2008) and Poli et al. (2007). In PSO a set of particles is placed in the search space of a given optimization problem, and each particle evaluates the objective function corresponding to its current location.”
- Particle Swarm Optimization for Single Objective Continuous Space Problems: A Review (2017, methodology): “In 2007, the fourth review paper on PSO was published (Banks et al., 2007).”
- A Comprehensive Review of Swarm Optimization Algorithms (2015, background): “The second to fourth steps get repeated until the termination condition is satisfied [40, 46–48].”