Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm - Université d'Angers Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm

Zhipeng Lü
  • Fonction : Auteur

Résumé

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.

Dates et versions

hal-03350608 , version 1 (21-09-2021)

Identifiants

Citer

Zhipeng Lü, Jin-Kao Hao. Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm. 13th International Conference, AIMSA 2008, 2008, Varna, Bulgaria. pp.262 - 273, ⟨10.1007/978-3-540-85776-1_22⟩. ⟨hal-03350608⟩

Collections

UNIV-ANGERS LERIA
6 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More