A hybrid Ant Colony Algorithm for the exam timetabling problem

Abstract : Due to increased student numbers and regulation changes educational institutions that allow for greater flexibility, operations researchers and computer scientists have renewed their interest in developing effective methods to resolve the examination timetabling problem. Thus, in the intervening decades, important progress was made in the examination timetabling problem with appearance of adaptation of meta-heuristics. This paper presents a hybridization of the Ant Colony Algorithm and a Complete Local search with Memory heuristic, in order to maximize as much as possible; the free time between consecutive exams for each student, while respecting the conflict constraints, a student cannot sit more than one exam in the same timeslot.
Document type :
Journal articles
Complete list of metadatas

Cited literature [51 references]  Display  Hide  Download

https://hal.inria.fr/hal-01286691
Contributor : Coordination Episciences Iam <>
Submitted on : Friday, March 11, 2016 - 11:36:47 AM
Last modification on : Thursday, July 4, 2019 - 3:56:03 PM
Long-term archiving on : Sunday, November 13, 2016 - 3:26:48 PM

File

Vol.12.pp.15-42.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01286691, version 1

Collections

Citation

R. Abounacer, J. Boukachour, B. Dkhissi, A. El Hilali Alaoui. A hybrid Ant Colony Algorithm for the exam timetabling problem. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2010, 12, pp.15-42. ⟨hal-01286691⟩

Share

Metrics

Record views

134

Files downloads

1503