@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)",
note = "Proceedings of the 3rd International Conference on Harmony Search Algorithm, ICHSA 2017 ; Conference date: 22-02-2017 Through 24-02-2017",
}