Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm

TitreSolving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Type de publicationCommunication
TypeCommunication avec actes dans un congrès
Date du colloque2008
Titre du colloque13th International Conference, AIMSA 2008
Titre des actes ou de la revueArtificial Intelligence: Methodology, Systems, and Applications
Pagination262 - 273
AuteurLü, Zhipeng, Hao, Jin-Kao
ISBN978-3-540-85775-4 / 978-3-540-85776-1
Mots-clésArtificial Intelligence (incl. Robotics), constraint solving, Data Mining and Knowledge Discovery, Database Management, hybrid heuristic, Information Storage and Retrieval, Information Systems Applications (incl.Internet), iterated local search, tabu search, Timetabling
Résumé en anglais

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.


Date du colloque : 09/2008

URL de la notice
Lien vers le document en ligne