An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007

Track 2 of the international timetabling competition 2007 was a post enrolment course timetabling problem. A set of events has to be assigned to a timeslot and to a room such that all students are able to attend their requested events while not violating the hard constraints. There are also soft constraints that make the timetable “nicer”.We present a deterministic heuristic that assigns events to timeslots based on an LP-solution constructed with column generation. We get an integer solution by fixing columns one at a time. This heuristic finds a solution that obeys all the hard constraint for 23 of the 24 instances of the competition. The generated solution is improved by selecting a set of events that are reassigned by solving an integer program. This IP minimizes the number of soft constraint violations under the restriction that no hard constraints are violated. Comparing the results of our heuristic with the results of the five finalists of the competition, shows that our approach is competitive.

[1]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling IV , 2002, Lecture Notes in Computer Science.

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

[3]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling II , 1997, Lecture Notes in Computer Science.

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

[5]  Gilbert Laporte,et al.  Recent Developments in Practical Course Timetabling , 1997, 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]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

[8]  Martin Grötschel,et al.  Duty Scheduling in Public Transit , 2003 .

[9]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling V, 5th International Conference, PATAT 2004, Pittsburgh, PA, USA, August 18-20, 2004, Revised Selected Papers , 2005, PATAT.

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

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

[12]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[13]  J. Desrosiers,et al.  A Primer in Column Generation , 2005 .

[14]  Alan J. Hu,et al.  Boosting Verification by Automatic Tuning of Decision Procedures , 2007, Formal Methods in Computer Aided Design (FMCAD'07).

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

[16]  W. Jäger,et al.  Mathematics – key technology for the future , 2003 .

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

[18]  Jacques Desrosiers,et al.  Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems , 2002 .

[19]  Toshihide Ibaraki,et al.  ITC-2007 Track2: An Approach using General CSP Solver , 2007 .

[20]  Tomás Müller,et al.  ITC2007 solver description: a hybrid approach , 2009, Ann. Oper. Res..