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

6 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAdvances in Intelligent Systems and Computing
PublisherSpringer Verlag
Pages53-62
Number of pages10
Volume382
ISBN (Print)9783662479254
DOIs
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
Volume382
ISSN (Print)21945357

Other

Other2nd International Conference on Harmony Search Algorithm, ICHSA 2015
CountryKorea, Republic of
CitySeoul
Period15/8/1915/8/21

Keywords

  • Convergence
  • Exploration
  • Harmony search

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

Cite this

Yadav, A., Yadav, N., & Kim, J. H. (2016). A study of harmony search algorithms: Exploration and convergence ability. In Advances in Intelligent Systems and Computing (Vol. 382, pp. 53-62). (Advances in Intelligent Systems and Computing; Vol. 382). Springer Verlag. https://doi.org/10.1007/978-3-662-47926-1_6

A study of harmony search algorithms : Exploration and convergence ability. / Yadav, Anupam; Yadav, Neha; Kim, Joong Hoon.

Advances in Intelligent Systems and Computing. Vol. 382 Springer Verlag, 2016. p. 53-62 (Advances in Intelligent Systems and Computing; Vol. 382).

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

Yadav, A, Yadav, N & Kim, JH 2016, A study of harmony search algorithms: Exploration and convergence ability. in Advances in Intelligent Systems and Computing. vol. 382, Advances in Intelligent Systems and Computing, vol. 382, Springer Verlag, pp. 53-62, 2nd International Conference on Harmony Search Algorithm, ICHSA 2015, Seoul, Korea, Republic of, 15/8/19. https://doi.org/10.1007/978-3-662-47926-1_6
Yadav A, Yadav N, Kim JH. A study of harmony search algorithms: Exploration and convergence ability. In Advances in Intelligent Systems and Computing. Vol. 382. Springer Verlag. 2016. p. 53-62. (Advances in Intelligent Systems and Computing). https://doi.org/10.1007/978-3-662-47926-1_6
Yadav, Anupam ; Yadav, Neha ; Kim, Joong Hoon. / A study of harmony search algorithms : Exploration and convergence ability. Advances in Intelligent Systems and Computing. Vol. 382 Springer Verlag, 2016. pp. 53-62 (Advances in Intelligent Systems and Computing).
@inproceedings{1e2dd9c226c84aa899d7cacec5761fa7,
title = "A study of harmony search algorithms: Exploration and convergence ability",
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.",
keywords = "Convergence, Exploration, Harmony search",
author = "Anupam Yadav and Neha Yadav and Kim, {Joong Hoon}",
year = "2016",
doi = "10.1007/978-3-662-47926-1_6",
language = "English",
isbn = "9783662479254",
volume = "382",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer Verlag",
pages = "53--62",
booktitle = "Advances in Intelligent Systems and Computing",

}

TY - GEN

T1 - A study of harmony search algorithms

T2 - Exploration and convergence ability

AU - Yadav, Anupam

AU - Yadav, Neha

AU - Kim, Joong Hoon

PY - 2016

Y1 - 2016

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

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

KW - Convergence

KW - Exploration

KW - Harmony search

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

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

U2 - 10.1007/978-3-662-47926-1_6

DO - 10.1007/978-3-662-47926-1_6

M3 - Conference contribution

SN - 9783662479254

VL - 382

T3 - Advances in Intelligent Systems and Computing

SP - 53

EP - 62

BT - Advances in Intelligent Systems and Computing

PB - Springer Verlag

ER -