CriPS: Critical Particle Swarm Optimisation

@inproceedings{Erskine2014CriPSCP,
  title={CriPS: Critical Particle Swarm Optimisation},
  author={Adam Erskine and J. Michael Herrmann},
  booktitle={ECAL},
  year={2014}
}
Particle Swarm Optimisation (PSO) makes use of a dynamical system for solving a search task. Instead of adding search biases in order to improve performance in certain problems, we aim to remove algorithm-induced scales by controlling the swarm with a mechanism that is scale-free except possibly for a suppression of scales beyond the system size. In this way a very promising performance is achieved due to the balance of large-scale exploration and local search. The resulting algorithm shows… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-4 OF 4 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 30 REFERENCES

Particle swarm optimization

J. Kennedy, R. Eberhart
  • In Neural Networks,
  • 1995
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Self-organized criticality.

  • Physical review. A, General physics
  • 1988
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

CriPS : Critical Particle Swarm Optimisation

Adam Erskine
  • 2015

CriPS: Critical Particle Swarm Optimisation

Adam Erskine, J. Michael Herrmann
  • Proceedings of the European Conference on Artificial Life
  • 2015

CMA-ES with restarts for solving CEC 2013 benchmark problems

  • 2013 IEEE Congress on Evolutionary Computation
  • 2013
VIEW 1 EXCERPT

Inertia Weight strategies in Particle Swarm Optimization

  • 2011 Third World Congress on Nature and Biologically Inspired Computing
  • 2011
VIEW 2 EXCERPTS

Similar Papers

Loading similar papers…