Tabu search techniques for large high-school timetabling problems
Conference
·
OSTI ID:430681
- Universita di Roma, Rome (Italy)
The high-school timetabling problem consists in assigning all the lectures of a high school to the time periods in such a way that no teacher (or class) is involved in more than one lecture at a time and other side constraints are satisfied. The problem is NP-complete and is usually tackled using heuristic methods. This paper describes a solution algorithm (and its implementation) based on Tabu Search. The algorithm interleaves different types of moves and makes use of an adaptive relaxation of the hard constraints. The implementation of the algorithm has been successfully experimented in some large high schools with various kinds of side constraints.
- OSTI ID:
- 430681
- Report Number(s):
- CONF-960876--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Linking search space structure, run-time dynamics, and problem difficulty : a step toward demystifying tabu search.
Tabu search applied to a capacitated location problem
Tabu search: Improved solution alternatives
Journal Article
·
Wed Sep 01 00:00:00 EDT 2004
· Proposed for publication in the Journal of Artificial Intelligence Research.
·
OSTI ID:951734
Tabu search applied to a capacitated location problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35878
Tabu search: Improved solution alternatives
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36064