Applying the threshold accepting metaheuristic to curriculum based course timetabling

The article presents a study of local search algorithms for timetabling problems, with the particular goal of providing a contribution to competition track 3 of the International Timetabling Competition 2007 (ITC 2007). In this track, a formulation of a curriculum based course timetabling has been published, and novel benchmark instances have been presented that allow the comparison of optimization approaches.Our heuristic local search procedure is based on the principles of Threshold Accepting, overcoming local optima by a deterministic acceptance of inferior solutions throughout the search runs. A stochastic neighborhood is proposed and implemented, randomly removing and reassigning events from the current solution.The overall concept has been incrementally obtained from a series of experiments, which we describe in each (sub)section of the paper. In conclusions, we successfully derived a potential candidate solution approach for the finals of track 3 of the ITC 2007, held in August 2008 in Montréal, Canada.

[1]  Patrick De Causmaecker,et al.  A decomposed metaheuristic approach for a real-world university timetabling problem , 2009, Eur. J. Oper. Res..

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

[3]  Gerhard J. Woeginger,et al.  Timetabling problems at the TU Eindhoven , 2009, Eur. J. Oper. Res..

[4]  Sanja Petrovic,et al.  A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..

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

[6]  Sanja Petrovic,et al.  Multiple-retrieval case-based reasoning for course timetabling problems , 2006, J. Oper. Res. Soc..

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

[8]  Sancho Salcedo-Sanz,et al.  A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university , 2005, Comput. Oper. Res..

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

[10]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[11]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[12]  Louis Anthony Cox,et al.  Wiley encyclopedia of operations research and management science , 2011 .

[13]  Sanja Petrovic,et al.  An Introduction to Multiobjective Metaheuristics for Scheduling and Timetabling , 2004, Metaheuristics for Multiobjective Optimisation.

[14]  Xavier Gandibleux,et al.  Metaheuristics for Multiobjective Optimisation , 2004, Lecture Notes in Economics and Mathematical Systems.

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

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

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

[18]  Sanja Petrovic,et al.  A Multiobjective Optimisation Technique for Exam Timetabling Based on Trajectories , 2002, PATAT.

[19]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[20]  Martin Josef Geiger,et al.  Multi-criteria Curriculum-Based Course Timetabling-A Comparison of a Weighted Sum and a Reference Point Based Approach , 2009, EMO.

[21]  Edmund K. Burke,et al.  Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems , 2009, Eur. J. Oper. Res..

[22]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[23]  Saul I. Gass,et al.  Encyclopedia of Operations Research and Management Science , 1997 .

[24]  Kathryn A. Dowsland,et al.  Ant colony optimization for the examination scheduling problem , 2005, J. Oper. Res. Soc..

[25]  George M. White,et al.  Using tabu search with longer-term memory and relaxation to create examination timetables , 2004, Eur. J. Oper. Res..

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

[27]  David Joslin,et al.  "Squeaky Wheel" Optimization , 1998, AAAI/IAAI.

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