TY - JOUR
T1 - Local search and constraint programming for the post enrolment-based course timetabling problem
AU - Cambazard, Hadrien
AU - Hebrard, Emmanuel
AU - O'Sullivan, Barry
AU - Papadopoulos, Alexandre
PY - 2012/4
Y1 - 2012/4
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84857451816
U2 - 10.1007/s10479-010-0737-7
DO - 10.1007/s10479-010-0737-7
M3 - Article
AN - SCOPUS:84857451816
SN - 0254-5330
VL - 194
SP - 111
EP - 135
JO - Annals of Operations Research
JF - Annals of Operations Research
IS - 1
ER -