The consultation timetabling problem at Danish high schools

In the different stages of the educational system, the demand for efficient planning is increasing. This article treats the $$\mathcal NP $$NP-hard Consultation Timetabling Problem, a recurrent planning problem for the high schools in Denmark, which has not been described in the literature before. Two versions of the problem are considered, the Parental Consultation Timetabling Problem (PCTP) and the Supervisor Consultation Timetabling Problem (SCTP). It is shown that both problems can be modeled using the same Integer Programming model. Solutions are found using the state-of-the-art MIP solver Gurobi and Adaptive Large Neighborhood Search (ALNS), and computational results are established using 300 real-life datasets. These tests show that the developed ALNS algorithm is significantly outperforming both Gurobi and a currently applied heuristic for the PCTP. For both the PCTP and the SCTP, it is shown that the ALNS algorithm in average provides results within 5 % of optimum. The developed algorithm has been implemented in the commercial product Lectio, and is therefore available for approximately 95 % of the Danish high schools.

[1]  Edmund K. Burke,et al.  The practice and theory of automated timetabling , 2014, Annals of Operations Research.

[2]  Gerhard F. Post,et al.  A Case Study for Timetabling in a Dutch Secondary School , 2006, PATAT.

[3]  Barry McCollum,et al.  University Timetabling: Bridging the Gap between Research and Practice , 2006 .

[4]  Nelson Maculan,et al.  Strong bounds with cut and column generation for class-teacher timetabling , 2012, Ann. Oper. Res..

[5]  Mauro Birattari,et al.  An effective hybrid algorithm for university course timetabling , 2006, J. Sched..

[6]  Paul Shaw,et al.  A new local search algorithm providing high quality solutions to vehicle routing problems , 1997 .

[7]  Edmund Ph. D. Burke,et al.  Practice and theory of automated timetabling II : second International Conference, PATAT '97, Toronto, Canada, August 20-22, 1997 : selected papers , 1998 .

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

[9]  Mauro Birattari,et al.  Tuning Metaheuristics - A Machine Learning Perspective , 2009, Studies in Computational Intelligence.

[10]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling II , 1997, Lecture Notes in Computer Science.

[11]  Marcus Brunner,et al.  Self-Managing Distributed Systems , 2003, Lecture Notes in Computer Science.

[12]  Thomas Stützle,et al.  Off-line vs. On-line Tuning: A Study on MAX-MIN\mathcal{MAX--MIN} Ant System for the TSP , 2010, ANTS Conference.

[13]  Thomas R. Stidsen,et al.  Elective course planning , 2011, Eur. J. Oper. Res..

[14]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[15]  Bo Guo,et al.  The capacitated vehicle routing problem with stochastic demands and time windows , 2011, Comput. Oper. Res..

[16]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[17]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

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

[19]  Roberto Musmanno,et al.  An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands , 2010, Transp. Sci..

[20]  Gilbert Laporte,et al.  Recent Developments in Practical Course Timetabling , 1997, PATAT.

[21]  Mauro Birattari,et al.  Implementation Effort and Performance , 2007, SLS.

[22]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[23]  David Pisinger,et al.  Large Neighborhood Search , 2018, Handbook of Metaheuristics.

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

[25]  Laurent Flindt Muller,et al.  An Adaptive Large Neighborhood Search Algorithm for the Resource-constrained Project Scheduling Problem , 2009 .

[26]  Thomas Stützle,et al.  Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement , 2007, Hybrid Metaheuristics.

[27]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[28]  David Pisinger,et al.  A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times , 2012, Eur. J. Oper. Res..

[29]  Michel Gendreau,et al.  An Adaptive Large Neighborhood Search for a Vehicle Routing Problem with Multiple Trips , 2010 .

[30]  Matias Stidsen Sørensen,et al.  High School Timetabling: Modeling and solving a large number of cases in Denmark , 2013 .

[31]  Wilhelm Erben,et al.  A Genetic Algorithm Solving a Weekly Course-Timetabling Problem , 1995, PATAT.

[32]  Efthymios Housos,et al.  School timetabling for quality student and teacher schedules , 2009, J. Sched..

[33]  Keith S. Murray,et al.  Comprehensive approach to student sectioning , 2010, Ann. Oper. Res..

[34]  Yixin Diao,et al.  Generic Online Optimization of Multiple Configuration Parameters with Application to a Database Server , 2003, DSOM.

[35]  Guy Desaulniers,et al.  A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows , 2009 .

[36]  Yves Crama,et al.  An adaptive large neighborhood search for a vehicle routing problem with multiple trips and driver shifts , 2013 .

[37]  Thomas Stützle,et al.  Applications of Racing Algorithms: An Industrial Perspective , 2005, Artificial Evolution.

[38]  Bertrand Neveu,et al.  An evaluation of off-line calibration techniques for evolutionary algorithms , 2010, GECCO '10.

[39]  Glaydston Mattos Ribeiro,et al.  An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[40]  Mauro Birattari,et al.  The problem of tuning metaheuristics: as seen from the machine learning perspective , 2004 .

[41]  Principles and Practice of Constraint Programming — CP98 , 1999, Lecture Notes in Computer Science.

[42]  A. Tripathy.  School Timetabling---A Case in Large Binary Integer Linear Programming , 1984 .

[43]  Marc Schoenauer,et al.  Artificial Evolution , 2000, Lecture Notes in Computer Science.

[44]  Thomas Stützle,et al.  Off-line vs. on-line tuning: a study on MAX–MIN ant system for the TSP , 2010, ICSI 2010.

[45]  Manuel Laguna,et al.  Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search , 2006, Oper. Res..

[46]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling VI, 6th International Conference, PATAT 2006, Brno, Czech Republic, August 30 - September 1, 2006, Revised Selected Papers , 2007, PATAT.