[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Abstract

Classical Particle Swarm Optimization (PSO) has limitations of slow convergence rate and getting trapped in a local optimum solution, when the data dimensions are high. It is therefore important to propose an algorithm that has an ability to overcome the limitations of classical PSO. Keeping in view the above mentioned limitations, this paper proposes a variant of classical PSO that has an ability to overcome the problem of slow convergence and skipping the local optimum solution. The proposed algorithm is based on a jumping strategy which triggers the particles to jump whenever they are found stuck in a local optimum solution. The proposed jumping strategy in PSO not only enables the algorithm to skip the local optima but also enables it to converge at a faster rate. The effectiveness of the proposed jumping strategy is demonstrated by performing experiments on a benchmark dataset that contains both the unimodal and the multimodal test functions.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 159.50
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 199.99
Price includes VAT (United Kingdom)
  • 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

Similar content being viewed by others

References

  1. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN’95-international conference on neural networks, pp 1942–1948

    Google Scholar 

  2. Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. In: IEEE world congress on computational intelligence, pp 69–73

    Google Scholar 

  3. Wang D, Tan D, Liu L (2018) Particle swarm optimization algorithm: an overview. Soft Comput 22(2):387–408

    Article  Google Scholar 

  4. Lynn N, Ali MZ, Suganthan PN (2018) Population topologies for particle swarm optimization and differential evolution. Swarm Evol Comput 39:24–35

    Article  Google Scholar 

  5. Elbes M, Alzubi S, Kanan T, Al-Fuqaha A, Hawashin B (2019) A survey on particle swarm optimization with emphasis on engineering and network applications. Evol Intell 12(2):113–129

    Article  Google Scholar 

  6. Elsheikh AH, Abd Elaziz M (2019) Review on applications of particle swarm optimization in solar energy systems. Int J Environ Sci Technol 16(2):1159–1170

    Google Scholar 

  7. Rehman AU, Bermak A (2018) Drift-insensitive features for learning artificial olfaction in e-nose system. IEEE Sens J 18(17):7173–7182

    Article  Google Scholar 

  8. Habib M, Aljarah I, Faris H, Mirjalili S (2020) Multi-objective particle swarm optimization: theory, literature review, and application in feature selection for medical diagnosis. In: Evolutionary machine learning techniques, pp 175–201

    Google Scholar 

  9. Ur Rehman A, Khanum A, Shaukat A (2013) Hybrid feature selection and tumor identification in brain MRI using swarm intelligence. In: IEEE 11th international conference on frontiers of information technology

    Google Scholar 

  10. Rezaee Jordehi A, Jasni J (2012) Particle swarm optimisation for discrete optimisation problems: a review. Artif Intell Rev 43(2):243–258

    Google Scholar 

  11. Lalwani S, Sharma H, Satapathy SC, Deep K, Bansal JC (2019) A survey on parallel particle swarm optimization algorithms. Arab J Sci Eng 44(4):2899–2923

    Article  Google Scholar 

  12. Ur Rehman A, Bermak A (2018) Recursive DBPSO for computationally efficient electronic nose system. IEEE Sens J 18(1):320–327

    Google Scholar 

  13. Ur Rehman A, Bermak A (2018) Swarm intelligence and similarity measures for memory efficient electronic nose system. IEEE Sens J 18(6):2471–2482

    Google Scholar 

  14. Koh B, George AD, Haftka RT, Fregly BJ (2006) Parallel asynchronous particle swarm optimization. Int J Numer Methods Eng 67(4):578–595

    Google Scholar 

  15. Schutte JF, Koh BII, Reinbolt JA, Haftka RT, George AD, Fregly BJ (2005) Evaluation of a particle swarm algorithm for biomechanical optimization. J Biomech Eng 127(3):465–474

    Article  Google Scholar 

  16. ZH. Zhan, Zhang J, Li Y, Chung HSH (2009) Adaptive particle swarm optimization. IEEE Trans Syst Man Cybern Part B Cybern 39(6):1362–1381

    Google Scholar 

  17. Jamian JJ, Abdullah MN, Mokhlis H, Mustafa MW, Bakar AHA (2014) Global particle swarm optimization for high dimension numerical functions analysis. J Appl Math 2014

    Google Scholar 

  18. Xu G et al (2019) Particle swarm optimization based on dimensional learning strategy. Swarm Evol Comput 45:33–51

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Atiq Ur Rehman .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ur Rehman, A., Islam, A., Azizi, N., Belhaouari, S.B. (2022). Jumping Particle Swarm Optimization. In: Yang, XS., Sherratt, S., Dey, N., Joshi, A. (eds) Proceedings of Sixth International Congress on Information and Communication Technology. Lecture Notes in Networks and Systems, vol 236. Springer, Singapore. https://doi.org/10.1007/978-981-16-2380-6_65

Download citation

Publish with us

Policies and ethics