Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem

The post-enrolment course timetabling (PE-CTT) is one of the most studied timetabling problems, for which many instances and results are available. In this work we design a metaheuristic approach based on simulated annealing to solve the PE-CTT. We consider all the different variants of the problem that have been proposed in the literature and we perform a comprehensive experimental analysis on all the available public instances. The outcome is that our solver, properly engineered and tuned, performs very well on all cases, providing the new best known results on many instances and state-of-the-art values for the others.

[1]  A. Hertz.  Tabu search for large scale timetabling problems , 1991 .

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

[3]  Philipp Kostuch,et al.  The University Course Timetabling Problem with a Three-Phase Approach , 2004, PATAT.

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

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

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

[7]  Thomas W. Lucas,et al.  Efficient Nearly Orthogonal and Space-Filling Latin Hypercubes , 2007, Technometrics.

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

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

[10]  Marco E. Lübbecke,et al.  Curriculum Based Course Timetabling: Optimal Solutions to the Udine Benchmark Instances , 2008 .

[11]  Edmund K. Burke,et al.  A hybrid evolutionary approach to the university course timetabling problem , 2007, 2007 IEEE Congress on Evolutionary Computation.

[12]  T. M. Cioppa,et al.  Efficient Nearly Orthogonal and Space-Filling , 2007 .

[13]  Kate Smith-Miles,et al.  Generalising Algorithm Performance in Instance Space: A Timetabling Case Study , 2011, LION.

[14]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[15]  Luca Di Gaspero,et al.  Design and statistical analysis of a hybrid local search algorithm for course timetabling , 2012, J. Sched..

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

[17]  Michael Sampels,et al.  A MAX-MIN Ant System for the University Course Timetabling Problem , 2002, Ant Algorithms.

[18]  Sanja Petrovic,et al.  A time-predefined approach to course timetabling , 2003 .

[19]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[20]  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).

[21]  D. Landa-Silva,et al.  Great deluge with non-linear decay rate for solving course timetabling problems , 2008, 2008 4th International IEEE Conference Intelligent Systems.

[22]  Salwani Abdullah,et al.  Electromagnetism-like Mechanism with Force Decay Rate Great Deluge for the Course Timetabling Problem , 2009, RSKT.

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

[24]  Krzysztof Socha,et al.  Hardness Prediction for the University Course Timetabling Problem , 2004, EvoCOP.

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

[26]  Holger H. Hoos,et al.  A Modular Multiphase Heuristic Solver for Post Enrolment Course Timetabling , 2008 .

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

[29]  David S. Johnson,et al.  A theoretician's guide to the experimental analysis of algorithms , 1999, Data Structures, Near Neighbor Searches, and Methodology.

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

[31]  Nashat Mansour,et al.  Curriculum based course timetabling , 2013, 2013 Ninth International Conference on Natural Computation (ICNC).

[32]  Luca Di Gaspero,et al.  Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems , 2006, J. Math. Model. Algorithms.

[33]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[34]  Jin-Kao Hao,et al.  Lower bounds for the ITC-2007 curriculum-based course timetabling problem , 2011, Eur. J. Oper. Res..

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

[36]  Luca Di Gaspero,et al.  EASYLOCAL++: an object‐oriented framework for the flexible design of local‐search algorithms , 2003, Softw. Pract. Exp..

[37]  Sanja Petrovic,et al.  Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..

[38]  Marco E. Lübbecke,et al.  Curriculum based course timetabling: new solutions to Udine benchmark instances , 2012, Ann. Oper. Res..

[39]  Tom.  ITC2007 Solver Description: A Hybrid Approach , 2007 .

[40]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[41]  Edmund K. Burke,et al.  Decomposition, reformulation, and diving in university course timetabling , 2009, Comput. Oper. Res..

[42]  Paul McMullan,et al.  An Extended Implementation of the Great Deluge Algorithm for Course Timetabling , 2007, International Conference on Computational Science.

[43]  Mauro Birattari,et al.  An effective hybrid approach for the university course timetabling problem , 2003 .

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

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

[46]  Alain Hertz,et al.  Finding a feasible course schedule using Tabu search , 1992, Discret. Appl. Math..

[47]  Edmund K. Burke,et al.  A supernodal formulation of vertex colouring with applications in course timetabling , 2007, Ann. Oper. Res..

[48]  Ben Paechter,et al.  Application of the Grouping Genetic Algorithm to University Course Timetabling , 2005, EvoCOP.

[49]  Hana Rudová,et al.  Modeling and Solution of a Complex University Course Timetabling Problem , 2006, PATAT.

[50]  Calvin C. Gotlieb,et al.  The Construction of Class-Teacher Time-Tables , 1962, IFIP Congress.