Research Output

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

  • Date:

    30 November 2001

  • Publication Status:

    Published

  • Publisher

    Department of Industrial Engineering

  • Library of Congress:

    QA75 Electronic computers. Computer science

  • Dewey Decimal Classification:

    005 Computer programming, programs & data

Citation

Rossi-Doria, O., Blum, C., Knowles, J., Sampels, M., Socha, K. & Paechter, B. (2001). A local search for the timetabling problem. In Burke, E. & Causmaecker, P. (Eds.). PATAT 2002 Proceedings of the 4th international conference on the Practice And Theory of Automated Timetabling, 124-127. ISBN 90-806096-1-7

Authors

Keywords

metaheuristics; combinatorial optimization problems; timetabling;

Monthly Views:

Available Documents