A local search for the timetabling problem.

Research Output

This work is part of the Metaheuristic Network, a European Commission project that seeks to empirically compare the performance of various metaheuristics on different combinatorial optimization problems. In this paper we define 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 ofthe relative performance of these methods on a timetabling problem.

Date:

01 January 2002
Publication Status:

Published
Publisher

Department of Industrial Engineering
Library of Congress:

QA75 Electronic computers. Computer science
Dewey Decimal Classification:

005 Computer programming, programs & data

http://researchrepository.napier.ac.uk/output/272974 <p>Rossi-Doria, O., Blum, C., Knowles, J., Sampels, M., Socha, K., & Paechter, B. (2001). A local search for the timetabling problem. In E. Burke, & P. Causmaecker (Eds.), <i>Proceedings of the Conference on the Practice and Theory of Automated Timetabling (PATAT 2002)</i>, 124-127</p>

Citation

Rossi-Doria, O., Blum, C., Knowles, J., Sampels, M., Socha, K., & Paechter, B. (2001). A local search for the timetabling problem. In E. Burke, & P. Causmaecker (Eds.), Proceedings of the Conference on the Practice and Theory of Automated Timetabling (PATAT 2002), 124-127