4-Rule Harmony Search Algorithm for Solving Computationally Expensive Optimization Test Problems

Ali Sadollah; Joong Hoon Kim; Young Hwan Choi; Negar Karamoddin

doi:10.1007/978-3-030-31967-0_23

4-Rule Harmony Search Algorithm for Solving Computationally Expensive Optimization Test Problems

Ali Sadollah, Joong Hoon Kim, Young Hwan Choi, Negar Karamoddin

School of Civil, Environmental and Architectural Engineering

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

Abstract

This paper proposes an enhanced harmony search algorithm for solving computationally expensive benchmarks widely used in the literature. We explored the potential and applicability of the original harmony search (HS) algorithm through introducing an extended version of the algorithm integrated with a new dynamic search equation enabling the algorithm to take guided larger steps at the beginning of the search. In the 4-Rule Harmony Search (4RHS), an extra rule is added to the standard HS without adding any user parameters to existing initial parameters. The 4RHS algorithm is then tested through optimal solving of different well-known and well-used benchmarks from classical to so CEC’ 2015 series, where the results of the 4RHS are compared with simple and improved version of HS algorithms as well as other optimization techniques. The obtained optimization results show the attractiveness of the added rule into the standard HS.

Original language	English
Title of host publication	Advances in Harmony Search, Soft Computing and Applications, ICHSA 2019
Editors	Joong Hoon Kim, Zong Woo Geem, Donghwi Jung, Do Guen Yoo, Anupam Yadav
Publisher	Springer
Pages	202-209
Number of pages	8
ISBN (Print)	9783030319663
DOIs	https://doi.org/10.1007/978-3-030-31967-0_23
Publication status	Published - 2020
Event	5th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2019 - Kunming, China Duration: 2019 Jul 20 → 2019 Jul 22

Publication series

Name	Advances in Intelligent Systems and Computing
Volume	1063
ISSN (Print)	2194-5357
ISSN (Electronic)	2194-5365

Conference

Conference	5th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2019
Country/Territory	China
City	Kunming
Period	19/7/20 → 19/7/22

Keywords

4-Rule harmony search
Benchmark
Computationally expensive
Harmony search
Optimal design

ASJC Scopus subject areas

Control and Systems Engineering
Computer Science(all)

Access to Document

10.1007/978-3-030-31967-0_23

Cite this

Sadollah, A., Kim, J. H., Choi, Y. H., & Karamoddin, N. (2020). 4-Rule Harmony Search Algorithm for Solving Computationally Expensive Optimization Test Problems. In J. H. Kim, Z. W. Geem, D. Jung, D. G. Yoo, & A. Yadav (Eds.), Advances in Harmony Search, Soft Computing and Applications, ICHSA 2019 (pp. 202-209). (Advances in Intelligent Systems and Computing; Vol. 1063). Springer. https://doi.org/10.1007/978-3-030-31967-0_23

4-Rule Harmony Search Algorithm for Solving Computationally Expensive Optimization Test Problems. / Sadollah, Ali; Kim, Joong Hoon; Choi, Young Hwan et al.

Advances in Harmony Search, Soft Computing and Applications, ICHSA 2019. ed. / Joong Hoon Kim; Zong Woo Geem; Donghwi Jung; Do Guen Yoo; Anupam Yadav. Springer, 2020. p. 202-209 (Advances in Intelligent Systems and Computing; Vol. 1063).

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

Sadollah, A, Kim, JH, Choi, YH & Karamoddin, N 2020, 4-Rule Harmony Search Algorithm for Solving Computationally Expensive Optimization Test Problems. in JH Kim, ZW Geem, D Jung, DG Yoo & A Yadav (eds), Advances in Harmony Search, Soft Computing and Applications, ICHSA 2019. Advances in Intelligent Systems and Computing, vol. 1063, Springer, pp. 202-209, 5th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2019, Kunming, China, 19/7/20. https://doi.org/10.1007/978-3-030-31967-0_23

Sadollah A, Kim JH, Choi YH, Karamoddin N. 4-Rule Harmony Search Algorithm for Solving Computationally Expensive Optimization Test Problems. In Kim JH, Geem ZW, Jung D, Yoo DG, Yadav A, editors, Advances in Harmony Search, Soft Computing and Applications, ICHSA 2019. Springer. 2020. p. 202-209. (Advances in Intelligent Systems and Computing). doi: 10.1007/978-3-030-31967-0_23

Sadollah, Ali ; Kim, Joong Hoon ; Choi, Young Hwan et al. / 4-Rule Harmony Search Algorithm for Solving Computationally Expensive Optimization Test Problems. Advances in Harmony Search, Soft Computing and Applications, ICHSA 2019. editor / Joong Hoon Kim ; Zong Woo Geem ; Donghwi Jung ; Do Guen Yoo ; Anupam Yadav. Springer, 2020. pp. 202-209 (Advances in Intelligent Systems and Computing).

@inproceedings{af6930f230244bc5af9ef3bc38327537,

title = "4-Rule Harmony Search Algorithm for Solving Computationally Expensive Optimization Test Problems",

abstract = "This paper proposes an enhanced harmony search algorithm for solving computationally expensive benchmarks widely used in the literature. We explored the potential and applicability of the original harmony search (HS) algorithm through introducing an extended version of the algorithm integrated with a new dynamic search equation enabling the algorithm to take guided larger steps at the beginning of the search. In the 4-Rule Harmony Search (4RHS), an extra rule is added to the standard HS without adding any user parameters to existing initial parameters. The 4RHS algorithm is then tested through optimal solving of different well-known and well-used benchmarks from classical to so CEC{\textquoteright} 2015 series, where the results of the 4RHS are compared with simple and improved version of HS algorithms as well as other optimization techniques. The obtained optimization results show the attractiveness of the added rule into the standard HS.",

keywords = "4-Rule harmony search, Benchmark, Computationally expensive, Harmony search, Optimal design",

author = "Ali Sadollah and Kim, {Joong Hoon} and Choi, {Young Hwan} and Negar Karamoddin",

note = "Funding Information: Acknowledgement. This work was supported by the National Research Foundation (NRF) of Korea under a grant funded by the Korean government (MSIP) (NRF-2019R1A2B5B03069810). Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 5th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2019 ; Conference date: 20-07-2019 Through 22-07-2019",

year = "2020",

doi = "10.1007/978-3-030-31967-0_23",

language = "English",

isbn = "9783030319663",

series = "Advances in Intelligent Systems and Computing",

publisher = "Springer",

pages = "202--209",

editor = "Kim, {Joong Hoon} and Geem, {Zong Woo} and Donghwi Jung and Yoo, {Do Guen} and Anupam Yadav",

booktitle = "Advances in Harmony Search, Soft Computing and Applications, ICHSA 2019",

}

TY - GEN

T1 - 4-Rule Harmony Search Algorithm for Solving Computationally Expensive Optimization Test Problems

AU - Sadollah, Ali

AU - Kim, Joong Hoon

AU - Choi, Young Hwan

AU - Karamoddin, Negar

N1 - Funding Information: Acknowledgement. This work was supported by the National Research Foundation (NRF) of Korea under a grant funded by the Korean government (MSIP) (NRF-2019R1A2B5B03069810). Publisher Copyright: © 2020, Springer Nature Switzerland AG.

PY - 2020

Y1 - 2020

N2 - This paper proposes an enhanced harmony search algorithm for solving computationally expensive benchmarks widely used in the literature. We explored the potential and applicability of the original harmony search (HS) algorithm through introducing an extended version of the algorithm integrated with a new dynamic search equation enabling the algorithm to take guided larger steps at the beginning of the search. In the 4-Rule Harmony Search (4RHS), an extra rule is added to the standard HS without adding any user parameters to existing initial parameters. The 4RHS algorithm is then tested through optimal solving of different well-known and well-used benchmarks from classical to so CEC’ 2015 series, where the results of the 4RHS are compared with simple and improved version of HS algorithms as well as other optimization techniques. The obtained optimization results show the attractiveness of the added rule into the standard HS.

AB - This paper proposes an enhanced harmony search algorithm for solving computationally expensive benchmarks widely used in the literature. We explored the potential and applicability of the original harmony search (HS) algorithm through introducing an extended version of the algorithm integrated with a new dynamic search equation enabling the algorithm to take guided larger steps at the beginning of the search. In the 4-Rule Harmony Search (4RHS), an extra rule is added to the standard HS without adding any user parameters to existing initial parameters. The 4RHS algorithm is then tested through optimal solving of different well-known and well-used benchmarks from classical to so CEC’ 2015 series, where the results of the 4RHS are compared with simple and improved version of HS algorithms as well as other optimization techniques. The obtained optimization results show the attractiveness of the added rule into the standard HS.

KW - 4-Rule harmony search

KW - Benchmark

KW - Computationally expensive

KW - Harmony search

KW - Optimal design

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

U2 - 10.1007/978-3-030-31967-0_23

DO - 10.1007/978-3-030-31967-0_23

M3 - Conference contribution

AN - SCOPUS:85076091197

SN - 9783030319663

T3 - Advances in Intelligent Systems and Computing

SP - 202

EP - 209

BT - Advances in Harmony Search, Soft Computing and Applications, ICHSA 2019

A2 - Kim, Joong Hoon

A2 - Geem, Zong Woo

A2 - Jung, Donghwi

A2 - Yoo, Do Guen

A2 - Yadav, Anupam

PB - Springer

T2 - 5th International Conference on Harmony Search, Soft Computing and Applications, ICHSA 2019

Y2 - 20 July 2019 through 22 July 2019

ER -

4-Rule Harmony Search Algorithm for Solving Computationally Expensive Optimization Test Problems

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this