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 条
  • [1] Abdul-Rahman S., ANN OPERATI IN PRESS
  • [2] Ahmed A, 2011, AUSTR J BASIC APPL S, V5, P190
  • [3] A simulated annealing approach to the traveling tournament problem
    Anagnostopoulos, A
    Michel, L
    Van Hentenryck, P
    Vergados, Y
    [J]. JOURNAL OF SCHEDULING, 2006, 9 (02) : 177 - 193
  • [4] [Anonymous], 2011, J. Appl. Oper. Res.
  • [5] [Anonymous], 2011, P 5 MULT INT SCHED C
  • [6] [Anonymous], 2008, PATAT 2008 C MONTR C
  • [7] [Anonymous], 2011, LEARNING INTELLIGENT
  • [8] Araya I., 2008, Adaptive and Multilevel Metaheuristics, volume 136 of Studies in Computational Intelligence, chapter An Efficient Hyperheuristic for Strip-Packing Problems, P61, DOI DOI 10.1007/978-3-540-79438-7_3
  • [9] Ayob M, 2003, P INT C INT TECHN IN, P132
  • [10] Bader-El-Den M., 2009, Memetic Computing, V1, P205