$${\varvec{teaspoon}}$$ teaspoon: solving the curriculum-based course timetabling problems with answer set programming
Mutsunori Banbara (),
Katsumi Inoue (),
Benjamin Kaufmann (),
Tenda Okimoto (),
Torsten Schaub (),
Takehide Soh (),
Naoyuki Tamura () and
Philipp Wanko ()
Additional contact information
Mutsunori Banbara: Kobe University
Katsumi Inoue: National Institute of Informatics
Benjamin Kaufmann: Universität Potsdam
Tenda Okimoto: Kobe University
Torsten Schaub: Universität Potsdam
Takehide Soh: Kobe University
Naoyuki Tamura: Kobe University
Philipp Wanko: Universität Potsdam
Annals of Operations Research, 2019, vol. 275, issue 1, No 2, 3-37
Abstract:
Abstract 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.
Keywords: Educational timetabling; Course timetabling; Answer set programming; Multi-objective optimization; Minimal perturbation problems (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
http://link.springer.com/10.1007/s10479-018-2757-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
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:275:y:2019:i:1:d:10.1007_s10479-018-2757-7
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-018-2757-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 ().