A local search for the timetabling problem.

Rossi-Doria, Olivia; Blum, Christian; Knowles, Joshua; Sampels, Michael; Socha, Krzysztof; Paechter, Ben

Abstract

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.

Citation

Rossi-Doria, O., Blum, C., Knowles, J., Sampels, M., Socha, K., & Paechter, B. (2002, August). A local search for the timetabling problem. Presented at PATAT 2002

• Conference Name: PATAT 2002
• Start Date: Aug 21, 2002
• End Date: Aug 23, 2002
• Publication Date: 2002
• Deposit Date: May 11, 2010
• Publicly Available Date: May 11, 2010
• Peer Reviewed: Peer Reviewed
• Pages: 124-127
• Book Title: Proceedings of the Conference on the Practice and Theory of Automated Timetabling (PATAT 2002)
• ISBN: 9080609617
• Keywords: metaheuristics; combinatorial optimization problems; timetabling
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3350
• Contract Date: May 11, 2010