A survey of search methodologies and automated system development for examination timetabling

被引:232
作者
Qu, R. [1 ]
Burke, E. K. [1 ]
McCollum, B. [2 ]
Merlot, L. T. G. [3 ]
Lee, S. Y. [4 ]
机构
[1] Univ Nottingham, Sch Comp Sci, Automated Scheduling Optimisat & Planning ASAP Gr, Nottingham NG8 1BB, England
[2] Queens Univ Belfast, Sch Comp Sci, Belfast BT7 1NN, Antrim, North Ireland
[3] Quantum Ltd, Melbourne, Vic 3000, Australia
[4] Univ Toronto, Toronto, ON M5S 3G8, Canada
关键词
Examination timetabling; Benchmark problem datasets; Search methodologies; ANT COLONY OPTIMIZATION; TABU-SEARCH; NEIGHBORHOOD SEARCH; ALGORITHM; HEURISTICS; INITIALIZATION; STRATEGIES; FRAMEWORK; DESIGN; SCHOOL;
D O I
10.1007/s10951-008-0077-5
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Examination timetabling is one of the most important administrative activities that takes place in all academic institutions. In this paper, we present a critical discussion of the research on exam timetabling which has taken place in the last decade or so. This last ten years has seen a significantly increased level of research attention for this important area. There has been a range of insightful contributions to the scientific literature both in terms of theoretical issues and practical aspects. The main aim of this survey is to highlight the new trends and key research achievements that have been carried out in the last decade. We also aim to outline a range of relevant important research issues and challenges that have been generated by this body of work. We first define the problem and discuss previous survey papers. Within our presentation of the state-of-the-art methodologies, we highlight recent research trends including hybridisations of search methodologies and the development of techniques which are motivated by raising the level of generality at which search methodologies can operate. Summarising tables are presented to provide an overall view of these techniques. We also present and discuss some important issues which have come to light concerning the public benchmark exam timetabling data. Different versions of problem datasets with the same name have been circulating in the scientific community for the last ten years and this has generated a significant amount of confusion. We clarify the situation and present a re-naming of the widely studied datasets to avoid future confusion. We also highlight which research papers have dealt with which dataset. Finally, we draw upon our discussion of the literature to present a (non-exhaustive) range of potential future research directions and open issues in exam timetabling research.
引用
收藏
页码:55 / 89
页数:35
相关论文
共 164 条
[1]  
Aarts E., 1989, Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
[2]   A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem [J].
Abdullah, S. ;
Ahmadi, S. ;
Burke, E. K. ;
Dror, M. ;
McCollum, B. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (11) :1494-1502
[3]   Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling [J].
Abdullah, Salwani ;
Ahmadi, Samad ;
Burke, Edmund K. ;
Dror, Moshe .
OR SPECTRUM, 2007, 29 (02) :351-372
[4]  
Ahmadi S, 2003, P MULT INT SCHED THE, P155
[5]   Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem [J].
Ahuja, RK ;
Orlin, JB ;
Sharma, D .
MATHEMATICAL PROGRAMMING, 2001, 91 (01) :71-97
[6]  
AJILI F, 2003, CONSTRAINT INTEGER P, P169
[7]  
[Anonymous], P INT DEEP FDN C ORL
[8]  
[Anonymous], LECT NOTES EC MATH S
[9]  
[Anonymous], 8306 U TOR DEP IND E
[10]  
[Anonymous], LECT NOTES COMPUTER