Defining a Standard for Particle Swarm Optimization

@article{Bratton2007DefiningAS,
  title={Defining a Standard for Particle Swarm Optimization},
  author={Daniel Bratton and James Kennedy},
  journal={2007 IEEE Swarm Intelligence Symposium},
  year={2007},
  pages={120-127}
}
Particle swarm optimization has become a common heuristic technique in the optimization community, with many researchers exploring the concepts, issues, and applications of the algorithm. In spite of this attention, there has as yet been no standard definition representing exactly what is involved in modern implementations of the technique. A standard is defined here which is designed to be a straightforward extension of the original algorithm while taking into account more recent developments… 

Figures and Tables from this paper

Particle Swarm Optimization with Flexible Swarm for Unconstrained Optimization
TLDR
The particle swarm optimization algorithm with flexible swarm (PSO-FS) was evaluated on 14 functions often used to benchmark the performance of optimization algorithms and showed that PSO- FS always performed one of the better results.
New evolution algorithm based on the standard particle swarm optimization
TLDR
This research proves that the convergence process of PSO has nothing to do with the velocity and the proposed method modified simple PSO (msPSO) can converge.
A Comprehensive Review of Swarm Optimization Algorithms
TLDR
The results indicate the overall advantage of Differential Evolution (DE) and is closely followed by Particle Swarm Optimization (PSO), compared with other considered approaches.
Particle Swarm Optimization with Velocity Adaptation
TLDR
The idea is to introduce a velocity adaptation mechanism into PSO algorithms that is similar to step size adaptation used in evolution strategies and it is shown that using velocity adaptation leads to better results for a wide range of benchmark functions.
Simple and Adaptive Particle Swarms
TLDR
This thesis details and explains the substantial advances made to both the theoretical and practical aspects of particle swarm optimization over the past 10 years in the context of what has been achieved to this point, as well as what has yet to be understood or solidified within the research community.
Design and experimental evaluation of multiple adaptation layers in self-optimizing particle swarm optimization
TLDR
A novel self-optimizing particle swarm optimizer with multiple adaptation layers is introduced, and the new idea of using virtual parameter swarms which hold modifiable parameter configurations each is introduced.
A behavioral-based approach to Particle Swarm Optimization
TLDR
The presented algorithm relies on the idea that the particles exploring the search space can be divided in subgroups, each of which with a peculiar behavior, such as to enlarge the explored area while refining the actual solution.
Limiting the Velocity in the Particle Swarm Optimization Algorithm
TLDR
This work presents a different method to regulate the velocity by changing the maximum limit of the velocity at each iteration, thus eliminating the use of a factor in the PSO algorithm.
Hybrid Particle Swarm Optimizers with a General Fitness Evaluation Strategy
TLDR
This paper hybridizes GFES with several PSO's variants, and shows that these hybrid PSOs are effective for coping with multimodal problems.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 13 REFERENCES
A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems
  • J. Vesterstrom, R. Thomsen
  • Computer Science
    Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)
  • 2004
TLDR
The results from this study show that DE generally outperforms the other algorithms, however, on two noisy functions, both DE and PSO were outperformed by the EA.
Particle swarm optimization
TLDR
A snapshot of particle swarming from the authors’ perspective, including variations in the algorithm, current and ongoing research, applications and open problems, is included.
Comparison between Genetic Algorithms and Particle Swarm Optimization
TLDR
This paper compares two evolutionary computation paradigms: genetic algorithms and particle swarm optimization, and suggests ways in which performance might be improved by incorporating features from one paradigm into the other.
Comparing inertia weights and constriction factors in particle swarm optimization
  • R. Eberhart, Y. Shi
  • Computer Science
    Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)
  • 2000
TLDR
It is concluded that the best approach is to use the constriction factor while limiting the maximum velocity Vmax to the dynamic range of the variable Xmax on each dimension.
A new optimizer using particle swarm theory
  • R. Eberhart, J. Kennedy
  • Computer Science
    MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science
  • 1995
The optimization of nonlinear functions using particle swarm methodology is described. Implementations of two paradigms are discussed and compared, including a recently developed locally oriented
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
TLDR
This paper analyzes a particle's trajectory as it moves in discrete time, then progresses to the view of it in continuous time, leading to a generalized model of the algorithm, containing a set of coefficients to control the system's convergence tendencies.
A modified particle swarm optimizer
  • Y. Shi, R. Eberhart
  • Computer Science
    1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360)
  • 1998
TLDR
A new parameter, called inertia weight, is introduced into the original particle swarm optimizer, which resembles a school of flying birds since it adjusts its flying according to its own flying experience and its companions' flying experience.
Neighborhood topologies in fully informed and best-of-neighborhood particle swarms
  • J. Kennedy, R. Mendes
  • Computer Science
    IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
  • 2006
TLDR
It appears that a fully informed particle swarm is more susceptible to alterations in the topology, but with a goodTopology, it can outperform the canonical version.
Flocks, herds and schools: A distributed behavioral model
TLDR
This paper explores an approach based on simulation as an alternative to scripting the paths of each bird individually, an elaboration of a particle systems, with the simulated birds being the particles.
Exposing origin-seeking bias in PSO
TLDR
The strategy of resizing the initialization space, proposed by Gehlhaar and Fogel and made popular in the PSO context by Angeline, is shown to be insufficiently general for revealing an algorithm's tendency to focus its efforts on regions at or near the origin.
...
1
2
...