A GRASP strategy for a more constrained School Timetabling Problem

This work treats a more constrained School Timetabling Problem (STP). It consists of scheduling a set of lectures and teachers in a prefixed period of time, satisfying a set of operational requirements. We applied a Greedy Randomized Adaptive Search Procedure (GRASP) heuristic, combined with a path-relinking improvement. During execution of the GRASP heuristic, the local search procedure interleaves two types of movements. In addition, the path-relinking strategy was itself enhanced by a local search procedure. The algorithms were tested with real instances and proved to be good approaches to solve this problem. Although some restrictions are specific to Brazilian educational institutions, the same ideas can inspire similar approaches for solving the STP in other situations.

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

[2]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling V, 5th International Conference, PATAT 2004, Pittsburgh, PA, USA, August 18-20, 2004, Revised Selected Papers , 2005, PATAT.

[3]  Celso C. Ribeiro,et al.  Probability Distribution of Solution Time in GRASP: An Experimental Investigation , 2002, J. Heuristics.

[4]  Andrea Schaerf,et al.  Local search techniques for large high school timetabling problems , 1999, IEEE Trans. Syst. Man Cybern. Part A.

[5]  John Tartar,et al.  Graph coloring conditions for the existence of solutions to the timetable problem , 1974, CACM.

[6]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[7]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[8]  L. D. Gaspero,et al.  LOCAL SEARCH TECHNIQUES FOR EDUCATIONAL TIMETABLING PROBLEMS , 2001 .

[9]  David Abramson,et al.  Simulated Annealing Cooling Schedules for the School Timetabling Problem , 1999 .

[10]  M. Resende,et al.  GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES (GRASP) , 1999 .

[11]  Hsiao-Lan Fang,et al.  Genetic algorithms in timetabling and scheduling , 1995 .

[12]  Calvin C. Gotlieb,et al.  The Construction of Class-Teacher Time-Tables , 1962, IFIP Congress.

[13]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[14]  D. de Werra,et al.  Some experiments with a timetabling system , 1982 .

[15]  Panos M. Pardalos,et al.  GRASP with Path Relinking for Three-Index Assignment , 2005, INFORMS J. Comput..

[16]  Igor Vasil'ev,et al.  A computational study of local search algorithms for Italian high-school timetabling , 2007, J. Heuristics.

[17]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[18]  Humberto Cesar Brandao de Oliveira,et al.  The School Timetabling Problem: A Focus on Elimination of Open Periods and Isolated Classes , 2006, 2006 Sixth International Conference on Hybrid Intelligent Systems (HIS'06).

[19]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[20]  Andrea Schaerf,et al.  REPORT RAPPORT , 2022 .

[21]  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.

[22]  Nelson Maculan,et al.  A GRASP-tabu search algorithm for solving school timetabling problems , 2004 .

[23]  Marco Dorigo,et al.  Metaheuristics for High School Timetabling , 1998, Comput. Optim. Appl..

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

[25]  Gunther Schmidt,et al.  Timetable Construction - An Annotated Bibliography , 1980, Comput. J..