2007
DOI: 10.1007/s11721-007-0002-0
|View full text |Cite
|
Sign up to set email alerts
|

Particle swarm optimization

Abstract: Particle swarm optimization (PSO) has undergone many changes since its introduction in 1995. As researchers have learned about the technique, they have derived new versions, developed new applications, and published theoretical studies of the effects of the various parameters and aspects of the algorithm. This paper comprises a snapshot of particle swarming from the authors' perspective, including variations in the algorithm, current and ongoing research, applications and open problems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

4
1,952
0
32

Year Published

2014
2014
2017
2017

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 7,891 publications
(1,988 citation statements)
references
References 66 publications
4
1,952
0
32
Order By: Relevance
“…On the contrary, in the local best model, the neighbourhood of a particle is defined by several fixed particles. Poli et al [94] stated that the global best model converges faster than the local best model whereas the former model has a higher probability of getting stuck in local optima than the latter model. Surveys of different PSO variations can be found in [95,96].…”
Section: Particle Swarm Optimization (Pso)mentioning
confidence: 99%
“…On the contrary, in the local best model, the neighbourhood of a particle is defined by several fixed particles. Poli et al [94] stated that the global best model converges faster than the local best model whereas the former model has a higher probability of getting stuck in local optima than the latter model. Surveys of different PSO variations can be found in [95,96].…”
Section: Particle Swarm Optimization (Pso)mentioning
confidence: 99%
“…The particles are "guided" towards the optimal solution. In fact, the updating rules for the position and the velocity of each particle are meant to simulate "social" interactions between individuals [19]. More precisely, according to the most general formulation of the PSO algorithm, the velocity of particle i is updated, at each iteration, according to the following rule [20]:…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…Finally, y (i) (t) and y(t) are the positions of the i−th particle with the best fitness function and the position of the particle with the best (among all particles) fitness function reached until instant t [19]. The idea behind the updating rule (11) for the velocities is to add to the previous velocity of each particle in the swarm (weighted by means of a multiplicative factor ω(t)) a stochastic combination of the direction to its best position (corresponding to the second addend in (11)) and to the global best position (third addend in (11)).…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…Initially, PSO inspired from flocks of birds, schools of fish, and even human social behavior. The nature-based meta-heuristic algorithm was proposed by Kennedy and Eberhart [21], [27]. They simulated a group of birds that are looking for food within some area and they don't know food location.…”
Section: A Particle Swarm Optimizationmentioning
confidence: 99%