Optimal University Course Timetables and the Partial Transversal Polytope
University course timetabling is the conflict-free assignment of courses to weekly time slots and rooms subject to various hard and soft constraints. One goal is to meet as closely as possible professors’ preferences. Building on an intuitive integer program (IP), we develop an exact decomposition approach which schedules courses first, and matches courses/times to rooms in a second stage. The subset of constraints which ensures a feasible room assignment defines the well-known partial transversal polytope. We describe it as a polymatroid, and thereby obtain a complete characterization of its facets. This enables us to add only strong valid inequalities to the first stage IP. In fact, for all practical purposes the number of facets is small. We present encouraging computational results on real-world and simulated timetabling data. The sizes of our optimally solvable instances (respecting all hard constraints) are the largest reported in the literature by far.
Keywordsinteger programming partial transversal polytope university course timetabling
Unable to display preview. Download preview PDF.
- 5.ITC2007: 2nd International Timetabling Competition, http://www.cs.qub.ac.uk/itc2007/
- 10.Lewis, R.: A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum (in press, 2007)Google Scholar
- 11.Meyers, C., Orlin, J.B.: Very large-scale neighborhood search techniques in timetabling problems. In: PATAT 2006: Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, Berlin, pp. 36–52. springer, Heidelberg (2007)Google Scholar
- 17.Lach, G., Lübbecke, M.: Curriculum based course timetabling: Optimal solutions to the Udine benchmark instances. Preprint 2008/9, Technische Universität Berlin, Institut für Mathematik (2008)Google Scholar
- 18.Lach, G.: Modelle und Algorithmen zur Optimierung der Raumvergabe der TU Berlin. Master’s thesis, Technische Universität Berlin, Institut für Mathematik (in German, 2007)Google Scholar