An Analysis Framework for Examination Timetabling. - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

An Analysis Framework for Examination Timetabling.

Résumé

An examination timetabling problem taken from real world universities was proposed at the International Timetabling Competition (ITC2007). The aim was to establish a common base for comparing different solution approaches. This paper presents new preprocessing methods that disclose hidden constraints and significantly increase the number of new edges that can be added to the conflict graph. Results show that the size of the maximum clique of the obtained conflict graph has been more than doubled for two instances as a result of our preprocessing. These larger cliques mean that instances can be analyzed in advance of a solution and end users gain useful information for making decisions. In addition, we have looked at the different criteria that compose the objective function, in order to provide more useful insights into the difficulty of problems in practice. We propose new integer programming formulations using clique inequalities to compute optimal solutions for 4 criteria and to obtain lower bounds for the 3 others. Results are presented and discussed for all the benchmark instances
Fichier principal
Vignette du fichier
AnalysisFrameworkExaminationTimetabling_Arbaoui_Boufflet_Moukrim_SoCS2013.pdf (133.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00917107 , version 1 (12-12-2013)

Identifiants

  • HAL Id : hal-00917107 , version 1

Citer

Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim. An Analysis Framework for Examination Timetabling.. Symposium on Combinatorial Search, Jul 2013, Leavenworth, United States. pp.11-19. ⟨hal-00917107⟩
116 Consultations
122 Téléchargements

Partager

Gmail Facebook X LinkedIn More