Skip to main content

An Improved PSO Algorithm with Migration Behavior and Asynchronous Varying Acceleration Coefficient

  • Conference paper
  • First Online:
Intelligent Computing Methodologies (ICIC 2019)

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

Included in the following conference series:

Abstract

Particle swarm optimization (PSO) has been developing at a fast pace and has a wide range of applications since it is easy to understand and implement. However, it is greatly limited by the problem of being trapped in local optimum. Inspired by the migration behavior of animals, MBPSO is proposed. In MBPSO, the whole evolutionary cycle is divided into several increasing sub-evolutionary cycles. As the particles complete each sub-evolutionary cycle, they move around from their original position. Moreover, in order to ensure convergence and improve con-vergence speed, acceleration coefficient and inertia weight change asynchronously with time. Standard PSO, SAPSO and SecPSO are selected for comparison with MBPSO. Then the performance of the four algorithms in six functions is tested. It is ultimately proved that the proposed MBPSO algorithm is more effective than the other three PSO algorithms.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

References

  1. Kennedy, J.: The behavior of particles. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds.) EP 1998. LNCS, vol. 1447, pp. 579–589. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0040809

    Chapter  Google Scholar 

  2. Hu, X.: Recent advances in particle swarm. In: Proceedings of the 2004 Congress on Evolutionary Computation, pp. 90–97. IEEE, Portland (2004)

    Google Scholar 

  3. Shi, Y., Liu, H., Fan, M., Huang, J.: Parameter identification of RVM runoff forecasting model based on improved particle swarm optimization. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013. LNCS, vol. 7928, pp. 160–167. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38703-6_19

    Chapter  Google Scholar 

  4. Niu, B., Zhu, Y., Hu, K., Li, S., He, X.: A novel particle swarm optimizer using optimal foraging theory. In: Huang, D.-S., Li, K., Irwin, G.W. (eds.) ICIC 2006. LNCS, vol. 4115, pp. 61–71. Springer, Heidelberg (2006). https://doi.org/10.1007/11816102_7

    Chapter  Google Scholar 

  5. Mendes, R.: Particle swarms for feedforward neural network training. In: Proceedings of the 2002 International Joint Conference on Neural Networks, pp. 1895–1899. IEEE, Honolulu (2002)

    Google Scholar 

  6. Venayagamoorthy, G.K.: Navigation of mobile sensors using PSO and embedded PSO in a fuzzy logic controller. In: Conference Record of the 2004 IEEE Industry Applications Conference. 39th IAS Annual Meeting, pp. 1200–1206. IEEE, Seattle (2004)

    Google Scholar 

  7. Gang, M.: A novel particle swarm optimization algorithm based on particle migration. Appl. Math. Comput. 218(11), 6620–6626 (2012)

    MathSciNet  MATH  Google Scholar 

  8. Mohais, A.S.: Randomized directed neighborhoods with edge migration in particle swarm optimization. In: Proceedings of the 2004 Congress on Evolutionary Computation, pp. 548–555. IEEE, Portland (2004)

    Google Scholar 

  9. El-Abd, M.: A cooperative particle swarm optimizer with migration of heterogeneous probabilistic models. Swarm Intell. 4(1), 57–89 (2010)

    Article  MathSciNet  Google Scholar 

  10. Cui, H.M.: Convergence analysis and parameter selection in particle swarm optimization. Jisuanji Gongcheng yu Yingyong (Comput. Eng. Appl.) 42(23), 89–91 (2007)

    Google Scholar 

  11. Hu, J.: Selection on inertia weight of particle swarm optimization. Comput. Eng. 33(11), 193–195 (2007)

    Google Scholar 

  12. Cui, Z.: An improved PSO with time-varying accelerator coefficients. In: 2008 Eighth International Conference on Intelligent Systems Design and Applications, pp. 638–643. IEEE, Kaohsiung (2008)

    Google Scholar 

  13. Mao, K.F.: Particle swarm optimization algorithm based on non-symmetric learning factor adjusting. Comput. Eng. 36(19), 182–184 (2010)

    Google Scholar 

  14. Hu, J.Z.: Research on particle swarm optimization with dynamic inertia weight. In: 2009 International Conference on Management and Service Science, pp. 1–4. IEEE, Guilin (2009)

    Google Scholar 

Download references

Acknowledgement

Jingzhou Jiang and Shukun Jiang contributed equally to this paper and shared the first authorship. This work is partially supported by the Natural Science Foundation of Guangdong Province (2016A030310074), Project supported by Innovation and Entrepreneurship Research Center of Guangdong University Student (2018A073825), Research Cultivation Project from Shenzhen Institute of Information Technology (ZY201717) and Innovating and Upgrading Institute Project from Department of Education of Guangdong Province (2017GWTSCX0 38). The author is sincerely grateful to all those who gave advice and discussions, especially Ben Niu. In addition, the author also wants to express sincere thanks to Qianying Liu who provided valuable advice.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jingzhou Jiang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jiang, S., Jiang, J., Zheng, C., Liang, Y., Tan, L. (2019). An Improved PSO Algorithm with Migration Behavior and Asynchronous Varying Acceleration Coefficient. In: Huang, DS., Huang, ZK., Hussain, A. (eds) Intelligent Computing Methodologies. ICIC 2019. Lecture Notes in Computer Science(), vol 11645. Springer, Cham. https://doi.org/10.1007/978-3-030-26766-7_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-26766-7_59

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-26765-0

  • Online ISBN: 978-3-030-26766-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics