TY  - JOUR
A1  - Banbara, Mutsunori
A1  - Inoue, Katsumi
A1  - Kaufmann, Benjamin
A1  - Okimoto, Tenda
A1  - Schaub, Torsten H.
A1  - Soh, Takehide
A1  - Tamura, Naoyuki
A1  - Wanko, Philipp
T1  - teaspoon
BT  - solving the curriculum-based course timetabling problems with answer set programming
JF  - Annals of operation research
N2  - Answer Set Programming (ASP) is an approach to declarative problem solving, combining a rich yet simple modeling language with high performance solving capacities. We here develop an ASP-based approach to curriculum-based course timetabling (CB-CTT), one of the most widely studied course timetabling problems. The resulting teaspoon system reads a CB-CTT instance of a standard input format and converts it into a set of ASP facts. In turn, these facts are combined with a first-order encoding for CB-CTT solving, which can subsequently be solved by any off-the-shelf ASP systems. We establish the competitiveness of our approach by empirically contrasting it to the best known bounds obtained so far via dedicated implementations. Furthermore, we extend the teaspoon system to multi-objective course timetabling and consider minimal perturbation problems.
KW  - Educational timetabling
KW  - Course timetabling
KW  - Answer set programming
KW  - Multi-objective optimization
KW  - Minimal perturbation problems
Y1  - 2018
U6  - https://doi.org/10.1007/s10479-018-2757-7
SN  - 0254-5330
SN  - 1572-9338
VL  - 275
IS  - 1
SP  - 3
EP  - 37
PB  - Springer
CY  - Dordrecht
ER  -