Local search and constraint programming for the post enrolment-based course timetabling problem

Hadrien Cambazard (), Emmanuel Hebrard (), Barry O’Sullivan () and Alexandre Papadopoulos ()

Annals of Operations Research, 2012, vol. 194, issue 1, 135 pages

Abstract: We present a variety of approaches for solving the post enrolment-based course timetabling problem, which was proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using local search and constraint programming techniques. We show how to take advantage of a list-colouring relaxation of the problem. Our local search approach won Track 2 of the 2007 competition. Our best constraint programming approach uses an original problem decomposition. Incorporating this into a large neighbourhood search scheme seems promising, and provides motivation for studying complete approaches in further detail. Copyright Springer Science+Business Media, LLC 2012

Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-010-0737-7 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:194:y:2012:i:1:p:111-135:10.1007/s10479-010-0737-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-010-0737-7

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().