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

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
CountrySpain
CityBilbao
Period17/2/2217/2/24

Keywords

  • Exploration
  • Harmony search
  • Variance

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

Cite this

Yadav, A., Yadav, N., & Kim, J. H. (2017). A comparative study of exploration ability of harmony search algorithms. In Harmony Search Algorithm - Proceedings of the 3rd International Conference on Harmony Search Algorithm (ICHSA 2017) (Vol. 514, pp. 22-31). (Advances in Intelligent Systems and Computing; Vol. 514). Springer Verlag. https://doi.org/10.1007/978-981-10-3728-3_4

A comparative study of exploration ability of harmony search algorithms. / Yadav, Anupam; Yadav, Neha; Kim, Joong Hoon.

Harmony Search Algorithm - Proceedings of the 3rd International Conference on Harmony Search Algorithm (ICHSA 2017). Vol. 514 Springer Verlag, 2017. p. 22-31 (Advances in Intelligent Systems and Computing; Vol. 514).

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

Yadav, A, Yadav, N & Kim, JH 2017, A comparative study of exploration ability of harmony search algorithms. in Harmony Search Algorithm - Proceedings of the 3rd International Conference on Harmony Search Algorithm (ICHSA 2017). vol. 514, Advances in Intelligent Systems and Computing, vol. 514, Springer Verlag, pp. 22-31, Proceedings of the 3rd International Conference on Harmony Search Algorithm, ICHSA 2017, Bilbao, Spain, 17/2/22. https://doi.org/10.1007/978-981-10-3728-3_4
Yadav A, Yadav N, Kim JH. A comparative study of exploration ability of harmony search algorithms. In Harmony Search Algorithm - Proceedings of the 3rd International Conference on Harmony Search Algorithm (ICHSA 2017). Vol. 514. Springer Verlag. 2017. p. 22-31. (Advances in Intelligent Systems and Computing). https://doi.org/10.1007/978-981-10-3728-3_4
Yadav, Anupam ; Yadav, Neha ; Kim, Joong Hoon. / A comparative study of exploration ability of harmony search algorithms. Harmony Search Algorithm - Proceedings of the 3rd International Conference on Harmony Search Algorithm (ICHSA 2017). Vol. 514 Springer Verlag, 2017. pp. 22-31 (Advances in Intelligent Systems and Computing).
@inproceedings{929bc5efe95d44adbedfda7d8f10cdca,
title = "A comparative study of exploration ability of harmony search algorithms",
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.",
keywords = "Exploration, Harmony search, Variance",
author = "Anupam Yadav and Neha Yadav and Kim, {Joong Hoon}",
year = "2017",
doi = "10.1007/978-981-10-3728-3_4",
language = "English",
isbn = "9789811037276",
volume = "514",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer Verlag",
pages = "22--31",
booktitle = "Harmony Search Algorithm - Proceedings of the 3rd International Conference on Harmony Search Algorithm (ICHSA 2017)",

}

TY - GEN

T1 - A comparative study of exploration ability of harmony search algorithms

AU - Yadav, Anupam

AU - Yadav, Neha

AU - Kim, Joong Hoon

PY - 2017

Y1 - 2017

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

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

KW - Exploration

KW - Harmony search

KW - Variance

UR - http://www.scopus.com/inward/record.url?scp=85012157808&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85012157808&partnerID=8YFLogxK

U2 - 10.1007/978-981-10-3728-3_4

DO - 10.1007/978-981-10-3728-3_4

M3 - Conference contribution

AN - SCOPUS:85012157808

SN - 9789811037276

VL - 514

T3 - Advances in Intelligent Systems and Computing

SP - 22

EP - 31

BT - Harmony Search Algorithm - Proceedings of the 3rd International Conference on Harmony Search Algorithm (ICHSA 2017)

PB - Springer Verlag

ER -