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

Authors:
Haroldo G. Santos;Luiz S. Ochi;Marcone J.F. Souza
Affiliations:
Universidade Federal Fluminense, Rio de Janeiro, Brazil;Universidade Federal Fluminense, Rio de Janeiro, Brazil;Universidade Federal de Ouro Preto, Ouro Preto, Brazil
Venue:
Journal of Experimental Algorithmics (JEA)
Year:
2005

Citing 12
Cited 2

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Constructing school timetables using simulated annealing: sequential and parallel algorithms

Management Science
A tabu search heuristic for the vehicle routing problem

Management Science
Metaheuristics for High School Timetabling

Computational Optimization and Applications
Tabu Search

Tabu Search
Probability Distribution of Solution Time in GRASP: An Experimental Investigation

Journal of Heuristics
A Hybrid Genetic Algorithm for School Timetabling

AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Off-the-Peg or Made-to-Measure? Timetabling and Scheduling with SA and TS

PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
A GRASP-tabu search algorithm for solving school timetabling problems

Metaheuristics
Solving the uncapacitated facility location problem using tabu search

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Heuristic-biased stochastic sampling

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Local search techniques for large high school timetabling problems

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

An informed genetic algorithm for the high school timetabling problem

SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
Parallelizing a CLIPS-based course timetabling expert system

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Class/Teacher Timetabling Problem (CTTP) deals with the weekly scheduling of encounters between teachers and classes of an educational institution. Since CTTP is a NP-hard problem for nearly all of its variants, the use of heuristic methods for its resolution is justified. This paper presents an efficient Tabu Search (TS) heuristic with two different memory based diversification strategies for CTTP. Results obtained through an application of the method to a set of real world problems show that it produces better solutions than a previously proposed TS found in the literature and faster times are observed in the production of good quality solutions.