Nothing Special   »   [go: up one dir, main page]

Skip to main content

An Inertia Weight Variable Particle Swarm Optimization Algorithm with Mutation

  • Conference paper
  • First Online:
Sensor Networks and Signal Processing

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 176))

  • 543 Accesses

Abstract

To improve the precision, accuracy, and speed of the particle swarm optimization (PSO) algorithm, the influence of the function concavity of the inertia weight reduction strategy on the performance of the algorithm is analyzed by heuristic and contrast experiments. The advantages and disadvantages of different mutation strategies are analyzed, and a PSO algorithm is proposed based on the summary of the experimental results. The algorithm introduces a new type of inertia weight change strategy and mutation mode, so that the particles have different mutation probability in different periods of the algorithm, and the inertia weight is linearly reduced in segments by increasing the absolute value of the slope. The experimental results show that the proposed algorithm has better performance than the original algorithm in most of the selected test functions. In other words, the improvements to the PSO algorithm can improve the precision, speed, and correct rate of PSO algorithm.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.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
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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.C.: Particle swarm optimization. In: Proceeding of IEEE International Conference on Neural Networks, pp. 1942–1948. Piscataway (1995)

    Google Scholar 

  2. Yang, X.S.: A new meta heuristic bat-inspired algorithm. Comput. Knowl. Technol. 6(23), 6569–6572 (2010)

    Google Scholar 

  3. Pathak, V.K., Singh, A.K.: A modified algorithm of particle swarm optimization for form error evaluation. TM Tech. Mess. 84, 272–292 (2017)

    Google Scholar 

  4. Liu, W., Sun, R.B., Wang, H.R.: Escape from the immune particle swarm algorithm embedded mechanism of simulated annea. Jilin Normal Univ. J. (Nat. Sci. Ed.) 39(1), 85–90 (2018)

    Google Scholar 

  5. Bouyer, A.: An optimized K-harmonic means algorithm combined with modified particle swarm optimization and cuckoo search algorithm. Found. Comput. Decis. Sci. 41(2), 99–121 (2016)

    Google Scholar 

  6. Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 69–73. Anchorage (1998)

    Google Scholar 

  7. Shi, Y., Eberhart, R.C.: Empirical study of particle swarm optimization. In: Proceedings of the World Multiconference on Systemic, Cybernetic and Informatics, pp. 1945–1950. Orlando, FL (2000)

    Google Scholar 

  8. Liu, W., Zhou, Y.R.: Modified inertia weight particle swarm optimizer. Comput. Eng. Appl. 45(7), 46–48 (2009)

    Google Scholar 

  9. Chen, G.M., Jia, J.Y., Han, Q.: Study on the strategy of decreasing inertia weight in particle swarm optimization algorithm. J. Xi’an Jiaotong Univ. 40(1), 53–61 (2006)

    Google Scholar 

  10. Fu, G.J., Wang, S.M., Liu, S.Y.: A PSO with dimension mutation operator. J. Wuhan Univ. Hydraul. Electr. Eng. 38(4), 79–83 (2005)

    Google Scholar 

  11. Wang, W.B., Lin, C., Zheng, Y.K.: Experiment and analysis of parameters in particle swarm optimization. J. Xihua Univ. (Nat. Sci. Ed.) 27(1), 76–80 (2008)

    Google Scholar 

  12. Clerc, M., Kennedy, J.: The particle swarm: explosion, stability, and convergence in multi-dimension complex space. IEEE Trans. Evol. Comput. 20(1), 1671–1676 (2002)

    Google Scholar 

  13. Li, N., Liu, F., Sun, D.B.: A study on the particle swarm optimization with mutation operator constrained layout optimization. Chin. J. Comput. 27(7), 899–902 (2004)

    Google Scholar 

  14. Eberhart, R.C., Shi, Y.: Comparing inertia weights and constriction factors in particle swarm optimization. In: Proceedings of the Congress on Evolutionary Computing, San Diego, USA, pp. 84–89. IEEE Service Center, Piscataway (2000)

    Google Scholar 

  15. Ge, R.P., Qin, Y.F.: The globally convexized filled functions for global optimization. Appl. Math. Comput. 35(2), 131–158 (1990)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tao Chao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhao, M., Ni, Y., Chao, T., Fang, K. (2021). An Inertia Weight Variable Particle Swarm Optimization Algorithm with Mutation. In: Peng, SL., Favorskaya, M., Chao, HC. (eds) Sensor Networks and Signal Processing. Smart Innovation, Systems and Technologies, vol 176. Springer, Singapore. https://doi.org/10.1007/978-981-15-4917-5_21

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-4917-5_21

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-4916-8

  • Online ISBN: 978-981-15-4917-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics