Advertisement

Elastic Boundary for Particle Swarm Optimization

  • Yuhong Chi
  • Fuchun Sun
  • Langfan Jiang
  • Chunming Yu
  • Ping Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7331)

Abstract

Standard particle swarm optimization (PSO) introduced in 2007, here called 2007-sPSO, is chosen as a starting algorithm in this paper. To solve the problems of the swarm’s velocity slowing down towards zero and stagnant phenomena in the later evolutionary process of 2007-sPSO, elastic boundary for PSO (EBPSO) is proposed, where search space boundary is not fixed, but adapted to the condition whether the swarm is flying inside the current elastic search space or not. When some particles are stagnant, they are activated to speed up in the range of the current elastic boundary, and personal cognition is cleared. Experimental results show that EBPSO improves the optimization performance of 2007-sPSO, and performs better than comparison algorithms.

Keywords

particle swarm optimization boundary search space personal cognition optimization performance 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)Google Scholar
  2. 2.
    EI-Abd, M., Kamel, M.S.: Particle Swarm Optimization with Varying Bounds. In: IEEE Congress on Evolutionary Computation, Singapore, pp. 4757–4761 (2007)Google Scholar
  3. 3.
    Galan, A.Y., Boryskina, O.P., Sauleau, R., Boriskin, A.V.: Particle Swarm Optimization Algorithm with Moving Boundaries as a Powerful Tool for Exploration Research. In: 5th European Conference on Antennas and Propagation (EUCAP), Rome, pp. 1961–1964 (2011)Google Scholar
  4. 4.
    Chen, B.R., Feng, X.: Particle Swarm Optimization with Contracted Ranges of Both Search Space and Velocity. Journal of Northeastern University (Natural Science) 26(5), 488–491 (2005) (in Chinese)Google Scholar
  5. 5.
    Kitayama, S., Yamazaki, K., Arakawa, M.: Adaptive Range Particle Swarm Optimization. Optimization and Engineering 10(4), 575–597 (2009)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Clerc, M.: From Theory to Practice in Particle Swarm Optimization. In: Panigrahi, B.K., Shi, Y., Lim, M.-H. (eds.) Handbook of Swarm Intelligence. ALO, vol. 8, pp. 3–36. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  7. 7.
    Clerc, M.: Standard Particle Swarm Optimization, http://clerc.maurice.free.fr/pso/
  8. 8.
    Poli, R.: Mean and Varinace of the Sampling Distribution of Particle Swarm Optimizers During Stagnation. IEEE Transactions on Evolutionary Computation 13, 712–721 (2009)CrossRefGoogle Scholar
  9. 9.
    Tang, K., Yao, X., Suganthan, P.N., MacNish, C., Chen, Y.P., Chen, C.M., et al.: Benchmark Functions for the CEC 2008 Special Session and Competition on Large Scale Global Optimization. Tech. Rep. No. NCL-TR-2007012, Hefei, China (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yuhong Chi
    • 1
    • 2
  • Fuchun Sun
    • 1
  • Langfan Jiang
    • 2
  • Chunming Yu
    • 2
  • Ping Zhang
    • 3
  1. 1.Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and TechnologyTsinghua UniversityBeijingChina
  2. 2.Unit 65053, PLADalianChina
  3. 3.Unit 65044, PLADalianChina

Personalised recommendations