A modified Intelligent Water Drops algorithm and its application to optimization problems

被引:48
作者
Alijla, Basem O. [1 ,2 ]
Wong, Li-Pei [1 ]
Lim, Chee Peng [3 ]
Khader, Ahmed Tajudin [1 ]
Al-Betar, Mohammed Azmi [1 ,4 ]
机构
[1] Univ Sains Malaysia, Sch Comp Sci, Pulau Penang, Malaysia
[2] Islamic Univ Gaza, Fac Informat Technol, Gaza, Israel
[3] Deakin Univ, Ctr Intelligent Syst Res, Geelong, Vic 3217, Australia
[4] Al Balqa Appl Univ, Dept Informat Technol, As Salt, Jordan
关键词
Intelligent Water Drops (IWD); Swarm-based optimization; Ranking-based selection methods; Feature selection (FS); Rough set (RS); Multiple knapsack problem (MKP); Travelling salesman problem (TSP); FEATURE-SELECTION; SEARCH;
D O I
10.1016/j.eswa.2014.05.010
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Intelligent Water Drop (IWD) algorithm is a recent stochastic swarm-based method that is useful for solving combinatorial and function optimization problems. In this paper, we investigate the effectiveness of the selection method in the solution construction phase of the IWD algorithm. Instead of the fitness proportionate selection method in the original IWD algorithm, two ranking-based selection methods, namely linear ranking and exponential ranking, are proposed. Both ranking-based selection methods aim to solve the identified limitations of the fitness proportionate selection method as well as to enable the IWD algorithm to escape from local optima and ensure its search diversity. To evaluate the usefulness of the proposed ranking-based selection methods, a series of experiments pertaining to three combinatorial optimization problems, i.e., rough set feature subset selection, multiple knapsack and travelling salesman problems, is conducted. The results demonstrate that the exponential ranking selection method is able to preserve the search diversity, therefore improving the performance of the IWD algorithm. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:6555 / 6569
页数:15
相关论文
共 48 条
[1]  
Abdullah S, 2010, COMM COM INF SC, V118, P189
[2]  
Ahmed H., 2012, 2012585 QUEENS U
[3]  
Akbarzadeh Totonchi M. R., 2010, INT C EL INF ENG ICE
[4]   An analysis of selection methods in memory consideration for harmony search [J].
Al-Betar, Mohammed Azmi ;
Khader, Ahamad Tajudin ;
Geem, Zong Woo ;
Abu Doush, Iyad ;
Awadallah, Mohammed A. .
APPLIED MATHEMATICS AND COMPUTATION, 2013, 219 (22) :10753-10767
[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]  
Alijla BO, 2013, LECT NOTES COMPUT SC, V7803, P356, DOI 10.1007/978-3-642-36543-0_37
[7]  
[Anonymous], 2003, P UKCI 2003
[8]   Improved binary artificial fish swarm algorithm for the 0-1 multidimensional knapsack problems [J].
Azad, Md. Abul Kalam ;
Rocha, Ana Maria A. C. ;
Fernandes, Edite M. G. P. .
SWARM AND EVOLUTIONARY COMPUTATION, 2014, 14 :66-75
[9]  
Bache K., 2013, UCI Machine Learning Repository
[10]   Feature selection with Intelligent Dynamic Swarm and Rough Set [J].
Bae, Changseok ;
Yeh, Wei-Chang ;
Chung, Yuk Ying ;
Liu, Sin-Long .
EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (10) :7026-7032