$${\varvec{teaspoon}}$$teaspoon: solving the curriculum-based course timetabling problems with answer set programming

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.

[1]  Maria Luisa Bonet,et al.  SAT-based MaxSAT algorithms , 2013, Artif. Intell..

[2]  Edmund K. Burke,et al.  A branch-and-cut procedure for the Udine Course Timetabling problem , 2012, Ann. Oper. Res..

[3]  Tom.  ITC2007 Solver Description: A Hybrid Approach , 2007 .

[4]  Roman Barták,et al.  Minimal Perturbation Problem in Course Timetabling , 2004, PATAT.

[5]  Sanja Petrovic,et al.  Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..

[6]  Marco E. Lübbecke,et al.  Curriculum based course timetabling: new solutions to Udine benchmark instances , 2012, Ann. Oper. Res..

[7]  Hana Rudová,et al.  Complex university course timetabling , 2011, J. Sched..

[8]  Martin Josef Geiger,et al.  Applying the threshold accepting metaheuristic to curriculum based course timetabling , 2012, Ann. Oper. Res..

[9]  Onno Boxma,et al.  Computational methods and applications in queueing theory , 2017, Ann. Oper. Res..

[10]  Rhyd Lewis,et al.  A survey of metaheuristic-based techniques for University Timetabling problems , 2007, OR Spectr..

[11]  Toby Walsh,et al.  Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications , 2009 .

[12]  Salwani Abdullah,et al.  A hybrid metaheuristic approach to the university course timetabling problem , 2010, Journal of Heuristics.

[13]  Martin Gebser,et al.  Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving , 2014, Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation.

[14]  Nina Narodytska,et al.  Maximum Satisfiability Using Core-Guided MaxSAT Resolution , 2014, AAAI.

[15]  Martin Gebser,et al.  Progress in clasp Series 3 , 2015, LPNMR.

[16]  Joao Marques-Silva,et al.  On Using Unsatisfiability for Solving Maximum Satisfiability , 2007, ArXiv.

[17]  Mark Wallace,et al.  Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.

[18]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[19]  Nysret Musliu,et al.  MaxSAT-based large neighborhood search for high school timetabling , 2017, Comput. Oper. Res..

[20]  Jin-Kao Hao,et al.  Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..

[21]  Toby Walsh,et al.  Handbook of satisfiability , 2009 .

[22]  Edmund K. Burke,et al.  A supernodal formulation of vertex colouring with applications in course timetabling , 2007, Ann. Oper. Res..

[23]  Robert Nieuwenhuis,et al.  Curriculum-based course timetabling with SAT and MaxSAT , 2012, Ann. Oper. Res..

[24]  Barry McCollum,et al.  The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3) — preliminary presentation — , 2007 .

[25]  Martin Gebser,et al.  Answer Set Solving in Practice , 2012, Answer Set Solving in Practice.

[26]  Amnon Meisels,et al.  Hybrid search for minimal perturbation in Dynamic CSPs , 2011, Constraints.

[27]  Mutsunori Banbara,et al.  Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation , 2017, CP.

[28]  Jasbir S. Arora,et al.  Survey of multi-objective optimization methods for engineering , 2004 .

[29]  Edmund K. Burke,et al.  The practice and theory of automated timetabling , 2014, Ann. Oper. Res..

[30]  Katsumi Inoue,et al.  Answer set programming as a modeling language for course timetabling , 2013, Theory Pract. Log. Program..

[31]  Roman Barták,et al.  A New Approach to Modeling and Solving Minimal Perturbation Problems , 2003, CSCLP.

[32]  Paolo Toth,et al.  An overview of curriculum-based course timetabling , 2015 .

[33]  Carsten Sinz,et al.  Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.

[34]  Katsumi Inoue,et al.  Utilitarian and Egalitarian Solutions for Multi-objective Constraint Optimization , 2014, 2014 IEEE 26th International Conference on Tools with Artificial Intelligence.

[35]  Luca Di Gaspero,et al.  Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems , 2006, J. Math. Model. Algorithms.

[36]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[37]  Matthias Ehrgott,et al.  Integer programming for minimal perturbation problems in university course timetabling , 2017, Ann. Oper. Res..

[38]  Edmund K. Burke,et al.  On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling , 2007, ArXiv.

[39]  Luca Di Gaspero,et al.  Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results , 2012, Ann. Oper. Res..

[40]  Michael Gelfond,et al.  Applications of Answer Set Programming , 2016, AI Mag..

[41]  Ben Paechter,et al.  Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition , 2010, INFORMS J. Comput..

[42]  Barry McCollum,et al.  A Perspective on Bridging the Gap Between Theory and Practice in University Timetabling , 2006, PATAT.

[43]  Martin Gebser,et al.  Domain-Specific Heuristics in Answer Set Programming , 2013, AAAI.

[44]  Alex M. Andrew,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2004 .

[45]  Niklas Sörensson,et al.  Temporal induction by incremental SAT solving , 2003, BMC@CAV.

[46]  Torsten Schaub,et al.  Unsatisfiability-based optimization in clasp , 2012, ICLP.

[47]  Kevin Leyton-Brown,et al.  Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.

[48]  Luca Di Gaspero,et al.  Multi-neighbourhood Local Search with Application to Course Timetabling , 2002, PATAT.

[49]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[50]  Edmund K. Burke,et al.  Decomposition, reformulation, and diving in university course timetabling , 2009, Comput. Oper. Res..

[51]  Tu,et al.  Representing School Timetabling in a DisjunctiveLogic Programming Language , 1998 .