Advertisement

A Scalability Analysis of Particle Swarm Optimization Roaming Behaviour

  • Jacomine GroblerEmail author
  • Andries P. Engelbrecht
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10385)

Abstract

This paper investigates the effect of problem size on the roaming behaviour of particles in the particle swarm optimization (PSO) algorithm. Both the extent and impact of the roaming behaviour in the absence of boundary constraints is investigated, as well as the PSO algorithm’s ability to find good solutions outside of the area in which particles are initialized. Four basic PSO variations and a diverse set of real parameter benchmark problems were used as basis for the investigation. Problem size was found to have a significant impact on algorithm performance and roaming behaviour. The larger the problem is that is being considered, the more important it is to address roaming behaviour.

References

  1. 1.
    Engelbrecht, A.P.: Particle swarm optimization: velocity initialization. In: IEEE Congress on Evolutionary Computation (2012)Google Scholar
  2. 2.
    Engelbrecht, A.P.: Roaming behavior of unconstrained particles. In: BRICS Congress on Computational Intelligence (2014)Google Scholar
  3. 3.
    Cheng, S., Shi, Y., Qin, Q.: Experimental study on boundary constraints handling in particle swarm optimization: from population diversity perspective. Int. J. Swarm Intell. Res. 2(3), 29–43 (2011)CrossRefGoogle Scholar
  4. 4.
    Chu, W., Gao, X., Sorooshian, S.: Handling boundary constraints for particle swarm optimization in high-dimensional search space. Inform. Sci. 181(20), 4569–4581 (2011)CrossRefGoogle Scholar
  5. 5.
    Xie, X.F., Bi, D.C.: Handling boundary constraints for numerical optimization by particle swarm flying in periodic search space. In: IEEE Congress on Evolutionary Computation, pp. 2307–2311 (2004)Google Scholar
  6. 6.
    Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Confererence on Neural Networks, pp. 1942–1948 (1995)Google Scholar
  7. 7.
    Clerc, M.: The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In: IEEE Congress on Evolutionary Computation, pp. 1951–1957 (1999)Google Scholar
  8. 8.
    Clerc, M., Kennedy, J.: The particle swarm - explosion, stability and convergence in a multidimensional complex space. IEEE Trans. Evolut. Comput. 6(1), 58–73 (2002)CrossRefGoogle Scholar
  9. 9.
    Van den Bergh, F., Engelbrecht, A.P.: A new locally convergent particle swarm optimiser. In: IEEE International Conference on Systems, Man and Cybernetics, pp. 6–12 (2002)Google Scholar
  10. 10.
    Kennedy, J.: Bare bones particle swarms. In: IEEE Swarm Intelligence Symposium, pp. 80–87 (2002)Google Scholar
  11. 11.
    Liang, J.J., Qu, B.Y., Suganthan, P.N., Chen, Q.: Problem definitions and evaluation criteria for the CEC 2015 competition on learning-based real-parameter single objective optimization. Technical report 201411A, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Nanyang Technological University, Singapore (2014)Google Scholar
  12. 12.
    Vesterstrom, J.S., Riget, J., Krink, T.: Division of labor in particle swarm optimisation. In: Congress on Evolutionary Computation, pp. 1570–1575 (2002)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Department of Industrial and Systems EngineeringUniversity of PretoriaPretoriaSouth Africa
  2. 2.Department of Computer ScienceUniversity of PretoriaPretoriaSouth Africa

Personalised recommendations