A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem

被引:63
作者
Pillay, N. [1 ]
Banzhaf, W. [2 ]
机构
[1] Univ KwaZulu Natal, Sch Comp Sci, ZA-3201 Pietermaritzburg, KwaZulu Natal, South Africa
[2] Mem Univ Newfoundland, Dept Comp Sci, St John, NF A1B 3X5, Canada
关键词
Timetabling; Heuristics; SEARCH TECHNIQUES;
D O I
10.1016/j.ejor.2008.07.023
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Research in the domain of examination timetabling is moving towards developing methods that generalise well over a range of problems. This is achieved by implementing hyper-heuristic systems to find the best heuristic or heuristic combination to allocate examinations when constructing a timetable for a problem. Heuristic combinations usually take the form of a list of low-level heuristics that are applied sequentially. This study proposes an alternative representation for heuristic combinations, namely, a hierarchical combination of heuristics. Furthermore, the heuristics in each combination are applied simultaneously rather than sequentially. The study also introduces a new low-level heuristic, namely, highest cost. A set of heuristic combinations of this format have been tested on the 13 Carter benchmarks. The quality of the examination timetables induced using these combinations are comparable to, and in some cases better than, those produced by hyper-heuristic systems combining and applying heuristic combinations sequentially. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:482 / 491
页数:10
相关论文
共 32 条
  • [1] Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
    Abdullah, Salwani
    Ahmadi, Samad
    Burke, Edmund K.
    Dror, Moshe
    [J]. OR SPECTRUM, 2007, 29 (02) : 351 - 372
  • [2] [Anonymous], 1992, GENETIC PROGRAMMING
  • [3] ASMUNI H, 2004, LECT NOTES COMPUTER, V3616, P147
  • [4] Bilgin B, 2007, LECT NOTES COMPUT SC, V3867, P394
  • [5] Burke E, 2005, OPERAT RES COMP SCI, V29, P79
  • [6] Burke E., 2003, Handbook of Metaheuristicspages, P457, DOI DOI 10.1007/0-306-48056-5_16
  • [7] Burke E.K., 2006, P PATAT, VCiteseer, P370
  • [8] A graph-based hyper-heuristic for educational timetabling problems
    Burke, Edmund K.
    McCollum, Barry
    Meisels, Amnon
    Petrovic, Sanja
    Qu, Rong
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (01) : 177 - 192
  • [9] Case-based heuristic selection for timetabling problems
    Burke, EK
    Petrovic, S
    Qu, R
    [J]. JOURNAL OF SCHEDULING, 2006, 9 (02) : 115 - 132
  • [10] Solving examination timetabling problems through adaption of heuristic orderings
    Burke, EK
    Newall, JP
    [J]. ANNALS OF OPERATIONS RESEARCH, 2004, 129 (1-4) : 107 - 134