A GRASP-tabu search algorithm for solving school timetabling problems

Authors:
Marcone Jamilson Freitas Souza;Nelson Maculan;Luis Satoru Ochi
Affiliations:
Department of Computer Science, Federal University of Ouro Preto, Ouro Preto, MG Brazil;Systems Engineering and Computer Science Program, Federal University of Rio de Janeiro, Rio de Janeiro, RJ Brazil;Department of Computer Science, Fluminense Federal University, Niterói, RJ Brazil
Venue:
Metaheuristics
Year:
2004

Citing 5
Cited 2

Constructing school timetables using simulated annealing: sequential and parallel algorithms

Management Science
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Metaheuristics for High School Timetabling

Computational Optimization and Applications
Tabu Search

Tabu Search
Tabu search techniques for large high-school timetabling problems

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem

Journal of Experimental Algorithmics (JEA)
A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a hybrid approach to solve school timetabling problems. This approach is a GRASP that uses a partially greedy procedure to construct an initial solution and attempts to improve the constructed solution using Tabu Search. When an infeasible solution without overlapping classes is generated, a procedure called Intraclasses-Interclasses is activated, trying to retrieve feasibility. If successful, it is reactivated, in an attempt to improve the timetable's compactness as well as other requirements. Computational results show that the Intraclasses-Interclasses procedure speeds up the process of obtaining better quality solutions.