A new method for analyzing the performance of the harmony search algorithm
- Authors
- Tuo, S.; Geem, Z.W.; Yoon, J.H.
- Issue Date
- Sep-2020
- Publisher
- MDPI AG
- Keywords
- Harmony search; High-dimensional optimization problem; Take-all strategy; Take-k strategy; Update success rate
- Citation
- Mathematics, v.8, no.9
- Journal Title
- Mathematics
- Volume
- 8
- Number
- 9
- URI
- https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/78813
- DOI
- 10.3390/MATH8091421
- ISSN
- 2227-7390
- Abstract
- A harmony search (HS) algorithm for solving high-dimensional multimodal optimization problems (named DIHS) was proposed in 2015 and showed good performance, in which a dynamic-dimensionality-reduction strategy is employed to maintain a high update success rate of harmony memory (HM). However, an extreme assumption was adopted in the DIHS that is not reasonable, and its analysis for the update success rate is not sufficiently accurate. In this study, we reanalyzed the update success rate of HS and now present a more valid method for analyzing the update success rate of HS. In the new analysis, take-k and take-all strategies that are employed to generate new solutions are compared to the update success rate, and the average convergence rate of algorithms is also analyzed. The experimental results demonstrate that the HS based on the take-k strategy is efficient and effective at solving some complex high-dimensional optimization problems. © 2020 by the authors.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - IT융합대학 > 에너지IT학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/78813)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.