Skip to main content

Multi-swarm Optimization in Dynamic Environments

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3005))

Abstract

Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present new variants of Particle Swarm Optimization (PSO) specifically designed to work well in dynamic environments. The main idea is to extend the single population PSO and Charged Particle Swarm Optimization (CPSO) methods by constructing interacting multi-swarms. In addition, a new algorithmic variant, which broadens the implicit atomic analogy of CPSO to a quantum model, is introduced. The multi-swarm algorithms are tested on a multi-modal dynamic function – the moving peaks benchmark – and results are compared to the single population approach of PSO and CPSO, and to results obtained by a state-of-the-art evolutionary algorithm, namely self-organizing scouts (SOS). We show that our multi-swarm optimizer significantly outperforms single population PSO on this problem, and that multi-quantum swarms are superior to multi-charged swarms and SOS.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blackwell, T.M.: Swarms in Dynamic Environments. In: Proc Genetic and Evolutionary Computation Conference, pp. 1–12 (2003)

    Google Scholar 

  2. Blackwell, T.M., Bentley, P.J.: Dynamic search with charged swarms. In: Proc Genetic and Evolutionary Computation Conference, pp. 19–26 (2002)

    Google Scholar 

  3. Blackwell, T.M.: Particle Swarms and Population Diversity I: Analysis. In: GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization Problems, pp. 103–107 (2003)

    Google Scholar 

  4. Blackwell, T.M.: Particle Swarms and Population Diversity II: Experiments. In: GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization Problems, pp. 108– 112 (2003)

    Google Scholar 

  5. Blackwell, T.M.: Particle Swarms and Population Diversity. Soft Computing (submitted)

    Google Scholar 

  6. Blackwell, T.M.: Swarm Music: Improvised Music with Multi-Swarms. In: Proc. AISB 2003 Symposium on Artificial Intelligence and Creativity in Arts and Science, pp. 41–49 (2003)

    Google Scholar 

  7. Branke, J., Schmeck, H.: Designing Evolutionary Algorithms for Dynamic Optimization Problems. In: Tsutsui, S., Ghosh, A. (eds.) Theory and Application of Evolutionary Computation: Recent Trends, pp. 239–262. Springer, Heidelberg (2002)

    Google Scholar 

  8. Branke, J.: Memory Enhanced EA for Changing Optimization Problems. Congress on Evolutionary Computation CEC 1999 3, 1875–1882 (1999)

    Google Scholar 

  9. Branke, J.: Evolutionary optimization in dynamic environments. Kluwer, Dordrecht (2001)

    Google Scholar 

  10. Branke, J.: The moving peaks benchmark, website Online http://www.aifb.unikarlsruhe.de/~jbr/MovPeaks

  11. Brits, R., Engelbrecht, A.P., van den Bergh, F.: A Niching Particle Swarm Optimizer. In: Fourth Asia-Pacific Conference on Simulated Evolution and Learning, Singapore, pp. 692–696 (2002)

    Google Scholar 

  12. Carlisle, A., Dozier, G.: Adapting Particle Swarm Optimization to Dynamic Environments. In: Proc of Int Conference on Artificial Intelligence, pp. 429–434 (2000)

    Google Scholar 

  13. Clerc, M., Kennedy, J.: The Particle Swarm: Explosion, Stability and Convergence in a Multi-Dimensional Complex Space. IEEE Transactions on Evolutionary Computation 6, 158–173 (2002)

    Article  Google Scholar 

  14. French, A.P., Taylor, E.F.: An Introduction to Quantum Physics. W.W. Norton and Company, New York (1978)

    Google Scholar 

  15. Hu, X., Eberhart, R.C.: Adaptive particle swarm optimisation: detection and response to dynamic systems. In: Proc Congress on Evolutionary Computation, pp. 1666–1670 (2002)

    Google Scholar 

  16. Kennedy, J., ad Mendes, R.: Population Structure and Particle Swarm Performance. Congress on Evolutionary Computation, 1671–1676 (2002)

    Google Scholar 

  17. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of the 1995 IEEE International Conference on Neural Networks. IV, pp. 1942–1948 (1995)

    Google Scholar 

  18. Parsopoulos, K.E., Vrahatis, M.N.: Recent Approaches to Global Optimization Problems through ParticleSwarm Optimization. Natural Computing 1, 235–306 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blackwell, T., Branke, J. (2004). Multi-swarm Optimization in Dynamic Environments. In: Raidl, G.R., et al. Applications of Evolutionary Computing. EvoWorkshops 2004. Lecture Notes in Computer Science, vol 3005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24653-4_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24653-4_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21378-9

  • Online ISBN: 978-3-540-24653-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics