Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
| Titre | Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm |
| Type de publication | Communication |
| Type | Communication avec actes dans un congrès |
| Année | 2008 |
| Langue | Anglais |
| Date du colloque | 2008 |
| Titre du colloque | 13th International Conference, AIMSA 2008 |
| Titre des actes ou de la revue | Artificial Intelligence: Methodology, Systems, and Applications |
| Volume | 5253 |
| Pagination | 262 - 273 |
| Auteur | Lü, Zhipeng, Hao, Jin-Kao |
| Pays | Bulgarie |
| Editeur | Springer |
| Ville | Varna |
| ISBN | 978-3-540-85775-4 / 978-3-540-85776-1 |
| Mots-clés | Artificial 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. |
| Notes | Date du colloque : 09/2008 |
| URL de la notice | http://okina.univ-angers.fr/publications/ua4489 |
| DOI | 10.1007/978-3-540-85776-1_22 |
| Lien vers le document en ligne |