Using Simulated Binary Crossover in Particle Swarm Optimization

  • Xiaoyu Huang
  • Enqiang Lin
  • Yujie Ji
  • Shijun Qiao
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 123)


Simulated binary crossover (SBX) operator is widely used in real-coded genetic algorithms. Particle swarm optimization (PSO) is a well-studied optimization scheme. In this paper, we combine SBX together with particle swarm optimization (PSO) procedures to prevent possible premature convergence. Benchmark tests are implemented and the result turns out that such modification enhances the exploitation ability of PSO.


Particle Swarm Optimization Standard Particle Swarm Optimization Exploitation Ability Conventional Genetic Algorithm Adaptive Particle Swarm Optimization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE (1995)Google Scholar
  2. 2.
    van den Bergh, F., Engelbrecht, A.P.: A new locally convergent particle swarm optimiser. In: IEEE International Conference on Systems, Man and Cybernetics, vol. 3, p. 6. IEEE (2002)Google Scholar
  3. 3.
    Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: The 1998 IEEE International Conference on Evolutionary Computation Proceedings, IEEE World Congress on Computational Intelligence, pp. 69–73. IEEE (1998)Google Scholar
  4. 4.
    Yang, X., Yuan, J., Yuan, J., Mao, H.: A modified particle swarm optimizer with dynamic adaptation. Applied Mathematics and Computation 189(2), 1205–1213 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Suganthan, P.N.: Particle swarm optimiser with neighbourhood operator. In: Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999., vol. 3, IEEE (1999)Google Scholar
  6. 6.
    Shi, Y., Eberhart, R.C.: Fuzzy adaptive particle swarm optimization. In: Proceedings of the 2001 Congress on Evolutionary Computation, vol. 1, pp. 101–106. IEEE (2001)Google Scholar
  7. 7.
    Deb, K., Kumar, A.: Real-coded genetic algorithms with simulated binary crossover: Studies on multimodel and multiobjective problems. Complex Systems 9(6), 431–454 (1995)Google Scholar
  8. 8.
    Ono, I., Kobayashi, S.: A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover. Journal of Japanese Society for Artificial Intelligence 14(6), 246–253 (1997)Google Scholar
  9. 9.
    Pošík, P.: Preventing Premature Convergence in a Simple EDA Via Global Step Size Setting. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 549–558. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  10. 10.
    Eberhart, R.C., Shi, Y.: Particle swarm optimization: developments, applications and resources. In: Proceedings of the 2001 Congress on Evolutionary Computation, vol. 1, pp. 81–86. IEEE, Piscataway (2001)Google Scholar
  11. 11.
    Deb, K., Beyer, H.: Self-adaptive genetic algorithms with simulated binary crossover. Evolutionary Computation 9(2), 197–221 (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Xiaoyu Huang
    • 1
  • Enqiang Lin
    • 1
  • Yujie Ji
    • 1
  • Shijun Qiao
    • 2
  1. 1.School of Software EngineeringNortheastern UniversityShenyangChina
  2. 2.School of ScienceNortheastern UniversityShenyangChina

Personalised recommendations