Domain transformation approach to deterministic optimization of examination timetables
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Sciedu Press
2013
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/28280/ |
| _version_ | 1848793541888704512 |
|---|---|
| author | Abdul Rahim, Siti Bargiela, Andrzej Qu, Rong |
| author_facet | Abdul Rahim, Siti Bargiela, Andrzej Qu, Rong |
| author_sort | Abdul Rahim, Siti |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T19:01:57Z |
| format | Article |
| id | nottingham-28280 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:01:57Z |
| publishDate | 2013 |
| publisher | Sciedu Press |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-282802020-05-04T20:19:45Z https://eprints.nottingham.ac.uk/28280/ Domain transformation approach to deterministic optimization of examination timetables Abdul Rahim, Siti Bargiela, Andrzej Qu, Rong 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. Sciedu Press 2013 Article PeerReviewed Abdul Rahim, Siti, 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 Examination timetabling Optimization Slots permutations Reassigning exams http://www.sciedu.ca/journal/index.php/air/article/view/1664 doi:10.5430/air.v2n1p122 doi:10.5430/air.v2n1p122 |
| spellingShingle | Examination timetabling Optimization Slots permutations Reassigning exams Abdul Rahim, Siti Bargiela, Andrzej Qu, Rong Domain transformation approach to deterministic optimization of examination timetables |
| title | Domain transformation approach to deterministic optimization of examination timetables |
| title_full | Domain transformation approach to deterministic optimization of examination timetables |
| title_fullStr | Domain transformation approach to deterministic optimization of examination timetables |
| title_full_unstemmed | Domain transformation approach to deterministic optimization of examination timetables |
| title_short | Domain transformation approach to deterministic optimization of examination timetables |
| title_sort | domain transformation approach to deterministic optimization of examination timetables |
| topic | Examination timetabling Optimization Slots permutations Reassigning exams |
| url | https://eprints.nottingham.ac.uk/28280/ https://eprints.nottingham.ac.uk/28280/ https://eprints.nottingham.ac.uk/28280/ |