Skip to main content

Investigating the Convergence Characteristics of Harmony Search

  • Conference paper
  • First Online:
Harmony Search Algorithm

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

Abstract

Harmony Search optimization algorithm has become popular in many fields of engineering research and practice during the last decade. This paper introduces three major rules of the algorithm: harmony memory considering (HMC) rule, random selecting (RS) rule, and pitch adjusting (PA) rule, and shows the effect of each rule on the algorithm performance. Application of example benchmark function proves that each rule has its own role in the exploration and exploitation processes of the search. Good balance between the two processes is very important, and the PA rule can be a key factor for the balance if used intelligently.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Moh’d Alia, O., Mandava, R.: The variants of the harmony search algorithm: an overview. Artificial Intelligence Review 36(1), 49–68 (2011)

    Article  Google Scholar 

  2. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys (CSUR) 35(3), 268–308 (2003)

    Article  Google Scholar 

  3. Blum, C., Roli, A.: Hybrid metaheuristics: an introduction. In: Blum, C., Aguilera, M.J.B., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics, vol. 114, pp. 1–30. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. 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 

  5. Kim, J.H., Geem, Z.W., Kim, E.S.: Parameter estimation of the nonlinear Muskingum model using harmony search. Journal of the American Water Resources Association 37(5), 1131–1138 (2001)

    Article  Google Scholar 

  6. Geem, Z.W.: Music-inspired Harmony Search Algorithm: Theory and Applications. Springer (2009)

    Google Scholar 

  7. Ahangaran, M., Ramesani, P.: Harmony search algorithm: strengths and weaknesses. Journal of Computer Engineering and Information Technology (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Joong Hoon Kim .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, J.H., Lee, H.M., Yoo, D.G. (2016). Investigating the Convergence Characteristics of Harmony Search. In: Kim, J., Geem, Z. (eds) Harmony Search Algorithm. Advances in Intelligent Systems and Computing, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47926-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47926-1_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47925-4

  • Online ISBN: 978-3-662-47926-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics