A time-dependent metaheuristic algorithm for post enrolment-based course timetabling

A metaheuristic-based algorithm is presented for the post enrolment-based course timetabling problem used in track-2 of the Second International Timetabling Competition (ITC2007). The featured algorithm operates in three distinct stages—a constructive phase followed by two separate phases of simulated annealing—and is time dependent, due to the fact that various run-time parameters are calculated automatically according to the amount of computation time available. Overall, the method produces results in line with the official finalists to the timetabling competition, though experiments show that this algorithm also seems to find certain instances more difficult to solve than others. A number of reasons for this latter feature are discussed.

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

[2]  David Abramson,et al.  Simulated Annealing Cooling Schedules for the School Timetabling Problem , 1999 .

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

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

[5]  Tomás Müller.  ITC 2007 : Solver Description , 2008 .

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

[7]  Ben Paechter,et al.  Metaheuristics for University Course Timetabling , 2007, Evolutionary Scheduling.

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

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

[10]  Edmund K. Burke,et al.  The practice and theory of automated timetabling , 2014, Ann. Oper. Res..

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

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

[13]  Michael Sampels,et al.  Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art , 2003, EvoWorkshops.

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

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

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

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

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

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

[20]  T. Stützle,et al.  An application of Iterated Local Search to the Graph Coloring Problem , 2007 .

[21]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

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