A new parallelization scheme for harmony search algorithm

Donghwi Jung, Jiho Choi, Young Hwan Choi, Joong Hoon Kim

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

2 Citations (Scopus)

Abstract

During the last two decades, parallel computing has drawn attention as an alternative to lessen computational burden in the engineering domain. Parallel computing has also been adopted for meta-heuristic optimization algorithms which generally require large number of functional evaluations because of their random nature of search. However, traditional parallel approaches, which distribute and perform fitness calculations concurrently on the processing units, are not intended to improve the quality of solution but to shorten CPU computation time. In this study, we propose a new parallelization scheme to improve the effectiveness and efficiency of harmony search. Four harmony searches are simultaneously run on the processors in a work station, sharing search information (e.g., a good solution) at the predefined iteration intervals. The proposed parallel HS is demonstrated through the optimization of an engineering planning problem.

Original languageEnglish
Title of host publicationAdvances in Intelligent Systems and Computing
PublisherSpringer Verlag
Pages147-152
Number of pages6
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

Fingerprint

Parallel processing systems
Program processors
Planning
Processing

Keywords

  • Engineering planning problem
  • Harmony search
  • Parallel computing
  • Processing unit
  • Solution quality

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

Cite this

Jung, D., Choi, J., Choi, Y. H., & Kim, J. H. (2016). A new parallelization scheme for harmony search algorithm. In Advances in Intelligent Systems and Computing (Vol. 382, pp. 147-152). (Advances in Intelligent Systems and Computing; Vol. 382). Springer Verlag. https://doi.org/10.1007/978-3-662-47926-1_15

A new parallelization scheme for harmony search algorithm. / Jung, Donghwi; Choi, Jiho; Choi, Young Hwan; Kim, Joong Hoon.

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

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

Jung, D, Choi, J, Choi, YH & Kim, JH 2016, A new parallelization scheme for harmony search algorithm. in Advances in Intelligent Systems and Computing. vol. 382, Advances in Intelligent Systems and Computing, vol. 382, Springer Verlag, pp. 147-152, 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_15
Jung D, Choi J, Choi YH, Kim JH. A new parallelization scheme for harmony search algorithm. In Advances in Intelligent Systems and Computing. Vol. 382. Springer Verlag. 2016. p. 147-152. (Advances in Intelligent Systems and Computing). https://doi.org/10.1007/978-3-662-47926-1_15
Jung, Donghwi ; Choi, Jiho ; Choi, Young Hwan ; Kim, Joong Hoon. / A new parallelization scheme for harmony search algorithm. Advances in Intelligent Systems and Computing. Vol. 382 Springer Verlag, 2016. pp. 147-152 (Advances in Intelligent Systems and Computing).
@inproceedings{abb1adc05ad040e289f8466f36c1de86,
title = "A new parallelization scheme for harmony search algorithm",
abstract = "During the last two decades, parallel computing has drawn attention as an alternative to lessen computational burden in the engineering domain. Parallel computing has also been adopted for meta-heuristic optimization algorithms which generally require large number of functional evaluations because of their random nature of search. However, traditional parallel approaches, which distribute and perform fitness calculations concurrently on the processing units, are not intended to improve the quality of solution but to shorten CPU computation time. In this study, we propose a new parallelization scheme to improve the effectiveness and efficiency of harmony search. Four harmony searches are simultaneously run on the processors in a work station, sharing search information (e.g., a good solution) at the predefined iteration intervals. The proposed parallel HS is demonstrated through the optimization of an engineering planning problem.",
keywords = "Engineering planning problem, Harmony search, Parallel computing, Processing unit, Solution quality",
author = "Donghwi Jung and Jiho Choi and Choi, {Young Hwan} and Kim, {Joong Hoon}",
year = "2016",
doi = "10.1007/978-3-662-47926-1_15",
language = "English",
isbn = "9783662479254",
volume = "382",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer Verlag",
pages = "147--152",
booktitle = "Advances in Intelligent Systems and Computing",

}

TY - GEN

T1 - A new parallelization scheme for harmony search algorithm

AU - Jung, Donghwi

AU - Choi, Jiho

AU - Choi, Young Hwan

AU - Kim, Joong Hoon

PY - 2016

Y1 - 2016

N2 - During the last two decades, parallel computing has drawn attention as an alternative to lessen computational burden in the engineering domain. Parallel computing has also been adopted for meta-heuristic optimization algorithms which generally require large number of functional evaluations because of their random nature of search. However, traditional parallel approaches, which distribute and perform fitness calculations concurrently on the processing units, are not intended to improve the quality of solution but to shorten CPU computation time. In this study, we propose a new parallelization scheme to improve the effectiveness and efficiency of harmony search. Four harmony searches are simultaneously run on the processors in a work station, sharing search information (e.g., a good solution) at the predefined iteration intervals. The proposed parallel HS is demonstrated through the optimization of an engineering planning problem.

AB - During the last two decades, parallel computing has drawn attention as an alternative to lessen computational burden in the engineering domain. Parallel computing has also been adopted for meta-heuristic optimization algorithms which generally require large number of functional evaluations because of their random nature of search. However, traditional parallel approaches, which distribute and perform fitness calculations concurrently on the processing units, are not intended to improve the quality of solution but to shorten CPU computation time. In this study, we propose a new parallelization scheme to improve the effectiveness and efficiency of harmony search. Four harmony searches are simultaneously run on the processors in a work station, sharing search information (e.g., a good solution) at the predefined iteration intervals. The proposed parallel HS is demonstrated through the optimization of an engineering planning problem.

KW - Engineering planning problem

KW - Harmony search

KW - Parallel computing

KW - Processing unit

KW - Solution quality

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

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

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

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

M3 - Conference contribution

AN - SCOPUS:84946762022

SN - 9783662479254

VL - 382

T3 - Advances in Intelligent Systems and Computing

SP - 147

EP - 152

BT - Advances in Intelligent Systems and Computing

PB - Springer Verlag

ER -