An analysis of selection methods in memory consideration for harmony search

被引:28
作者
Al-Betar, Mohammed Azmi [1 ,2 ]
Khader, Ahamad Tajudin [1 ]
Geem, Zong Woo [3 ]
Abu Doush, Iyad [4 ]
Awadallah, Mohammed A. [1 ]
机构
[1] Univ Sains Malaysia, Sch Comp Sci, George Town 11800, Malaysia
[2] Jadara Univ, Dept Comp Sci, Irbid 733, Jordan
[3] Gachon Univ, Dept Energy IT, Songnam, South Korea
[4] Yarmouk Univ, Dept Comp Sci, Irbid, Jordan
关键词
Harmony search; Selection methods; Evolutionary algorithms; Selection pressure; GENETIC ALGORITHMS; OPTIMIZATION; SCHEMES;
D O I
10.1016/j.amc.2013.04.053
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This paper presents an analysis of some selection methods used in memory consideration of Harmony search (HS) Algorithm. The selection process in memory consideration entails selecting the value of the decision variable from any solution in the Harmony memory (HM). Quite recently, there has been a tendency to adopt novel selection methods that mimic the natural phenomena of the 'survival of the fittest' to replace the random selection method in memory consideration. Consequently, the value of decision variable selected using memory consideration is chosen from the higher promising solutions in HM. The adopted selection methods include: proportional, tournament, linear rank, and exponential rank. It has been demonstrated that experimenting with any of these methods in memory consideration directly affects the performance of HS. However, the success of these methods is based on choosing the optimal parameter value of each. The wrong parameter settings might affect the balance between exploration and exploitation of the search space. Accordingly, this paper studies the effect of the selection method parameters in order to show their effect on HS behavior. The evaluation is conducted using standard mathematical functions used in the literature for HS adoptions. The results suggest that the optimal setting of the selection method parameters is crucial to improve the HS performance. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:10753 / 10767
页数:15
相关论文
共 41 条
[1]   Broadcast scheduling in packet radio networks using Harmony Search algorithm [J].
Ahmad, Imtiaz ;
Mohammad, Mohammad Gh ;
Salman, Ayed A. ;
Hamdan, Suha A. .
EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (01) :1526-1535
[2]  
Al-Betar MA, 2010, GECCO 10
[3]   University Course Timetabling Using a Hybrid Harmony Search Metaheuristic Algorithm [J].
Al-Betar, Mohammed Azmi ;
Khader, Ahamad Tajudin ;
Zaman, Munir .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2012, 42 (05) :664-681
[4]   A harmony search algorithm for university course timetabling [J].
Al-Betar, Mohammed Azmi ;
Khader, Ahamad Tajudin .
ANNALS OF OPERATIONS RESEARCH, 2012, 194 (01) :3-31
[5]   Novel selection schemes for harmony search [J].
Al-Betar, Mohammed Azmi ;
Abu Doush, Iyad ;
Khader, Ahamad Tajudin ;
Awadallah, Mohammed A. .
APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (10) :6095-6117
[6]  
Al-Betar MA, 2010, STUD COMPUT INTELL, V270, P147
[7]   The variants of the harmony search algorithm: an overview [J].
Alia, Osama Moh'd ;
Mandava, Rajeswari .
ARTIFICIAL INTELLIGENCE REVIEW, 2011, 36 (01) :49-68
[8]  
Back T., 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence (Cat. No.94TH0650-2), P57, DOI 10.1109/ICEC.1994.350042
[9]  
Back Thomas, 1996, EVOLUTIONARY ALGORIT
[10]  
Baker J.E., 1985, Proceedings of the First International Conference on Genetic Algorithms and Their Applications, P101