A study of harmony search algorithms: Exploration and convergence ability

Anupam Yadav, Neha Yadav, Joong Hoon Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationAdvances in Intelligent Systems and Computing
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783662479254
Publication statusPublished - 2016
Event2nd International Conference on Harmony Search Algorithm, ICHSA 2015 - Seoul, Korea, Republic of
Duration: 2015 Aug 192015 Aug 21

Publication series

NameAdvances in Intelligent Systems and Computing
ISSN (Print)21945357


Other2nd International Conference on Harmony Search Algorithm, ICHSA 2015
Country/TerritoryKorea, Republic of


  • Convergence
  • Exploration
  • Harmony search

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

Cite this