Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Tabu Search Techniques for Examination Timetabling
| |
|
Tabu Search Techniques for Examination Timetabling
Luca Di Gaspero6  and Andrea Schaerf7
| (6) |
Dipartimento di Ingegneria Elettrica, Gestionale e Meccanica, Università degli Studi di Udine, via delle Scienze 208, I-33100 Udine, Italy |
| (7) |
Dipartimento di Matematica e Informatica, Università degli Studi di Udine, via delle Scienze 206, I-33100 Udine, Italy |
Abstract
The Examination Timetabling problem regards the scheduling for the exams of a set of universitycourses, avoiding the overlapping
of exams having students in common, fairly spreading the exams for the students, and satisfying room capacity constraints.
We present a familyof solution algorithms for a set of variants of the Examination Timetabling problem. The algorithms are
based on tabu search, and theyimp ort several features from the research on the Graph Colouring problem.
Our algorithms are tested on both public benchmarks and random instances, and theyare compared with previous results in the
literature. The comparison shows that the presented algorithms performs as well as constructive methods and memetic algorithms,
and onlya decomposition based approach outperforms them in most cases.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|