Skip to main content

Particle Swarm Optimization Using Lévy Probability Distribution

  • Conference paper
Advances in Computation and Intelligence (ISICA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4683))

Included in the following conference series:

Abstract

Velocity threshold is an important parameter to affect the performance of particle swarm optimization. In this paper, a novel velocity threshold automation strategy is proposed by incorporated with Lévy probability distribution. Different from Gaussian and Cauchy distribution, it has an infinite second moment and is likely to generate an offspring that is far away from its parent. Therefore, this method employs a larger capability of the global exploration by providing a large velocity scale for each particle. Simulation results show the proposed strategy is effective and efficient.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, pp. 1942–1948. IEEE Computer Society Press, Los Alamitos (1995)

    Chapter  Google Scholar 

  2. Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of 6th International Symposium on Micro Machine and Human Science, pp. 39–43 (1995)

    Google Scholar 

  3. Cui, Z.H., Zeng, J.C., Sun, G.J.: A fast particle swarm optimization. International Journal of Innovative Computing, Information and Control 2, 1365–1380 (2006)

    Google Scholar 

  4. Monson, C.K., Seppi, K.D.: The Kalman swarm: a new approach to particle motion in swarm optimization. In: Proc. of the Genetic and Evolutionary Computation Conference, pp. 140–150 (2004)

    Google Scholar 

  5. Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Transactions on Evolutionary Computation 10, 281–295 (2006)

    Article  Google Scholar 

  6. Shi, Y., Eberhart, R.: Parameter selection in particle swarm optimization. In: Porto, V.W., Waagen, D. (eds.) Evolutionary Programming VII. LNCS, vol. 1447, pp. 591–600. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Fourie, P.C., Groenwold, A.A.: The particle swarm optimization algorithm in size and shape optimization. Structure Multidisciplinary Optimization 23, 259–267 (2002)

    Article  Google Scholar 

  8. Schutte, J.: Particle swarms in sizing and global optimization. Master’s thesis, University of Pretoria, Department of Mechanical Engineering (2002)

    Google Scholar 

  9. Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial intelligence through simulated evolution. Wiley, New York (1966)

    MATH  Google Scholar 

  10. Cui, Z.H., Zeng, J.C., Sun, G.J.: Adaptive velocity threshold particle swarm optimization. In: Proceedings of the First International Conference on Rough Sets and Knowledge Technology, China, pp. 327–332 (2006)

    Google Scholar 

  11. Fogel, D.B.: An introduction to simulated evolutionary optimization. IEEE Transactions on Neural Networks 5, 3–14 (1994)

    Article  Google Scholar 

  12. Lévy, P.: Theorie de l’addition des veriables aleatoires, Guathier-Villars, Paris, France (1937)

    Google Scholar 

  13. Gnedenko, B., Kolmogorov, A.: Limit distribution for sums of independent random variables. Addition-Wesley, Cambirdge, MA (1954)

    Google Scholar 

  14. Mantegna, R.: Fast,accurate algorithm for numerical simulation of Lévy stable stochastic process. Physics Review E 49, 4677–4683 (1994)

    Article  Google Scholar 

  15. Lee, C.Y., Yao, X.: Evolutionary programming using mutations based on the Lévy probability distribution. IEEE Transactions on Evolutinary Computation 8, 1–13 (2004)

    Article  Google Scholar 

  16. Richer, T.J., Blackwell, T.M.: The Lévy particle swarm. In: Proceedings of IEEE Congress on Evolutionary Computation, Canada, pp. 808–815. IEEE Computer Society Press, Los Alamitos (2006)

    Chapter  Google Scholar 

  17. Ratnaweera, A., Halgamuge, S.K., Watson, H.C.: Self-Organizing Hierarchical Particle Swarm Opitmizer with Time-Varying Acceleration Coefficients. IEEE Transactions on Evolutionary Computation 8, 240–255 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lishan Kang Yong Liu Sanyou Zeng

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cai, X., Zeng, J., Cui, Z., Tan, Y. (2007). Particle Swarm Optimization Using Lévy Probability Distribution. In: Kang, L., Liu, Y., Zeng, S. (eds) Advances in Computation and Intelligence. ISICA 2007. Lecture Notes in Computer Science, vol 4683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74581-5_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74581-5_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74580-8

  • Online ISBN: 978-3-540-74581-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics