Swarms in Dynamic Environments

  • T. M. Blackwell
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2723)


Charged particle swarm optimization (CPSO) is well suited to the dynamic search problem since inter-particle repulsion maintains population diversity and good tracking can be achieved with a simple algorithm. This work extends the application of CPSO to the dynamic problem by considering a bi-modal parabolic environment of high spatial and temporal severity. Two types of charged swarms and an adapted neutral swarm are compared for a number of different dynamic environments which include extreme ‘needle-in-the-haystack’ cases. The results suggest that charged swarms perform best in the extreme cases, but neutral swarms are better optimizers in milder environments.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kennedy J. and Eberhart, R.C.: Particle Swarm Optimization. Proc of the IEEE International Conference on Neural Networks IV (1995) 1942–1948CrossRefGoogle Scholar
  2. 2.
    Eberhart R.C. and Shi Y.: Particle swarm optimization: Developments, applications and resources. Proc Congress on Evolutionary Computation (2001) 81–86Google Scholar
  3. 3.
    Saunders P.T.: An Introduction to Catastrophe Theory. Cambridge University Press (1980)Google Scholar
  4. 4.
    Angeline P.J.: Tracking extrema in dynamic environments. Proc Evolutionary Programming IV. (1998) 335–345Google Scholar
  5. 5.
    Bäck T.: On the behaviour of evolutionary algorithms in dynamic environments. Proc Int. Conf. on Evolutionary Computation. (1998) 446–451Google Scholar
  6. 6.
    Branke J.: Evolutionary algorithms for changing optimization problems. Proc Congress on Evolutionary Computation. (1999) 1875–1882Google Scholar
  7. 7.
    Eberhart R.C. and Shi Y.: Tracking and optimizing dynamic systems with particle swarms. Proc Congress on Evolutionary Computation. (2001) 94–97Google Scholar
  8. 8.
    Carlisle A. and Dozier G.: Adapting particle swarm optimization to dynamic environments. Proc of Int Conference on Artificial Intelligence. (2000) 429–434Google Scholar
  9. 9.
    Blackwell and Bentley P.J.: Dynamic search with charged swarms. Proc Genetic and Evolutionary Computation Conference. (2002) 19–26Google Scholar
  10. 10.
    Blackwell and Bentley P.J.: Don’t push me! Collision avoiding swarms. Proc Congress on Evolutionary Computation. (2002) 1691–1696Google Scholar
  11. 11.
    Hu X. and Eberhart R.C.: Adaptive particle swarm optimization: detection and response to dynamic systems. Proc Congress on Evolutionary Computation. (2002) 1666–1670Google Scholar
  12. 12.
    De Jong K: An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan (1975)Google Scholar
  13. 13.
    Clerc M.: The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. Proc Congress on Evolutionary Computation. (1999) 1951–1957Google Scholar
  14. 14.
    Blackwell and Bentley P.J.: Improvised Music with Swarms, Proc Congress on Evolutionary Computation. (2002) 1462–1467Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • T. M. Blackwell
    • 1
  1. 1.Department of Computer ScienceUniversity College LondonLondonUK

Personalised recommendations