An automatically configured modular algorithm for post enrollment course timetabling

Chris Fawcett, Holger Hoos, Marco Chiarandini

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch


Timetabling tasks form a widely studied type of resource scheduling
problem, with important real-world applications in schools, universities
and other educational settings. In this work, we focus on postenrollment
course timetabling, the problem that was covered by Track
2 of the recent 2nd International Timetabling Competition (ITC2007).
Following an approach that makes strong use of automated exploration
of a large design space of modular and highly parameterised stochastic
local search algorithms for this problem, we have obtained a solver that
achieves consistently better performance than the top-ranked solver
from the competition. This represents a substantial improvement in
the state of the art for post-enrollment course timetabling.
Original languageEnglish
Title of host publicationDoctoral Symposium on Engineering Stochastic Local Search Algorithms
EditorsFrank Hutter, Marco de Oca
Number of pages4
PublisherIRIDIA, Institut de Recherches Interdisciplinaires
Publication date2009
ISBN (Electronic)1781-3794
Publication statusPublished - 2009
EventEngineering Stochastic Local Search Algorithms - Brussels, Belgium
Duration: 3. Sep 20095. Sep 2009


ConferenceEngineering Stochastic Local Search Algorithms
SeriesIRIDIA - Technical Report Series

Cite this