Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem

This paper provides a mathematical treatment of the NP-hard post enrolment-based course timetabling problem and presents a powerful two-stage metaheuristic-based algorithm to approximately solve it. We focus particularly on the issue of solution space connectivity and demonstrate that when this is increased via specialised neighbourhood operators, the quality of solutions achieved is generally enhanced. Across a well-known suite of benchmark problem instances, our proposed algorithm is shown to produce results that are superior to all other methods appearing in the literature; however, we also make note of those instances where our algorithm struggles in comparison to others and offer evidence as to why.

[1]  Günther R. Raidl,et al.  Solving the post enrolment course timetabling problem by ant colony optimization , 2012, Ann. Oper. Res..

[2]  Rhyd Lewis,et al.  A time-dependent metaheuristic algorithm for post enrolment-based course timetabling , 2012, Ann. Oper. Res..

[3]  Sara Ceschia,et al.  Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem , 2011, Comput. Oper. Res..

[4]  Regina Berretta,et al.  A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem , 2007, 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007).

[5]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[6]  Mauro Birattari,et al.  An effective hybrid algorithm for university course timetabling , 2006, J. Sched..

[7]  Danial Qaurooni,et al.  Course timetabling using evolutionary operators , 2013, Appl. Soft Comput..

[8]  Jonathan M. Thompson,et al.  On the application of graph colouring techniques in round-robin sports scheduling , 2011, Comput. Oper. Res..

[9]  Rhyd Lewis,et al.  A survey of metaheuristic-based techniques for University Timetabling problems , 2007, OR Spectr..

[10]  Celso C. Ribeiro,et al.  Scheduling in sports: An annotated bibliography , 2010, Comput. Oper. Res..

[11]  Edmund K. Burke,et al.  A multistage evolutionary algorithm for the timetable problem , 1999, IEEE Trans. Evol. Comput..

[12]  Jonathan M. Thompson,et al.  A wide-ranging computational comparison of high-performance graph colouring algorithms , 2012, Comput. Oper. Res..

[13]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[14]  Ben Paechter,et al.  Finding Feasible Timetables Using Group-Based Operators , 2007, IEEE Transactions on Evolutionary Computation.

[15]  Ivo Blöchliger,et al.  Modeling staff scheduling problems. A tutorial , 2004, Eur. J. Oper. Res..

[16]  Juan Frausto Solís,et al.  An Efficient Simulated Annealing Algorithm for Feasible Solutions of Course Timetabling , 2008, MICAI.

[17]  Francis Y. L. Chin,et al.  A clique-based algorithm for constructing feasible timetables , 2011, Optim. Methods Softw..

[18]  Kathryn A. Dowsland,et al.  An improved ant colony optimisation heuristic for graph colouring , 2008, Discret. Appl. Math..

[19]  Ben Paechter,et al.  A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem , 2002, PATAT.

[20]  Kathryn A. Dowsland,et al.  A robust simulated annealing based examination timetabling system , 1998, Comput. Oper. Res..

[21]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[22]  Barry O'Sullivan,et al.  Local search and constraint programming for the post enrolment-based course timetabling problem , 2012, Ann. Oper. Res..

[23]  Gilbert Laporte,et al.  Recent Developments in Practical Course Timetabling , 1997, PATAT.

[24]  Barry McCollum,et al.  Post enrolment based course timetabling: a description ofthe problem model used for track two of the secondInternational Timetabling Competition , 2007 .

[25]  Gilbert Laporte,et al.  Recent Developments in Practical Examination Timetabling , 1995, PATAT.

[26]  Dimitri P. Bertsekas,et al.  Auction algorithms for network flow problems: A tutorial introduction , 1992, Comput. Optim. Appl..

[27]  Dennis Huisman,et al.  Demand-Driven Scheduling of Movies in a Multiplex , 2007 .

[28]  Philipp Kostuch,et al.  The University Course Timetabling Problem with a 3-phase approach , 2007 .

[29]  Dominique de Werra,et al.  Compactness and balancing in scheduling , 1977, Math. Methods Oper. Res..

[30]  Shengxiang Yang,et al.  A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling , 2011, J. Sched..

[31]  Hana Rudová,et al.  Real-life Curriculum-based Timetabling , 2012 .

[32]  Ben Paechter,et al.  Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition , 2010, INFORMS J. Comput..

[33]  Jin-Kao Hao,et al.  Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..

[34]  Nicolas Zufferey,et al.  A graph coloring heuristic using partial solutions and a reactive tabu scheme , 2008, Comput. Oper. Res..

[35]  Matteo Fischetti,et al.  Modeling and Solving the Train Timetabling Problem , 2002, Oper. Res..

[36]  Cor A. J. Hurkens,et al.  An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007 , 2012, Ann. Oper. Res..

[37]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..

[38]  Gilbert Laporte,et al.  Examination Timetabling: Algorithmic Strategies and Applications , 1994 .