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

Hadrien Cambazard; Emmanuel Hebrard; Barry O’Sullivan; Alexandre Papadopoulos

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

Hadrien Cambazard
, Emmanuel Hebrard
, Barry O’Sullivan
, Alexandre Papadopoulos

University College Cork

Research output: Contribution to conference › Paper › peer-review

Abstract

We present a study of the university post-enrolment timetabling problem, proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using several techniques, particularly local search, constraint programming techniques and hybrids of these in the form of a large neighbourhood search scheme. Our local search approach won the competition. Our best constraint programming approach uses an original problem decomposition. Incorporating this into a large neighbourhood search scheme seems promising.

Original language	English
Publication status	Published - 2008
Event	7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008 - Montreal, Canada Duration: 18 Aug 2008 → 22 Aug 2008

Conference

Conference	7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008
Country/Territory	Canada
City	Montreal
Period	18/08/08 → 22/08/08

Cite this

@conference{8494dc955cc14e9c9c9044bda2e5395d,

title = "Local search and constraint programming for the post enrolment-based course timetabling problem",

abstract = "We present a study of the university post-enrolment timetabling problem, proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using several techniques, particularly local search, constraint programming techniques and hybrids of these in the form of a large neighbourhood search scheme. Our local search approach won the competition. Our best constraint programming approach uses an original problem decomposition. Incorporating this into a large neighbourhood search scheme seems promising.",

author = "Hadrien Cambazard and Emmanuel Hebrard and Barry O{\textquoteright}Sullivan and Alexandre Papadopoulos",

note = "Publisher Copyright: {\textcopyright} Practice and Theory of Automated Timetabling, PATAT 2008.All right reserved.; 7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008 ; Conference date: 18-08-2008 Through 22-08-2008",

year = "2008",

language = "English",

}

Local search and constraint programming for the post enrolment-based course timetabling problem. / Cambazard, Hadrien; Hebrard, Emmanuel; O’Sullivan, Barry et al.
2008. Paper presented at 7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008, Montreal, Canada.

Research output: Contribution to conference › Paper › peer-review

TY - CONF

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 - 2008

Y1 - 2008

N2 - We present a study of the university post-enrolment timetabling problem, proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using several techniques, particularly local search, constraint programming techniques and hybrids of these in the form of a large neighbourhood search scheme. Our local search approach won the competition. Our best constraint programming approach uses an original problem decomposition. Incorporating this into a large neighbourhood search scheme seems promising.

AB - We present a study of the university post-enrolment timetabling problem, proposed as Track 2 of the 2007 International Timetabling Competition. We approach the problem using several techniques, particularly local search, constraint programming techniques and hybrids of these in the form of a large neighbourhood search scheme. Our local search approach won the competition. Our best constraint programming approach uses an original problem decomposition. Incorporating this into a large neighbourhood search scheme seems promising.

UR - https://www.scopus.com/pages/publications/84976378571

M3 - Paper

AN - SCOPUS:84976378571

T2 - 7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008

Y2 - 18 August 2008 through 22 August 2008

ER -

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

Abstract

Conference

Other files and links

Fingerprint

Cite this