Skip to main content

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 56))

Abstract

Particle swarm optimization (PSO) is a new population based stochastic search algorithm, which has shown good performance on well-known numerical test problems. However, on strongly multimodal test problems the PSO easily suffers from premature convergence. In this paper, an improved diversity guided PSO is proposed, namely IARPSO, which combines a diversity guided PSO (ARPSO) and a Cauchy mutation operator. The purpose of IARPSO is to enhance the global search ability of ARPSO by Conducting a Cauchy mutation on the global best particle. Experimental results on 6 multimodal functions with many local minima show that the IARPSO outperforms the standard PSO, ARPSO and ATRE-PSO on all test functions.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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: Proceedings of IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

  2. Eberhart, R.C., Shi, Y.: Comparison Between Genetic Algorithms and Particle Swarm Optimization. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 69–73. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Riget, J., Vesterstom, J.S.: A Diversity-guided Particle Swarm Optimizer – the arPSO. Technical report, EVAlife, Denmark (2002)

    Google Scholar 

  4. Pant, M., Radha, T., Singh, V.P.: A Simple Diversity Guided Particle Swarm Optimization. In: Proceedings of Congress Evolutionary Computation, pp. 3294–3299 (2007)

    Google Scholar 

  5. Hu, X., Shi, Y., Eberhart, R.C.: Recent Advance in Particle Swarm. In: Proceedings of Congress Evolutionary Computation, pp. 90–97 (2004)

    Google Scholar 

  6. Shi, Y., Eberhart, R.C.: A Modified Particle Swarm Optimization. In: Proceedings of Congress Evolutionary Computation, pp. 69–73 (1998)

    Google Scholar 

  7. Yao, X., Liu, Y., Lin, G.: Evolutionary Programming Made Faster. IEEE Trans. Evol. Comput. 3, 82–102 (1999)

    Article  Google Scholar 

  8. Wang, H., Liu, Y., Li, C.H., Zeng, S.Y.: A Hybrid Particle Swarm Algorithm with Cauchy Mutation. In: Proceedings of IEEE Swarm Intelligence Symposium, pp. 356–360 (2007)

    Google Scholar 

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 chapter

Cite this chapter

Xu, D., Ai, X. (2009). An Improved Diversity Guided Particle Swarm Optimization. In: Wang, H., Shen, Y., Huang, T., Zeng, Z. (eds) The Sixth International Symposium on Neural Networks (ISNN 2009). Advances in Intelligent and Soft Computing, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01216-7_66

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01216-7_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01215-0

  • Online ISBN: 978-3-642-01216-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics