Hybridizing Harmony Search algorithm with different mutation operators for continuous problems

详细信息    查看全文

• 作者：Basima Hani F. Hasan ; Iyad Abu Doush ; ^{eyad_win@yahoo.com" class="auth_mail} ; Eslam Al Maghayreh ; Faisal Alkhateeb ; Mohammad Hamdan
• 关键词：Harmony Search algorithm ; Evolutionary Algorithms ; Mutation ; Meta-heuristic algorithm ; Polynomial mutation
• 刊名：Applied Mathematics and Computation
• 出版年：1 April, 2014
• 年：2014
• 卷：232
• 期：Complete
• 页码：1166-1182
• 全文大小：2313 K

文摘

Harmony Search (HS) is a recent EA inspired by musical improvisation process to seek a pleasing harmony. Mutation is a vital component used in Evolutionary Algorithms (EA) where a value in the population is randomly selected to be altered to improve the evolution process. The original HS algorithm applies an operation similar to mutation during the random consideration operator. During random selection operator a value within the range of the decision variable is selected randomly to explore different areas in the search space. This paper aims at experimentally evaluating the performance of HS algorithm after replacing the random consideration operator in the original HS with five different mutation methods. The different variations of HS are experimented on standard benchmark functions in terms of final obtained solution and convergence speed. The results show that using polynomial mutation improves the performance of the HS algorithm for most of the used functions.