Three heuristics to solve Timetabling

Authors:
Juan Frausto-Solís;Federico Alonso-Pecina;Monica Larre;Cinhtia M. González-Segura;José Luis Gómez-Ramos
Affiliations:
Instituto Tecnológico y de Estudios Superiores de Monterrey, Cuernavaca;Instituto Tecnológico y de Estudios Superiores de Monterrey, Cuernavaca;Instituto Tecnológico y de Estudios Superiores de Monterrey Campus, Cuernavaca;Universidad Autónoma de Yucatán;Universidad Juárez Autónoma de Tabasco
Venue:
ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
Year:
2006

Citing 8
Cited 0

Constructing school timetables using simulated annealing: sequential and parallel algorithms

Management Science
A constraint-based approach to high-school timetabling problems: a case study

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
New methods to color the vertices of a graph

Communications of the ACM
Graph coloring conditions for the existence of solutions to the timetable problem

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Survey of Automated Timetabling

Artificial Intelligence Review
A MAX-MIN Ant System for the University Course Timetabling Problem

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work deals with one relevant problem in nowadays: the Educational Timetabling (ET). This problem consists in schedule meetings among teachers, and students, in a fixed time. Our work deals the problem with three heuristics very well known: Genetic Algorithms, Tabu Search and Simulated Annealing. This paper presents Timetabling's results using instances of the benchmark of PATAT, and an analysis about the behavior of the three methods is presented; the experimentation shows that Simulated Annealing and then Tabu Search Outperforms the implementation of Genetic Algorithms.