Skip to main content

An Adaptive Individual Inertia Weight Based on Best, Worst and Individual Particle Performances for the PSO Algorithm

  • Conference paper
  • First Online:

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

Abstract

Due to the growing need for metaheuristics with features that allow their implementation for real-time problems, this paper proposes an adaptive individual inertia weight in each iteration considering global and individual analysis, i.e., the best, worst and individual particles’ performance. As a result, the proposed adaptive individual inertia weight presents faster convergence for the Particle Swarm Optimization (PSO) algorithm when compared to other inertia mechanisms. The proposed algorithm is also suitable for real-time problems when the actual optimum is difficult to be attained, since a feasible and optimized solution is found in comparison to an initial solution. In this sense, the PSO with the proposed adaptive individual inertia weight was tested using eight benchmark functions in the continuous domain. The proposed PSO was compared to other three algorithms, reaching better optimized results in six benchmark functions at the end of 2000 iterations. Moreover, it is noteworthy to mention that the proposed adaptive individual inertia weight features rapid convergence for the PSO algorithm in the first 1000 iterations.

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   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

Learn about institutional subscriptions

References

  1. Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Wesley, Hoboken (1989)

    MATH  Google Scholar 

  2. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Network, vol. 4, pp. 1942–1948 (1995)

    Google Scholar 

  3. Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53–66 (1997)

    Article  Google Scholar 

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

    Google Scholar 

  5. Eberhart, R.C., Shi, Y.: Tracking and optimizing dynamic systems with particle swarms. In: Proceedings of the Congress on Evolutionary Computation, vol. 1, pp. 94–100 (2001)

    Google Scholar 

  6. Chatterjee, A., Siarry, P.: Nonlinear intertia weight variation for dynamic adaptation in particle swarm optimization. Comput. Oper. Res. 33(3), 859–871 (2006)

    Article  Google Scholar 

  7. Zheng, Y., Ma, L., Zhang, L., Qian, J.: Empirical study of particle swarm optimizer with an increasing inertia weight. IEEE Congr. Evol. Comput. 1, 221–226 (2003)

    Google Scholar 

  8. Nickabadi, A., Ebadzadeh, M.M., Safabakhsh, R.: A novel particle swarm optimization algorithm with adaptive inertia weight. Appl. Soft Comput. 11(4), 3658–3670 (2011)

    Article  Google Scholar 

  9. Shi, Y., Eberhart, R.C.: Fuzzy adaptive particle swarm optimization. In: Proceedings of the Congress on Evolutionary Computation, vol. 1 pp. 101–106 (2001)

    Google Scholar 

  10. Panigrahi, B.K., Pandi, V.R., Das, S.: Adaptive particle swarm optimization approach for static and dynamic economic load dispatch. Energy Convers. Manag. 49(6), 1407–1415 (2008)

    Article  Google Scholar 

  11. Xueming, Y., Jinsha, Y., Jiangye, Y., Huina, M.: A modified particle swarm optimizer with dynamic adaptation. Appl. Math. Comput. 189(2), 1205–1213 (2007)

    MathSciNet  MATH  Google Scholar 

  12. Shi, Y., Eberhart, R.C.: Empirical study of particle swarm optimization. In: Proceedings of the Congress on Evolutionary Computation, vol. 3, pp. 1945–1950 (1999)

    Google Scholar 

Download references

Acknowledgements

This paper was supported by FAPESP (grant number 2015/12599-0), CNPq (grant number 420298/2016-9) and CAPES.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. A. S. Fernandes .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Spavieri, G., Cavalca, D.L., Fernandes, R.A.S., Lage, G.G. (2018). An Adaptive Individual Inertia Weight Based on Best, Worst and Individual Particle Performances for the PSO Algorithm. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2018. Lecture Notes in Computer Science(), vol 10841. Springer, Cham. https://doi.org/10.1007/978-3-319-91253-0_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-91253-0_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-91252-3

  • Online ISBN: 978-3-319-91253-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics