Skip to main content

A Heterogeneous Particle Swarm

  • Conference paper
Artificial Life: Borrowing from Biology (ACAL 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5865))

Included in the following conference series:

Abstract

Almost all Particle Swarm Optimisation (PSO) algorithms use a number of identical, interchangeable particles that show the same behaviour throughout an optimisation. This paper describes a PSO algorithm in which the particles, while still identical, have two possible behaviours. Particles are not interchangeable as they make independent decisions when to change between the two possible behaviours. The difference between the two behaviours is that the attraction towards a particle’s personal best in one is changed in the other to repulsion from the personal best position. Results from experiments on three standard functions show that the introduction of repulsion enables the swarm to sequentially explore optima in problem space and enables it to outperform a conventional swarm with continuous attraction.

Heterogeneous – adj, : consisting of dissimilar or diverse ingredients orconstituents.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proc. IEEE International Conference on Neural Networks, Perth Australia, vol. IV, pp. 1942–1948. IEEE Service Centre, Piscataway (1995)

    Google Scholar 

  2. Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. Wiley, West Sussex (2006)

    Google Scholar 

  3. Blackwell, T.M., Bentley, P.: Don’t push me! Collision-avoiding swarms. In: CEC 2002. Proceedings of the 2002 Congress on Evolutionary Computation, vol. 2, pp. 1691–1696 (2002)

    Google Scholar 

  4. Hendtlass, T.: WoSP: a multi-optima particle swarm algorithm. In: CEC 2005 Proceedings of the 2005 Congress on Evolutionary Computation, pp. 727–734 (2005)

    Google Scholar 

  5. Pohlheim, H.: GEATbx: Genetic and Evolutionary Algorithm Toolbox for use with MATLAB Documentation (December 2008), http://www.geatbx.com/docu/index.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cartwright, L., Hendtlass, T. (2009). A Heterogeneous Particle Swarm. In: Korb, K., Randall, M., Hendtlass, T. (eds) Artificial Life: Borrowing from Biology. ACAL 2009. Lecture Notes in Computer Science(), vol 5865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10427-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10427-5_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10426-8

  • Online ISBN: 978-3-642-10427-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics