Skip to main content
SpringerLink
Log in

Particle swarms and population diversity

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

The optimisation of dynamic optima can be a difficult problem for evolutionary algorithms due to diversity loss. However, another population based search technique, particle swarm optimisation, is well suited to this problem. If some or all of the particles are ‘charged’, an extended swarm can be maintained, and dynamic optimisation is possible with a simple algorithm. Charged particle swarms are based on an electrostatic analogy—inter-particle repulsions enable charged particles to swarm around a nucleus of neutral particles. This paper proposes a diversity measure and examines its time development for charged and neutral swarms. These results facilitate predictions for optima tracking given knowledge of the amount of dynamism. A number of experiments test these predictions and demonstrate the efficacy of charged particle swarms in a simple dynamic environment.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  • Blackwell TM, Bentley PJ (2002) Dynamic search with charged swarms. In: Proceedings of genetic and evolutionary computation conference, pp 19–26

  • Blackwell TM (2003) Swarms in dynamic environments. In: Proceedings of genetic and evolutionary computation conference, pp 1–12

  • Branke J (2001) Evolutionary optimization in dynamic environments. Kluwer, Boston

    Google Scholar 

  • Branke J (2003) Evolutionary approaches to dynamic optimization problems—introduction and recent trends. In: Branke J (ed) GECCO workshop on evolutionary algorithms for dynamic optimization problems, pp 2–4

  • Carlisle A, Dozier G (2000) Adapting particle swarm optimisation to dynamic environments. In: Proceedings of international conference on artificial intelligence, pp 429–434

  • Clerc M, Kennedy J (2002) The particle swarm: explosion, stability and convergence in a multi-dimensional complex space. IEEE Trans Evol Comput 6:158–73

    Google Scholar 

  • Eberhart R, Shi Y (2000) Comparing inertia weights and constriction factors in particle swarm optimisation. In: Proceedings of congress on evolutionary computation, pp 84–88

  • Eberhart RC, Shi Y (2001) Particle swarm optimisation: developments, applications and resources. In: Proceedings of congress on evolutionary computation, pp 81–86

  • Eberhart RC, Shi Y (2001) Tracking and optimizing dynamic systems with particle swarms. In: Proceedings of congress on evolutionary computation, pp 94–97

  • Hu X, Eberhart RC (2002) Adaptive particle swarm optimisation: detection and response to dynamic systems. In: Proceedings of congress on evolutionary computation, pp 1666–1670

  • Kennedy J, Eberhart RC (1995) Particle swarm optimisation. Proc IEEE Int Conf Neural Netw 4:1942–1948

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Goldsmiths College, University of London, New Cross, London, SE14 6NW, UK

    T. M. Blackwell

Authors
  1. T. M. Blackwell
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to T. M. Blackwell.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blackwell, T.M. Particle swarms and population diversity. Soft Comput 9, 793–802 (2005). https://doi.org/10.1007/s00500-004-0420-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-004-0420-5

Keywords

Search

Navigation