Skip to main content

Opposition-Based Particle Swarm Optimization with Velocity Clamping (OVCPSO)

  • Conference paper
Advances in Computational Intelligence

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 116))

Abstract

This paper presents an Opposition-based PSO(OVCPSO) which uses Velocity Clamping to accelerate its convergence speed and to avoid premature convergence of algorithm. Probabilistic opposition-based learning for particles has been used in the proposed method which uses velocity clamping to control the speed and direction of particles. Experiments have been performed upon various well known benchmark optimization problems and results have shown that OVCPSO can deal with difficult unimodal and multimodal optimization problems efficiently and effectively. The numbers of function calls (NFC) are significantly less than other PSO variants i.e. basic PSO with inertia weight, PSO with inertia weight and velocity clamping (VCPSO) and opposition based PSO with Cauchy Mutation (OPSOCM).

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 429.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 549.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.: Particle Swarm Optimization. In: IEEE International Conference on Neural Networks, Perth, Australia (1995)

    Google Scholar 

  2. Parsopoulos, K.E., Plagianakos, V.P., Magoulas, G.D., Vrahatis, M.N.: Objective Function “stretching” to Alleviate Convergence to Local Minima. Nonlinear Analysis TMA 47, 3419–3424 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Wang, H., Liu, Y., Li, C., Zeng, S.: Opposition-based Particle Swarm Algorithm with Cauchy Mutation. IEEE CEC, 4750–4756 (2007)

    Google Scholar 

  4. Han, L., He, X.: A novel Opposition-based Particle Swarm Optimization for Noisy Problems. In: Proceedings of the Third International Conference on Natural Computation, vol. 3, pp. 624–629. IEEE Press, Los Alamitos (2007)

    Chapter  Google Scholar 

  5. Rahnamayan, S., Tizhoosh, H.R., Salama, M.M.A.: Opposition-based differential evolution algorithms. In: IEEE CEC, Vancourver, BC, Canada (2006)

    Google Scholar 

  6. Rahnamayan, S., Tizhoosh, H.R., Salama, M.M.A.: Opposition-based differential evolution for optimization of noisy problems. In: IEEE CEC, Vancourver, BC, Canada (2006)

    Google Scholar 

  7. Tizhoosh, H.R.: Opposition-based learning: A new scheme for machine intelligence. In: International Conference on Computational Intelligence for Modeling Control and Automation - CIMCA 2005, Vienna, Austria, val. I, pp. 695–701 (2005)

    Google Scholar 

  8. Tizhoosh, H.R.: Opposition-based reinforcement learning. Journal of Advanced Computational Intelligence and Intelligent Informatics 10(3) (2006)

    Google Scholar 

  9. Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence. John Wiley & Sons, Chichester (2006)

    Google Scholar 

  10. Shi, Y., Eberhart, R.: A Modified Partilce Swarm Optimzer. In: Proceedings of the IEEE CEC, Piscataway, NJ, pp. 69–73 (1998)

    Google Scholar 

  11. GEATbx: (example functions), http://www.geatbx.com/docu/fcnindex-01.html#P160_7291 (viewed on 24-05-2009)

  12. Mathworld (Rosenbrock function), http://mathworld.wolfram.com/RosenbrockFunction.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shahzad, F., Baig, A.R., Masood, S., Kamran, M., Naveed, N. (2009). Opposition-Based Particle Swarm Optimization with Velocity Clamping (OVCPSO). In: Yu, W., Sanchez, E.N. (eds) Advances in Computational Intelligence. Advances in Intelligent and Soft Computing, vol 116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03156-4_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03156-4_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03155-7

  • Online ISBN: 978-3-642-03156-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics