PSO with Attractive Search Space Border Points

  • Michal PluhacekEmail author
  • Roman Senkerik
  • Adam Viktorin
  • Tomas Kadavy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10246)


One of the biggest drawbacks of the original Particle Swarm Optimization is the premature convergence and fast loss of diversity in the population. In this paper, we propose and discuss a simple yet effective modification to help the PSO maintain diversity and avoid premature convergence. The particles are randomly attracted towards the border points of the search space. We use the CEC13 Benchmark function set to test the performance of proposed method and compare it to original PSO.


Particle swarm optimization PSO Diversity 


  1. 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. 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. I. S (1998)Google Scholar
  3. 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. 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-4946CrossRefGoogle Scholar
  5. 5.
    Riget, J., Vesterstrøm, J.S.: A diversity-guided particle swarm optimizer-the ARPSO. Dept. Comput. Sci., Univ. of Aarhus, Aarhus, Denmark, Technical report 2 (2002)Google Scholar
  6. 6.
    Liang, J.J., Qu, B.-Y., Suganthan, P.N., Hernández-Díaz, A.G.: Problem Definitions and Evaluation Criteria for the CEC 2013 Special Session and Competition on Real-Parameter Optimization. Technical report 201212, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical report, Nanyang Technological University, Singapore (2013)Google Scholar
  7. 7.
    Van Den Bergh, F., Engelbrecht, A.P.: A study of particle swarm optimization particle trajectories. Inf. Sci. 176(8), 937–971 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    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

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Michal Pluhacek
    • 1
    Email author
  • Roman Senkerik
    • 1
  • Adam Viktorin
    • 1
  • Tomas Kadavy
    • 1
  1. 1.Faculty of Applied InformaticsTomas Bata University in ZlinZlinCzech Republic

Personalised recommendations