An effective hybrid algorithm for university course timetabling

  • Authors:

  • Marco Chiarandini;Mauro Birattari;Krzysztof Socha;Olivia Rossi-Doria

  • Affiliations:

  • Department of Mathematics and Computer Science, University of Southern Denmark, Odense M, Denmark 5230;Université Libre de Bruxelles, IRIDIA, Bruxelles, Belgium 1050;Université Libre de Bruxelles, IRIDIA, Bruxelles, Belgium 1050;Napier University, School of Computing, Edinburgh, Scotland EH10 5DT

  • Venue:
  • Journal of Scheduling
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The university course timetabling problem is an optimisation problem in which a set of events has to be scheduled in timeslots and located in suitable rooms. Recently, a set of benchmark instances was introduced and used for an `International Timetabling Competition' to which 24 algorithms were submitted by various research groups active in the field of timetabling. We describe and analyse a hybrid metaheuristic algorithm which was developed under the very same rules and deadlines imposed by the competition and outperformed the official winner. It combines various construction heuristics, tabu search, variable neighbourhood descent and simulated annealing. Due to the complexity of developing hybrid metaheuristics, we strongly relied on an experimental methodology for configuring the algorithms as well as for choosing proper parameter settings. In particular, we used racing procedures that allow an automatic or semi-automatic configuration of algorithms with a good save in time. Our successful example shows that the systematic design of hybrid algorithms through an experimental methodology leads to high performing algorithms for hard combinatorial optimisation problems.