Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm

Authors:
Zhipeng Lü;Jin-Kao Hao
Affiliations:
LERIA, Université d'Angers, Angers Cedex 01, France 49045 and School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China 430074;LERIA, Université d'Angers, Angers Cedex 01, France 49045
Venue:
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Year:
2008

Citing 5
Cited 0

Algorithms (2nd ed.)

Algorithms (2nd ed.)
Tabu Search

Tabu Search
The Complexity of Timetable Construction Problems

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
An effective hybrid algorithm for university course timetabling

Journal of Scheduling
A perspective on bridging the gap between theory and practice in university timetabling

PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptive Tabu Search---ATS), which is aimed at minimizing violations of soft constraints. Within ATS, a new neighborhood and a mechanism for dynamically integrating Tabu Search with perturbation (from Iterated Local Search) are proposed to ensure a continuous tradeoff between intensification and diversification. The performance of the proposed hybrid heuristic algorithm is assessed on two sets of 11 public instances from the literature. Computational results show that it significantly improves the previous best known results on two problem formulations.