Scatter search technique for exam timetabling

  • Authors:

  • Nashat Mansour;Vatche Isahakian;Iman Ghalayini

  • Affiliations:

  • Dept. of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon;Dept. of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon and Dept. of Computer Science, Boston University, Boston, USA;Dept. of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon

  • Venue:
  • Applied Intelligence
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.