A matheuristic for exam timetabling - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

A matheuristic for exam timetabling

Résumé

Exam timetabling is a tedious task faced in universities. We present a matheuristic to solve the exam timetabling problem related to the Toronto benchmark. We propose first a non-linear formulation used to find an initial feasible solution. We briefly describe a former linear formulation and introduce a new compact linear formulation. This compact formulation drastically reduces by 99% the numbers of variables and constraints. We propose a matheuristic based on both formulations to solve the problem. The approach achieves better results when compared to existing mathematical-programming-based heuristics.

Dates et versions

hal-01397216 , version 1 (15-11-2016)

Identifiants

Citer

Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim. A matheuristic for exam timetabling. FAC Conference on Manufacturing Modelling, Management and Control , Université de Technologie de Troyes, Jun 2016, Troyes, France. pp.1289-1294, ⟨10.1016/j.ifacol.2016.07.701⟩. ⟨hal-01397216⟩
60 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More