Domain transformation approach to deterministic optimization of examination timetables

Siti Khatijah Nor Abdul Rahim, Andrzej Bargiela, Rong Qu

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.


Full Text: PDF DOI: 10.5430/air.v2n1p122

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Artificial Intelligence Research

ISSN 1927-6974 (Print)   ISSN 1927-6982 (Online)

Copyright © Sciedu Press 
To make sure that you can receive messages from us, please add the 'Sciedu.ca' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.