Skip to main content

Particle Swarm Optimization with Single Particle Repulsivity for Multi-modal Optimization

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

Abstract

This work presents a simple but effective modification of the velocity updating formula in the Particle Swarm Optimization algorithm to improve the performance of the algorithm on multi-modal problems. The well-known issue of premature swarm convergence is addressed by a repulsive mechanism implemented on a single-particle level where each particle in the population is partially repulsed from a different particle. This mechanism manages to prolong the exploration phase and helps to avoid many local optima. The method is tested on well-known and typically used benchmark functions, and the results are further tested for statistical significance.

Keywords

M. Pluhacek—This work was supported by the Ministry of Education, Youth and Sports of the Czech Republic within the National Sustainability Programme Project no. LO1303 (MSMT-7778/2014), further by the European Regional Development Fund under the Project CEBIA-Tech no. CZ.1.05/2.1.00/03.0089 and by Internal Grant Agency of Tomas Bata University under the Projects no. IGA/CebiaTech/2018/003. This work is also based upon support by COST (European Cooperation in Science & Technology) under Action CA15140, Improving Applicability of Nature-Inspired Optimisation by Joining Theory and Practice (ImAppNIO), and Action IC1406, High-Performance Modelling and Simulation for Big Data Applications (cHiPSet). The work was further supported by resources of A.I. Lab at the Faculty of Applied Informatics, Tomas Bata University in Zlin (ailab.fai.utb.cz).

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. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

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

    Google Scholar 

  3. Kennedy, J.: The particle swarm: social adaptation of knowledge. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 303–308 (1997)

    Google Scholar 

  4. 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). ISSN 1568-4946

    Article  Google Scholar 

  5. Eberhart, R.C., Shi, Y.: Comparing inertia weights and constriction factors in particle swarm optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation, San Diego, USA, pp. 84–88 (2000)

    Google Scholar 

  6. Van Den Bergh, F., Engelbrecht, A.P.: A study of particle swarm optimization particle trajectories. Inf. Sci. 176(8), 937–971 (2006)

    Article  MathSciNet  Google Scholar 

  7. Riget, J., Vesterstrøm, J.S.: A diversity-guided particle swarm optimizer-the ARPSO. Technical Report, vol. 2, p. 2002. Department of Computer Science, University of Aarhus, Aarhus, Denmark (2002)

    Google Scholar 

  8. Han, F., Liu, Q.: An improved hybrid PSO based on ARPSO and the Quasi-Newton method. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds.) ICSI 2015. LNCS, vol. 9140, pp. 460–467. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-20466-6_48

    Chapter  Google Scholar 

  9. Engelbrecht, A.P.: Particle swarm optimization: iteration strategies revisited. In: 2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence, Ipojuca, pp. 119–123 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michal Pluhacek .

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

Pluhacek, M., Senkerik, R., Viktorin, A., Kadavy, T. (2018). Particle Swarm Optimization with Single Particle Repulsivity for Multi-modal Optimization. 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_45

Download citation

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

  • 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