Comparison of parameter-setting-free and self-adaptive harmony search

Young Hwan Choi; Sajjad Eghdami; Thi Thuy Ngo; Sachchida Nand Chaurasia; Joong Hoon Kim

doi:10.1007/978-981-13-0761-4_11

Comparison of parameter-setting-free and self-adaptive harmony search

Young Hwan Choi, Sajjad Eghdami, Thi Thuy Ngo, Sachchida Nand Chaurasia, Joong Hoon Kim

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

This study compares the performance of all parameter-setting-free and self-adaptive harmony search algorithms proposed in the previous studies, which do not ask for the user to set the algorithm parameter values. Those algorithms are parameter-setting-free harmony search, Almost-parameter-free harmony search, novel self-adaptive harmony search, self-adaptive global-based harmony search algorithm, parameter adaptive harmony search, and adaptive harmony search, each of which has a distinctively different mechanism to adaptively control the parameters over iterations. Conventional mathematical benchmark problems of various dimensions and characteristics and water distribution network design problems are used for the comparison. The best, worst, and average values of final solutions are used as performance indices. Computational results show that the performance of each algorithm has a different performance indicator depending on the characteristics of optimization problems such as search space size. Conclusions derived in this study are expected to be beneficial to future research works on the development of a new optimization algorithm with adaptive parameter control. It can be considered to improve the algorithm performance based on the problem’s characteristic in a much simpler way.

Original language	English
Title of host publication	Harmony Search and Nature Inspired Optimization Algorithms - Theory and Applications, ICHSA 2018
Editors	Jagdish Chand Bansal, Joong Hoon Kim, Anupam Yadav, Kusum Deep, Neha Yadav
Publisher	Springer Verlag
Pages	105-112
Number of pages	8
ISBN (Print)	9789811307607
DOIs	https://doi.org/10.1007/978-981-13-0761-4_11
Publication status	Published - 2019
Event	4th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2018 - Gurgaon, India Duration: 2018 Feb 7 → 2018 Feb 9

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	741
ISSN (Print)	2194-5357

Conference

Conference	4th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2018
Country/Territory	India
City	Gurgaon
Period	18/2/7 → 18/2/9

Bibliographical note

Funding Information:
This work was supported by a grant from The National Research Foundation (NRF) of Korea, funded by the Korean government (MSIP) (No. 2016R1A2A1A05005306).

Funding Information:
Acknowledgements This work was supported by a grant from The National Research Foundation (NRF) of Korea, funded by the Korean government (MSIP) (No. 2016R1A2A1A05005306).

Publisher Copyright:
© Springer Nature Singapore Pte Ltd. 2019.

Keywords

Harmony search
Parameter-setting-free
Self-adaptive

ASJC Scopus subject areas

Control and Systems Engineering
General Computer Science

Access to Document

10.1007/978-981-13-0761-4_11

Cite this

Choi, Y. H., Eghdami, S., Ngo, T. T., Chaurasia, S. N., & Kim, J. H. (2019). Comparison of parameter-setting-free and self-adaptive harmony search. In J. C. Bansal, J. H. Kim, A. Yadav, K. Deep, & N. Yadav (Eds.), Harmony Search and Nature Inspired Optimization Algorithms - Theory and Applications, ICHSA 2018 (pp. 105-112). (Advances in Intelligent Systems and Computing; Vol. 741). Springer Verlag. https://doi.org/10.1007/978-981-13-0761-4_11

Comparison of parameter-setting-free and self-adaptive harmony search. / Choi, Young Hwan; Eghdami, Sajjad; Ngo, Thi Thuy et al.
Harmony Search and Nature Inspired Optimization Algorithms - Theory and Applications, ICHSA 2018. ed. / Jagdish Chand Bansal; Joong Hoon Kim; Anupam Yadav; Kusum Deep; Neha Yadav. Springer Verlag, 2019. p. 105-112 (Advances in Intelligent Systems and Computing; Vol. 741).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Choi, YH, Eghdami, S, Ngo, TT, Chaurasia, SN & Kim, JH 2019, Comparison of parameter-setting-free and self-adaptive harmony search. in JC Bansal, JH Kim, A Yadav, K Deep & N Yadav (eds), Harmony Search and Nature Inspired Optimization Algorithms - Theory and Applications, ICHSA 2018. Advances in Intelligent Systems and Computing, vol. 741, Springer Verlag, pp. 105-112, 4th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2018, Gurgaon, India, 18/2/7. https://doi.org/10.1007/978-981-13-0761-4_11

Choi YH, Eghdami S, Ngo TT, Chaurasia SN, Kim JH. Comparison of parameter-setting-free and self-adaptive harmony search. In Bansal JC, Kim JH, Yadav A, Deep K, Yadav N, editors, Harmony Search and Nature Inspired Optimization Algorithms - Theory and Applications, ICHSA 2018. Springer Verlag. 2019. p. 105-112. (Advances in Intelligent Systems and Computing). doi: 10.1007/978-981-13-0761-4_11

Choi, Young Hwan ; Eghdami, Sajjad ; Ngo, Thi Thuy et al. / Comparison of parameter-setting-free and self-adaptive harmony search. Harmony Search and Nature Inspired Optimization Algorithms - Theory and Applications, ICHSA 2018. editor / Jagdish Chand Bansal ; Joong Hoon Kim ; Anupam Yadav ; Kusum Deep ; Neha Yadav. Springer Verlag, 2019. pp. 105-112 (Advances in Intelligent Systems and Computing).

@inproceedings{5aeb0d3e19274f9fab3ae19f3d04fdbb,

title = "Comparison of parameter-setting-free and self-adaptive harmony search",

abstract = "This study compares the performance of all parameter-setting-free and self-adaptive harmony search algorithms proposed in the previous studies, which do not ask for the user to set the algorithm parameter values. Those algorithms are parameter-setting-free harmony search, Almost-parameter-free harmony search, novel self-adaptive harmony search, self-adaptive global-based harmony search algorithm, parameter adaptive harmony search, and adaptive harmony search, each of which has a distinctively different mechanism to adaptively control the parameters over iterations. Conventional mathematical benchmark problems of various dimensions and characteristics and water distribution network design problems are used for the comparison. The best, worst, and average values of final solutions are used as performance indices. Computational results show that the performance of each algorithm has a different performance indicator depending on the characteristics of optimization problems such as search space size. Conclusions derived in this study are expected to be beneficial to future research works on the development of a new optimization algorithm with adaptive parameter control. It can be considered to improve the algorithm performance based on the problem{\textquoteright}s characteristic in a much simpler way.",

keywords = "Harmony search, Parameter-setting-free, Self-adaptive",

author = "Choi, {Young Hwan} and Sajjad Eghdami and Ngo, {Thi Thuy} and Chaurasia, {Sachchida Nand} and Kim, {Joong Hoon}",

note = "Funding Information: This work was supported by a grant from The National Research Foundation (NRF) of Korea, funded by the Korean government (MSIP) (No. 2016R1A2A1A05005306). Funding Information: Acknowledgements This work was supported by a grant from The National Research Foundation (NRF) of Korea, funded by the Korean government (MSIP) (No. 2016R1A2A1A05005306). Publisher Copyright: {\textcopyright} Springer Nature Singapore Pte Ltd. 2019.; 4th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2018 ; Conference date: 07-02-2018 Through 09-02-2018",

year = "2019",

doi = "10.1007/978-981-13-0761-4_11",

language = "English",

isbn = "9789811307607",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer Verlag",

pages = "105--112",

editor = "Bansal, {Jagdish Chand} and Kim, {Joong Hoon} and Anupam Yadav and Kusum Deep and Neha Yadav",

booktitle = "Harmony Search and Nature Inspired Optimization Algorithms - Theory and Applications, ICHSA 2018",

}

TY - GEN

T1 - Comparison of parameter-setting-free and self-adaptive harmony search

AU - Choi, Young Hwan

AU - Eghdami, Sajjad

AU - Ngo, Thi Thuy

AU - Chaurasia, Sachchida Nand

AU - Kim, Joong Hoon

N1 - Funding Information: This work was supported by a grant from The National Research Foundation (NRF) of Korea, funded by the Korean government (MSIP) (No. 2016R1A2A1A05005306). Funding Information: Acknowledgements This work was supported by a grant from The National Research Foundation (NRF) of Korea, funded by the Korean government (MSIP) (No. 2016R1A2A1A05005306). Publisher Copyright: © Springer Nature Singapore Pte Ltd. 2019.

PY - 2019

Y1 - 2019

N2 - This study compares the performance of all parameter-setting-free and self-adaptive harmony search algorithms proposed in the previous studies, which do not ask for the user to set the algorithm parameter values. Those algorithms are parameter-setting-free harmony search, Almost-parameter-free harmony search, novel self-adaptive harmony search, self-adaptive global-based harmony search algorithm, parameter adaptive harmony search, and adaptive harmony search, each of which has a distinctively different mechanism to adaptively control the parameters over iterations. Conventional mathematical benchmark problems of various dimensions and characteristics and water distribution network design problems are used for the comparison. The best, worst, and average values of final solutions are used as performance indices. Computational results show that the performance of each algorithm has a different performance indicator depending on the characteristics of optimization problems such as search space size. Conclusions derived in this study are expected to be beneficial to future research works on the development of a new optimization algorithm with adaptive parameter control. It can be considered to improve the algorithm performance based on the problem’s characteristic in a much simpler way.

AB - This study compares the performance of all parameter-setting-free and self-adaptive harmony search algorithms proposed in the previous studies, which do not ask for the user to set the algorithm parameter values. Those algorithms are parameter-setting-free harmony search, Almost-parameter-free harmony search, novel self-adaptive harmony search, self-adaptive global-based harmony search algorithm, parameter adaptive harmony search, and adaptive harmony search, each of which has a distinctively different mechanism to adaptively control the parameters over iterations. Conventional mathematical benchmark problems of various dimensions and characteristics and water distribution network design problems are used for the comparison. The best, worst, and average values of final solutions are used as performance indices. Computational results show that the performance of each algorithm has a different performance indicator depending on the characteristics of optimization problems such as search space size. Conclusions derived in this study are expected to be beneficial to future research works on the development of a new optimization algorithm with adaptive parameter control. It can be considered to improve the algorithm performance based on the problem’s characteristic in a much simpler way.

KW - Harmony search

KW - Parameter-setting-free

KW - Self-adaptive

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

U2 - 10.1007/978-981-13-0761-4_11

DO - 10.1007/978-981-13-0761-4_11

M3 - Conference contribution

AN - SCOPUS:85053264442

SN - 9789811307607

T3 - Advances in Intelligent Systems and Computing

SP - 105

EP - 112

BT - Harmony Search and Nature Inspired Optimization Algorithms - Theory and Applications, ICHSA 2018

A2 - Bansal, Jagdish Chand

A2 - Kim, Joong Hoon

A2 - Yadav, Anupam

A2 - Deep, Kusum

A2 - Yadav, Neha

PB - Springer Verlag

T2 - 4th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2018

Y2 - 7 February 2018 through 9 February 2018

ER -

Comparison of parameter-setting-free and self-adaptive harmony search

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this