Three-phase simulated annealing algorithms for exam scheduling
Scheduling of final exam usually results in conflicts and inconvenience. Conflicts occur when simultaneous exams are scheduled for the same student, and inconvenience to a student refers to consecutive exams or more than two exams on the same day. A good exam schedule should aim to minimize conflict...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferenceObject |
| Published: |
2003
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10725/7954 http://dx.doi.org/10.1109/AICCSA.2003.1227522 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://ieeexplore.ieee.org/abstract/document/1227522 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Scheduling of final exam usually results in conflicts and inconvenience. Conflicts occur when simultaneous exams are scheduled for the same student, and inconvenience to a student refers to consecutive exams or more than two exams on the same day. A good exam schedule should aim to minimize conflicts and the two inconvenience factors based on weight that are user-assigned to these three factors and subject to some constraints such as the number and capacities of classrooms. Scheduling final exams for large numbers of courses and students in universities is an intractable problem. We decompose the problem into three phases and propose simulated annealing algorithms for these phases. Hence, we refer to our solution methods as 3-phase simulated annealing (3PSA). We empirically compare 3PSA with a 4-phase clustering-based heuristic algorithm using realistic data. Our experimental results show that 3PSA produces good exam schedules, which are better than those of the clustering heuristic procedure. |
|---|