A local search for the timetabling problem

This work is part of the Metaheuristic Network, a European Commission project that seeks to empirically compare the performance of various metaheuristics on di�erent combinatorial optimization problems. In this paper we de�ne a representation, a neighbourhood structure and a local search for a university course timetabling problem. Our motivation is to provide a common search landscape for the metaheuristics that we aim to compare, allowing us to make a fair and meaningful analysis of the relative performance of these methods on a timetabling problem