Skip to main content

A Fast Particle Swarm Optimization Algorithm with Cauchy Mutation and Natural Selection Strategy

  • 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

The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous best to optimize problems. One problem exists in PSO is its tendency of trapping into local optima. In this paper, a fast particle swarm optimization (FPSO) algorithm is proposed by combining PSO and the Cauchy mutation and an evolutionary selection strategy. The idea is to introduce the Cauchy mutation into PSO in the hope of preventing PSO from trapping into a local optimum through long jumps made by the Cauchy mutation. FPSO has been compared with another improved PSO called AMPSO [12] on a set of benchmark functions. The results show that FPSO is much faster than AMPSO on all the test functions.

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.

Similar content being viewed by others

References

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

    Google Scholar 

  2. Eberhart, R.C., Kennedy, J., New, A.: Optimizer Using Particle Swarm Theory. In: Proceedings of the 6th International Symposium on Micro Machine and Human Science, pp. 39–43 (1995)

    Google Scholar 

  3. Ratnaweera, A., Halgamuge, S.K., Watson, H.C.: Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Transactions on Evolutionary Computation 8(3), 240–255 (2004)

    Article  Google Scholar 

  4. Sun, J., Feng, B., Xu, W.: Particle swarm optimization with particles having quantum behavior. In: Proceedings of the IEEE Congress on Evolutionary Computation, Portland, Oregon USA, pp. 325–331. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  5. Liu, J., Xu, W., Sun, J.: Quantum-behaved particle swarm optimization with mutation operator. In: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence, pp. 237–240. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  6. Krohling, R.A.: Gaussian particle swarm with jumps. In: Proceedings of the IEEE Congress on Evolutionary Computation, Edinburgh, UK, pp. 1226–1231. IEEE Computer Society Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  7. Krohling, R.A., dos Santos Coelho, L.: PSO-E: Particle Swarm with Exponential Distribution. In: Proceedings of the IEEE Congress on Evolutionary Computation, July 2006, pp. 1428–1433. IEEE Computer Society Press, Los Alamitos (2006)

    Chapter  Google Scholar 

  8. Narihisa, H., Taniguchi, T., Ohta, M., Katayama, K.: Evolutionary Programming with Exponential Mutation. In: Proceedings of the IASTED Artificial Intelligence and soft Computing, Benidorn, Spain, pp. 55–50 (2005)

    Google Scholar 

  9. Yao, X., Liu, Y.: Fast evolutionary programming. In: EP 1996. Proc. of the Fifth Annual Conference on Evolutionary Programming, San Diego, CA, USA, February 29-March 3, 1996, pp. 451–460. MIT Press, Cambridge (1996)

    Google Scholar 

  10. Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evolutionary Computation, 82–102 (1999)

    Google Scholar 

  11. Clerc, M., Kennedy, J.: The Particle Swarm: Explosion, Stability and Convergence in a Multi-Dimensional Complex Space. IEEE Trans. on Evolutionary Computation 6, 58–73 (2002)

    Article  Google Scholar 

  12. Pampara, G., Franken, N., Engelbrecht, A.P.: Combining Particle Swarm Optimisation with angle modulation to solve binary problems. In: Proceedings of the IEEE Congress on Evolutionary Computation, September 2005, pp. 89–96. IEEE Computer Society Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  13. van den Bergh, F.: An Analysis of Particle Swarm Optimizers. PhD thesis, Department of Computer Science, University of Pretoria, South Africa (2002)

    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

Li, C., Liu, Y., Zhou, A., Kang, L., Wang, H. (2007). A Fast Particle Swarm Optimization Algorithm with Cauchy Mutation and Natural Selection Strategy. 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_37

Download citation

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

  • 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