Skip to main content

Comparison of Applying Centroidal Voronoi Tessellations and Levenberg-Marquardt on Hybrid SP-QPSO Algorithm for High Dimensional Problems

  • Conference paper
Advances in Swarm Intelligence (ICSI 2014)

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

Included in the following conference series:

  • 2698 Accesses

Abstract

In this study, different methods entitled Centroidal Voronoi Tessellations and Levenberg-Marquardt applied on SP-QPSO separately to enhance its performance and discovering the optimum point and maximum/ minimum value among the feasible space. Although the results of standard SP-QPSO shows its ability to achieve the best results in each tested problem in local search as well as global search, these two mentioned techniques are applied to compare the performance of managing initialization part versus convergence of agents through the searching procedure respectively. Moreover, because SP-QPSO is tested on low dimensional problems in addition to high dimensional problems SP-QPSO combined with CVT as well as LM, separately, are also tested with the same problems. To confirm the performance of these three algorithms, twelve benchmark functions are engaged to carry out the experiments in 2, 10, 50, 100 and 200 dimensions. Results are explained and compared to indicate the importance of our study.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co. (1989)

    Google Scholar 

  2. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceeding of International Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

  3. Dorigo, M., Caro, G.D.: The Ant Colony Optimization Meta-heuristic. New Ideas in Optimization, pp. 11–32. McGraw-Hill Ltd., UK Maidenhead (1999)

    Google Scholar 

  4. Duan, Q.Y., Gupta, V.K., Sorooshian, S.: Shuffled Complex Evolution Approach for Effective and Efficient Global Minimization. Journal of Optimization Theory and Applications 76(3), 501–521 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Taherzadeh, G., Loo, C.K.: A Novel Hybrid SP-QPSO Algorithm Using CVT for High Dimensional Problems. In: The 2013 World Congress on Global Optimization (WCGO 2013), The Yellow Mountain, China (2013) (in press)

    Google Scholar 

  6. Talbi, E.G.: A Taxonomy of Hybrid Metaheuristics. Journal of Heuristics 8, 541–546 (2002)

    Article  Google Scholar 

  7. Yang, S., Wang, M., Jiao, L.: A Quantum Particle Swarm Optimization. Congress on Evolutionary Computation 1, 320–324 (2004)

    Google Scholar 

  8. Chu, W., Gao, X., Sorooshian, S.: A Solution to the Crucial Problem of Population Degeneration in High-dimensional Evolutionary Optimization. IEEE Systems Journal 5(3), 362–373 (2011)

    Article  Google Scholar 

  9. Du, Q., Gunzburger, M., Ju, L.: Meshfree, Probabilistic Determination of Point Sets and Support Regions for Meshless Computing. Comput. Methods Appl. Mech. Engrg. 191, 1349–1366 (2002)

    Article  MATH  Google Scholar 

  10. Du, Q., Emelianenko, M., Ju, L.: Convergence of the Lloyd Algorithm for Computing Centroidal Voronoi Tessellations. SIAM Journal on Numerical Analysis 44(1), 102–119 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Du, Q., Gunzburger, M., Ju, L.: Constrained Centroidal Voronoi Tessellations for Surfaces. SIAM Journal on Numerical Analysis 24(5), 1488–1506 (2003)

    MATH  MathSciNet  Google Scholar 

  12. Liu, Y., Wang, W., Levy, B., Sun, F., Yan, D., Lu, L., Yang, C.: On Centroidal Voronoi Tessellation — Energy Smoothness and Fast Computation. ACM Transactions on Graphics 28(4) (2009)

    Google Scholar 

  13. Richards, M., Ventura, D.: Choosing a Starting Configuration for Particle Swarm Optimization. In: IEEE International Joint Conference on Neural Networks, pp. 2309–2312 (2004)

    Google Scholar 

  14. Katare, S., Kalos, A., West, D.: A Hybrid Swarm Optimizer for Efficient Parameter Estimation. In: Congress on Evolutionary Computation (CEC 2004), vol. 1, pp. 309–315 (2004)

    Google Scholar 

  15. Levenberg, K.: A Method for the Solution of Certain Non-linear Problems in Least Squares. Journal of Quarterly of Applied Mathematics 2(2), 164–168 (1944)

    MATH  MathSciNet  Google Scholar 

  16. Gill, P.E., Murray, W.: Algorithms for the Solution of the Nonlinear Least-Squares Problem. SIAM Journal on Numerical Analysis 15(5), 977–992 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  17. Bigiarini, M.: Test Functions for Global Optimization (2012), http://www.rforge.net/doc/packages/hydroPSO/test_functions.html (Cited February 20, 2013)

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Taherzadeh, G., Loo, C.K. (2014). Comparison of Applying Centroidal Voronoi Tessellations and Levenberg-Marquardt on Hybrid SP-QPSO Algorithm for High Dimensional Problems. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds) Advances in Swarm Intelligence. ICSI 2014. Lecture Notes in Computer Science, vol 8794. Springer, Cham. https://doi.org/10.1007/978-3-319-11857-4_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11857-4_38

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11856-7

  • Online ISBN: 978-3-319-11857-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics