A comparative study of exploration ability of harmony search algorithms

Anupam Yadav, Neha Yadav, Joong Hoon Kim

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

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationHarmony Search Algorithm - Proceedings of the 3rd International Conference on Harmony Search Algorithm (ICHSA 2017)
PublisherSpringer Verlag
Pages22-31
Number of pages10
Volume514
ISBN (Print)9789811037276
DOIs
Publication statusPublished - 2017
EventProceedings of the 3rd International Conference on Harmony Search Algorithm, ICHSA 2017 - Bilbao, Spain
Duration: 2017 Feb 222017 Feb 24

Publication series

NameAdvances in Intelligent Systems and Computing
Volume514
ISSN (Print)21945357

Other

OtherProceedings of the 3rd International Conference on Harmony Search Algorithm, ICHSA 2017
Country/TerritorySpain
CityBilbao
Period17/2/2217/2/24

Keywords

  • Exploration
  • Harmony search
  • Variance

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

Cite this