Scatter search technique for exam timetabling

LAUR Repository

Show simple item record

dc.contributor.author Mansour, Nashat
dc.contributor.author Isahakian, Vatche
dc.contributor.author Ghalayini, Iman
dc.date.accessioned 2016-01-26T07:38:41Z
dc.date.available 2016-01-26T07:38:41Z
dc.date.copyright 2011
dc.date.issued 2016-01-26
dc.identifier.issn 0924-669X en_US
dc.identifier.uri http://hdl.handle.net/10725/2952
dc.description.abstract At universities where students enjoy flexibility in selecting courses, the Registrar’s office aims to generate an appropriate exam timetable for numerous courses and large number of students. An appropriate, real-world exam timetable should show fairness towards all students, respecting the following constraints: (a) eliminating or minimizing the number of simultaneous exams; (b) minimizing the number of consecutive exams; (c) minimizing the number of students with two or three exams per day (d) eliminating the possibility of more than three exams per day (e) exams should fit in rooms with predefined capacity; and (f) the number of exam periods is limited. These constraints are conflicting, which makes exam timetabling intractable. Hence, solving this problem in realistic time requires the use of heuristic approaches. In this work, we develop an evolutionary heuristic technique based on the scatter search approach for finding good suboptimal solutions for exam timetabling. This approach is based on maintaining and evolving a population of solutions. We evaluate our suggested technique on real-world university data and compare our results with the registrar’s manual timetable in addition to the timetables of other heuristic optimization algorithms. The experimental results show that our adapted scatter search technique generates better timetables than those produced by the registrar, manually, and by other meta-heuristics. en_US
dc.language.iso en en_US
dc.title Scatter search technique for exam timetabling en_US
dc.type Article en_US
dc.description.version Published en_US
dc.author.school SAS en_US
dc.author.idnumber 198629170 en_US
dc.author.woa N/A en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.relation.journal Applied Intelligence en_US
dc.journal.volume 34 en_US
dc.journal.issue 2 en_US
dc.article.pages 299-310 en_US
dc.keywords Evolutionary algorithm en_US
dc.keywords Exam timetabling en_US
dc.keywords Meta-heuristics en_US
dc.keywords Multi-criteria optimization en_US
dc.keywords Scatter search en_US
dc.identifier.doi http://dx.doi.org/10.1007/s10489-009-0196-5 en_US
dc.identifier.ctation Mansour, N., Isahakian, V., & Ghalayini, I. (2011). Scatter search technique for exam timetabling. Applied Intelligence, 34(2), 299-310. en_US
dc.author.email nmansour@lau.edu.lb
dc.identifier.url http://link.springer.com/article/10.1007/s10489-009-0196-5

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account