Domain transformation approach to deterministic optimization of examination timetables

Abdul Rahim, Siti and Bargiela, Andrzej and Qu, Rong (2013) Domain transformation approach to deterministic optimization of examination timetables. Artificial Intelligence Research, 2 (1). pp. 122-138. ISSN 1927-6974

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution.
Download (775kB) | Preview

Abstract

In this paper we introduce a new optimization method for the examinations scheduling problem. Rather than attempting direct optimization of assignments of exams to specific time-slots, we perform permutations of slots and reassignments of exams upon the feasible (but not optimal) schedules obtained by the standard graph colouring method with Largest Degree ordering. The proposed optimization methods have been evaluated on the University of Toronto, University of Nottingham and International Timetabling Competition (ITC2007) datasets. It is shown that the proposed method delivers competitive results compared to other constructive methods in the timetabling literature on both the Nottingham and Toronto datasets, and it maintains the same optimization pattern of the solution improvement on the ITC2007 dataset. A deterministic pattern obtained for all benchmark datasets, makes the proposed method more understandable to the users.

Item Type: Article
Keywords: Examination timetabling, Optimization, Slots permutations, Reassigning exams
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.5430/air.v2n1p122
Depositing User: Qu, Rong
Date Deposited: 26 Feb 2015 15:48
Last Modified: 14 Sep 2016 17:27
URI: http://eprints.nottingham.ac.uk/id/eprint/28280

Actions (Archive Staff Only)

Edit View Edit View