Skip to main content
SpringerLink
Log in

A Comparative Study of Exploration Ability of Harmony Search Algorithms

  • Conference paper
  • First Online:
Harmony Search Algorithm (ICHSA 2017)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 514))

Included in the following conference series:

  • 732 Accesses

Abstract

Harmony Search Algorithm (HSA) is one of the efficient optimization algorithms among various optimization algorithms proposed over the years. In literature, many variants of the Harmony search algorithms are proposed based on the various ideas. In this article the exploration ability of the four HS algorithms are compared. An experimental comparative study of exploration ability of different versions of HS algorithms is done. The article provides a detailed explorative abilities of various HS algorithms. The comparison is based on the theoretical studies performed in [1]. The theoretical conclusions of the exploration analysis are justified with experimental studies. This article concludes with the searching ability of various HS algorithms along with their ranking with most explorative HS algorithm.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

References

  1. Das, S., Mukhopadhyay, A., Roy, A., Abraham, A., Panigrahi, B.K.: Exploratory power of the harmony search algorithm: analysis and improvements for global numerical optimization. IEEE Trans. Syst. Man Cybern. Part B Cybern. 41(1), 89–106 (2011)

    Article  Google Scholar 

  2. Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)

    Article  Google Scholar 

  3. Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Appl. Math. Comput. 188(2), 1567–1579 (2007)

    MathSciNet  MATH  Google Scholar 

  4. Omran, M.G.H., Mahdavi, M.: Global-best harmony search. Appl. Math. Comput. 198(2), 643–656 (2008)

    MathSciNet  MATH  Google Scholar 

  5. Pan, Q.K., Suganthan, P.N., Tasgetiren, M.F., Liang, J.J.: A self-adaptive global best harmony search algorithm for continuous optimization problems. Appl. Math. Comput. 216(3), 830–848 (2010)

    MathSciNet  MATH  Google Scholar 

  6. Yadav, A., Deep, K.: Shrinking hypersphere based trajectory of particles in PSO. Appl. Math. Comput. 220, 246–267 (2013)

    MATH  Google Scholar 

  7. Yadav, A., Deep, K.: An efficient co-swarm particle swarm optimization for non-linear constrained optimization. J. Comput. Sci. 5(2), 258–268 (2014)

    Article  Google Scholar 

  8. Yadav, A., Deep, K., Kim, J.H., Nagar, A.K.: Gravitational swarm optimizer for global optimization. Swarm Evol. Comput. 31, 64–89 (2016)

    Article  Google Scholar 

  9. Yadav, A., Yadav, N., Kim, J.H.: A study of harmony search algorithms: exploration and convergence ability. In: Kim, J.H., Geem, Z.W. (eds.) ICHSA2015. AISC, vol. 382, pp. 53–62. Springer, Heidelberg (2016). doi:10.1007/978-3-662-47926-1_6

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Sciences and Humanities, National Institute of Technology Uttarakhand, Srinagar (Garhwal), India

    Anupam Yadav

  2. Department of Civil, Environmental and Architectural Engineering, Korea University, Seoul, 02841, South Korea

    Neha Yadav & Joong Hoon Kim

Authors
  1. Anupam Yadav
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Neha Yadav
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joong Hoon Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joong Hoon Kim .

Editor information

Editors and Affiliations

  1. TECNALIA, University of the Basque Country ‎(UPV/EHU), Basque Center for Applied Mathematics (BCAM‎), Bilbao, Spain

    Javier Del Ser

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Yadav, A., Yadav, N., Kim, J.H. (2017). A Comparative Study of Exploration Ability of Harmony Search Algorithms. In: Del Ser, J. (eds) Harmony Search Algorithm. ICHSA 2017. Advances in Intelligent Systems and Computing, vol 514. Springer, Singapore. https://doi.org/10.1007/978-981-10-3728-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3728-3_4

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3727-6

  • Online ISBN: 978-981-10-3728-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation