Runtime analysis of binary PSO

@inproceedings{Sudholt2008RuntimeAO,
  title={Runtime analysis of binary PSO},
  author={Dirk Sudholt and Carsten Witt},
  booktitle={GECCO},
  year={2008}
}
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and a swarm of particles. Each particle consists of a current position, an own best position and a velocity vector used in a probabilistic process to update the particle's position. We present lower bounds for swarms of polynomial size. To prove upper bounds, we transfer a fitness-level argument well-established for… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

Particle swarm optimization

  • J. Kennedy, R. C. Eberhart
  • In Proc. of the IEEE International Conference on…
  • 1995
Highly Influential
12 Excerpts

Similar Papers

Loading similar papers…