Please use this identifier to cite or link to this item:
|Title:||An Intelligent Tuned Harmony Search algorithm for optimisation||Authors:||Yadav, P.
|Keywords:||Harmony Search (HS)
|Issue Date:||2012||Citation:||Yadav, P., Kumar, R., Panda, S.K., Chang, C.S. (2012). An Intelligent Tuned Harmony Search algorithm for optimisation. Information Sciences 196 : 47-72. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ins.2011.12.035||Abstract:||The Harmony Search (HS) algorithm is a population-based metaheuristic optimisation algorithm. This algorithm is inspired by the music improvisation process in which the musician searches for harmony and continues to polish the pitches to obtain a better harmony. Although several variants of the HS algorithm have been proposed, their effectiveness in dealing with diverse problems is still unsatisfactory. The performances of these variants mainly depend on the selection of different parameters of the algorithm. In this paper, a new variant of the HS algorithm is proposed that maintains a proper balance between diversification and intensification throughout the search process by automatically selecting the proper pitch adjustment strategy based on its Harmony Memory. However, the performance of the proposed Intelligent Tuned Harmony Search (ITHS) algorithm is influenced by other parameters, such as the Harmony Memory Size (HMS) and the Harmony Memory Considering Rate (HMCR). The effects that varying these parameters have on the performance of the ITHS algorithm is also analysed in detail. The performance of the proposed ITHS algorithm is investigated and compared with eight state-of-the-art HS variants over 17 benchmark functions. Furthermore, to investigate the robustness of the proposed algorithm at higher dimensions, a scalability study is also performed. Finally, the numerical results obtained reflect the superiority of the proposed ITHS algorithm in terms of accuracy, convergence speed, and robustness when compared with other state-of-the-art HS variants. © 2012 Elsevier Inc. All rights reserved.||Source Title:||Information Sciences||URI:||http://scholarbank.nus.edu.sg/handle/10635/55037||ISSN:||00200255||DOI:||10.1016/j.ins.2011.12.035|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 17, 2019
WEB OF SCIENCETM
checked on Jun 17, 2019
checked on May 24, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.