Cambazard, H., Hebrard, E., O'Sullivan, B., Papadopoulos, A.

2010

Annals of Operations Research

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

Validated

()

1

25

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. © 2010 Springer Science+Business Media, LLC.

http://www.scopus.com/inward/record.url?eid=2-s2.0-77953003877&partnerID=40&md5=adb74c3eb6f88ea51878e7b11c77ed05