Skip to main content

A Hierarchical Particle Swarm Optimizer for Dynamic Optimization Problems

  • Conference paper

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

Abstract

Particle Swarm Optimization (PSO) methods for dynamic function optimization are studied in this paper. We compare dynamic variants of standard PSO and Hierarchical PSO (H-PSO) on different dynamic benchmark functions. Moreover, a new type of hierarchical PSO, called Partitioned H-PSO (PH-PSO), is proposed. In this algorithm the hierarchy is partitioned into several sub-swarms for a limited number of generations after a change occurred. Different methods for determining the time when to rejoin the hierarchy and how to handle the topmost sub-swarm are discussed. The test results show that H-PSO performs significantly better than PSO on all test functions and that the PH-PSO algorithms often perform best on multimodal functions where changes are not too severe.

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., Bentley, P.J.: Dynamic Search With Charged Swarms. In: Proceedings of GECCO 2002, pp. 19–26. Morgan Kaufmann Publishers, San Francisco (2002)

    Google Scholar 

  2. Blackwell, T.M.: Swarms in Dynamic Environments. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2003), pp. 1–12 (2003)

    Google Scholar 

  3. Blackwell, T.M.: Particle Swarms and Population Diversity I: Analysis. In: Proceedings of the Bird of a Feather Workshops (in EvoDOP 2003), Genetic and Evolutionary Computation Conference, pp. 103–107. AAAI, Menlo Park (2003)

    Google Scholar 

  4. Blackwell, T.M.: Particle Swarms and Population Diversity II: Experiments. In: Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference (in EvoDOP 2003), pp. 108–112. AAAI, Menlo Park (2003)

    Google Scholar 

  5. Branke, J.: Memory Enhanced Evolutionary Algorithms for Changing Optimization Problems. In: Proc. of CEC 1999, pp. 1875–1882. IEEE Press, Los Alamitos (1999)

    Google Scholar 

  6. Carlisle, A., Dozier, G.: Adapting Particle Swarm Optimization to Dynamic Environments. In: Proceedings of the International Conference on Artificial Intelligence (2000)

    Google Scholar 

  7. Carlisle, A., Dozier, G.: Tracking Changing Extrema with Particle Swarm Optimizer. Technical Report CSSE01-08, Auburn University (2001)

    Google Scholar 

  8. Carlisle, A.: Applying the Particle Swarm Optimizer to Non-Stationary Environments. PhD Dissertation, Auburn University (2002)

    Google Scholar 

  9. Carlisle, A., Dozier, G.: Tracking Changing Extrema with Adaptive Particle Swarm Optimizer. ISSCI, 2002 World Automation Congress, Orlando, USA (2002)

    Google Scholar 

  10. Eberhart, R.C., Shi, Y.: Tracking and Optimizing Dynamic Systems with Particle Swarms. In: Proceedings of the 2001 Congress on Evolutionary Computation (CEC 2001), pp. 94–100. IEEE Press, Los Alamitos (2001)

    Chapter  Google Scholar 

  11. Hu, X., Eberhart, R.: Tracking dynamic systems with PSO: where‘s the cheese. In: Proceedings of the Workshop on Particle Swarm Optimization, Purdue School of Engineering, Indinapolis, USA (2001)

    Google Scholar 

  12. Hu, X., Eberhart, R.: Adaptive Particle Swarm Optimization: Detection and Response to Dynamic Systems. In: Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002), pp. 1666–1670. IEEE Press, Los Alamitos (2002)

    Google Scholar 

  13. Janson, S., Middendorf, M.: A Hierarchical Particle Swarm Optimizer. In: Proc. Congress on Evolutionary Computation (CEC 2003), pp. 770–776. IEEE Press, Los Alamitos (2003)

    Chapter  Google Scholar 

  14. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: IEEE International Conference on Neural Networks (ICNN 1995), pp. 1942–1947 (1995)

    Google Scholar 

  15. Parsopoulos, K., Vrahatis, M.: Particle Swarm Optimizer in Noisy and Continuously Changing Environments. In: Hamza, M.H. (ed.) Artificial Intelligence and Soft Computing, pp. 289–294. IASTED/ACTA Press (2001)

    Google Scholar 

  16. Trelea, I.C.: The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters 85(6), 317–325 (2003)

    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

Janson, S., Middendorf, M. (2004). A Hierarchical Particle Swarm Optimizer for Dynamic Optimization Problems. 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_52

Download citation

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

  • 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