Soft Computing

, Volume 17, Issue 6, pp 1019–1030 | Cite as

A performance study on synchronicity and neighborhood size in particle swarm optimization

  • Juan Rada-VilelaEmail author
  • Mengjie Zhang
  • Winston Seah


This article presents a performance study on the effect of synchronicity in communications and neighborhood size in Particle Swarm Optimization (PSO) on large-scale optimization problems. The algorithms under study are the Synchronous PSO (S-PSO), the Asynchronous PSO (A-PSO), and the recently proposed Random Asynchronous PSO (RA-PSO), all of which are evaluated upon the set of benchmark functions presented at the IEEE CEC’2010 special session and competition on large-scale global optimization. Results show that RA-PSO has the best general performance in large neighborhoods, while S-PSO has the best one in small neighborhoods. Rigorous statistical analyses support our observations and provide a guideline on the performance of the algorithms under different neighborhood sizes.


Particle swarm optimization Asynchronous PSO Random asynchronous PSO Large-scale optimization 


  1. Carlisle A, Dozier G (2001) An off-the-shelf PSO. In: Workshop on particle swarm optimization, pp 1–6Google Scholar
  2. Eberhart R., Kennedy J (1995) A new optimizer using particle swarm theory. In: 6th international symposium on micro machine and human science, pp 39–43Google Scholar
  3. García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization. J Heuristics 15(6):617–644zbMATHCrossRefGoogle Scholar
  4. Gazi V, Passino KM (2011) Particle swarm optimization. In: Swarm stability and optimization. Springer, Berlin, pp 251–279Google Scholar
  5. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, vol 4, pp 1942–1948Google Scholar
  6. Koh BI, George A, Haftka R, Fregly B (2006) Parallel asynchronous particle swarm optimization. Int J Numer Methods Eng 67:578–595zbMATHCrossRefGoogle Scholar
  7. Lewis A, Mostaghim S, Scriven I (2009) Asynchronous multi-objective optimisation in unreliable distributed environments. In: Biologically-inspired optimisation methods. Studies in computational intelligence, vol 210. Springer, Berlin, pp 51–78Google Scholar
  8. Luo J, Zhang Z (2006) Research on the parallel simulation of asynchronous pattern of particle swarm optimization. Comput Simul 22(6):78–70 (in chinese)Google Scholar
  9. Mendes R (2004) Population topologies and their influence in particle swarm performance. PhD thesis, Universidade do Minho, PortugalGoogle Scholar
  10. Miller BL, Goldberg DE (1995) Genetic algorithms, tournament selection, and the effects of noise. Complex Syst 9:193–212MathSciNetGoogle Scholar
  11. Perez JR, Basterrechea J (2005) Particle swarm optimization and its application to antenna farfield-pattern prediction from planar scanning. Microw Opt Tech Lett 44(5):398–403CrossRefGoogle Scholar
  12. Rada-Vilela J, Zhang M, Seah W (2011a) Random asynchronous PSO. In: 5th international conference on automation, robotics and applications, pp 220–225Google Scholar
  13. Rada-Vilela J, Zhang M., Seah W. (2011b) A performance study on synchronous and asynchronous updates in particle swarm optimization. In: Genetic and evolutionary computation conference, pp 21–28Google Scholar
  14. Rada-Vilela J, Zhang M, Seah W (2012) A performance study on the effects of noise and evaporation in particle swarm optimization. In: IEEE congress on evolutionary computation, pp 873–880Google Scholar
  15. Schutte J (2001) Particle swarms in sizing and global optimization. Master’s thesis, University of Pretoria, South AfricaGoogle Scholar
  16. Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: IEEE world congress on computational intelligence, pp 69–73Google Scholar
  17. Sun C, Chiu C, Li C (2010) Time-domain inverse scattering of a two-dimensional metallic cylinder in slab medium using asynchronous particle swarm optimization. Prog Electromagn Res M 14:85–100CrossRefGoogle Scholar
  18. Tang K, Li X, Suganthan PN, Yang Z, Weise T (2009) Benchmark functions for the CEC’2010 special session and competition on large-scale global optimization. Technical report, Nature Inspired Computation and Applications Laboratory, USTC, ChinaGoogle Scholar
  19. van den Bergh F (2002) An analysis of particle swarm optimizers. PhD thesis, University of Pretoria, South AfricaGoogle Scholar
  20. Venter G, Sobieszczanski-Sobieski J (2006) A parallel particle swarm optimization algorithm accelerated by asynchronous evaluations. J Aerosp Comput Inf Commun 3(3):123–137CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.School of Engineering and Computer ScienceVictoria University of WellingtonWellingtonNew Zealand

Personalised recommendations