Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results

We propose a set of formulations for the Curriculum-Based Course Timetabling problem, with the aim of “capturing” many real-world formulations, and thus encouraging researchers to “reduce” their specific problems to one of them, gaining the opportunity to compare and assess their results. This work is accompanied by a web application that maintains all the necessary infrastructures for benchmarking: validators, data formats, instances, reference scores, lower bounds, solutions, and visualizers. All instances proposed here are based on real data from various universities and they represent a variety of possible situations.

[1]  Edmund K. Burke,et al.  The Second International Timetabling Competition : Examination Timetabling Track , 2007 .

[2]  Barry McCollum,et al.  A Perspective on Bridging the Gap Between Theory and Practice in University Timetabling , 2006, PATAT.

[3]  Edmund K. Burke,et al.  A survey of search methodologies and automated system development for examination timetabling , 2009, J. Sched..

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

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

[6]  Edmund K. Burke,et al.  On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling , 2007, ArXiv.

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

[8]  Jonathan M. Thompson,et al.  GRASPing the Examination Scheduling Problem , 2002, PATAT.

[9]  Jeffrey H. Kingston.  Modelling Timetabling Problems with STTL , 2000, PATAT.

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

[11]  Efthymios Housos,et al.  An integer programming formulation for a case study in university timetabling , 2004, Eur. J. Oper. Res..

[12]  Barry McCollum,et al.  The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3) — preliminary presentation — , 2007 .

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

[14]  Barry McCollum.  A Perspective on Bridging the Gap in University Timetabling , 2007 .

[15]  Michael H. Goldwasser,et al.  Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Proceedings of a DIMACS Workshop, USA, 1999 , 2002, Data Structures, Near Neighbor Searches, and Methodology.

[16]  Luca Di Gaspero,et al.  Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals , 2006, PATAT.

[17]  Luca Di Gaspero,et al.  Tabu Search Techniques for Examination Timetabling , 2000, PATAT.

[18]  Igor Vasil'ev,et al.  A Computational Study of a Cutting Plane Algorithm for University Course Timetabling , 2005, J. Sched..

[19]  Ender Özcan,et al.  Towards an XML-Based Standard for Timetabling Problems: TTML , 2005 .

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

[21]  Edmund K. Burke,et al.  Penalising Patterns in Timetables: Novel Integer Programming Formulations , 2007, OR.

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

[23]  Stefan Nickel,et al.  Operations Research, Proceedings 2007, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Saarbrücken, Germany, September 5-7, 2007 , 2008, OR.

[24]  Luca Di Gaspero,et al.  Multi-neighbourhood Local Search with Application to Course Timetabling , 2002, PATAT.

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

[26]  Edmund K. Burke,et al.  A Standard Data Format for Timetabling Instances , 1997, PATAT.