Skip to main content
SpringerLink
Log in

A Study of Harmony Search Algorithms: Exploration and Convergence Ability

  • Conference paper
  • First Online:
Harmony Search Algorithm

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

Abstract

Harmony Search Algorithm (HSA) has shown to be simple, efficient and strong optimization algorithm. The exploration ability of any optimization algorithm is one of the key points. In this article a new methodology is proposed to measure the exploration ability of the HS algorithm. To understand the searching ability potential exploration range for HS algorithm is designed. Four HS variants are selected and their searching ability is tested based on the choice of improvised harmony. An empirical analysis of the proposed method is tested along with the justification of theoretical findings and experimental results.

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

  2. Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Applied Mathematics and Computation 188(2), 1567–1579 (2007)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Wang, C.M., Huang, Y.F.: Self-adaptive harmony search algorithm for optimization. Expert Systems with Applications 37(4), 2826–2837 (2010)

    Article  Google Scholar 

  5. Mahamed, G.H.O., Mahdavi, M.: Global-best harmony search. Applied Mathematics and Computation 198(2), 643–656 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  6. Lee, K.S., Geem, Z.W.: A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Computer Methods in Applied Mechanics and Engineering 194(36), 3902–3933 (2005)

    Article  MATH  Google Scholar 

  7. 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 Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 41(1), 89–106 (2011)

    Article  Google Scholar 

  8. Fesanghary, M., Mahdavi, M., Jolandan, M.M., Alizadeh, Y.: Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems. Computer Methods in Applied Mechanics and Engineering 197(33), 3080–3091 (2008)

    Article  MATH  Google Scholar 

  9. Wang, L., Pan, Q.K., Tasgetiren, M.F.: A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem. Computers & Industrial Engineering 61(1), 76–83 (2011)

    Article  Google Scholar 

  10. Wang, L.: An improved adaptive binary harmony search algorithm. Information Sciences 232, 58–87 (2013)

    Article  MathSciNet  Google Scholar 

  11. Wang, L., Pan, Q.K., Tasgetiren, M.F.: Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms. Expert Systems with Applications 37(12), 7929–7936 (2010)

    Article  Google Scholar 

  12. Zou, D., Gao, L., Wu, J., Li, S.: Novel global harmony search algorithm for unconstrained problems. Neurocomputing 73(16), 3308–3318 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Sciences and Humanities National Institute of Technology Uttarakhand, Srinagar, 246-174, Uttarakhand, India

    Anupam Yadav

  2. School of Civil, Environmental and Architectural Engineering, Korea University, Seoul, 136-713, 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 Anupam Yadav .

Editor information

Editors and Affiliations

  1. Civil, Environmental and Architectural Engineering, Korea University, Seoul, Korea (Republic of)

    Joong Hoon Kim

  2. Energy IT, Gachon University, Seongnam-Si, Korea (Republic of)

    Zong Woo Geem

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yadav, A., Yadav, N., Kim, J.H. (2016). A Study of Harmony Search Algorithms: Exploration and Convergence Ability. 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_6

Download citation

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

  • 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

Search

Navigation