Rossi-Doria, Olivia, Blum, Christian, Knowles, Joshua, Sampels, Michael, Socha, Krzysztof and Paechter, Ben (2002) A local search for the timetabling problem. In: PATAT 2002 Proceedings of the 4th international conference on the Practice And Theory of Automated Timetabling. Department of Industrial Engineering, Gent, Belgium, pp. 124-127. ISBN 90-806096-1-7

PDF Restricted to Registered users only Available under License Creative Commons Attribution Non-commercial. Download (107kB) | Request a copy

Abstract/Description

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

Actions (login required)