An investigation on the generality level of selection hyper-heuristics under different empirical conditions

被引:22
作者
Misir, M. [1 ,2 ]
Verbeeck, K. [1 ,2 ]
De Causmaecker, P. [2 ]
Berghe, G. Vanden [1 ,2 ]
机构
[1] KAHO Sint Lieven, CODeS, Gebroeders De Smetstr 1, B-9000 Ghent, Belgium
[2] Katholieke Univ Leuven, Dept Comp Sci, CODeS, B-8500 Kortrijk, Belgium
关键词
Hyper-heuristics; Generality; Home care scheduling; Nurse rostering; Patient admission scheduling; HYPERHEURISTIC APPROACH; LOCAL SEARCH; OPTIMIZATION; DISCOVERY; SOLVE;
D O I
10.1016/j.asoc.2013.02.006
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The present study concentrates on the generality of selection hyper-heuristics across various problem domains with a focus on different heuristic sets in addition to distinct experimental limits. While most hyper-heuristic research employs the term generality in describing the potential for solving various problems, the performance changes across different domains are rarely reported. Furthermore, a hyper-heuristic's performance study purely on the topic of heuristic sets is uncommon. Similarly, experimental limits are generally ignored when comparing hyper-heuristics. In order to demonstrate the effect of these generality related elements, nine heuristic sets with different improvement capabilities and sizes were generated for each of three target problem domains. These three problem domains are home care scheduling, nurse rostering and patient admission scheduling. Fourteen hyper-heuristics with varying intensification/diversification characteristics were analysed under various settings. Empirical results indicate that the performance of selection hyper-heuristics changes significantly under different experimental conditions. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:3335 / 3353
页数:19
相关论文
共 57 条
  • [41] Misir M., 2009, P 35 INT C OP RES AP
  • [42] Misir M., 2010, P IEEE C EV COMP CEC, P2875
  • [43] Misir M., METAHEURISTICS INTEL
  • [44] Nareyek A, 2004, APPL OPTIM, V86, P523
  • [45] Nickel S., 2011, EUR J OPER RES, V219, P574
  • [46] Obit J., 2011, METAHEURISTICS INTEL
  • [47] A Reinforcement Learning: Great-Deluge Hyper-Heuristic for Examination Timetabling
    Oezcan, Ender
    Misir, Mustafa
    Ochoa, Gabriela
    Burke, Edmund K.
    [J]. INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING, 2010, 1 (01) : 39 - 59
  • [48] Examination Timetabling Using Late Acceptance Hyper-heuristics
    Ozcan, Ender
    Bykov, Yuri
    Birben, Murat
    Burke, Edmund K.
    [J]. 2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, : 997 - +
  • [49] A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem
    Pillay, N.
    Banzhaf, W.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) : 482 - 491
  • [50] Rendl A., 2011, 8 INT C INT ART INT