Back to Search
Start Over
teaspoon: solving the curriculum-based course timetabling problems with answer set programming.
- Source :
- Annals of Operations Research; Apr2019, Vol. 275 Issue 1, p3-37, 35p
- Publication Year :
- 2019
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02545330
- Volume :
- 275
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Annals of Operations Research
- Publication Type :
- Academic Journal
- Accession number :
- 134969531
- Full Text :
- https://doi.org/10.1007/s10479-018-2757-7