Abstract
This paper studies a multi-objective instance of the university exam timetabling problem. On top of satisfying universal hard constraints such as seating capacity and no overlapping exams, the solution to this problem requires the minimization of the timetable length as well as the number of occurrences of students having to take exams in consecutive periods within the same day. While most existing approaches to the problem, as well as the more popular single-objective instance, require prior knowledge of the desired timetable length, the multi-objective evolutionary algorithm proposed in this paper is able to generate feasible solutions even without the information. The effectiveness of the proposed algorithm is benchmarked against a few recent and established optimization techniques and is found to perform well in comparison. © 2007 IEEE.
| Original language | English |
|---|---|
| Title of host publication | 2007 IEEE Symposium on Computational Intelligence in Scheduling |
| Publisher | IEEE |
| Pages | 165-172 |
| ISBN (Print) | 1-4244-0704-4 |
| DOIs | |
| Publication status | Published - Apr 2007 |
| Externally published | Yes |
| Event | 2007 IEEE Symposium on Computational Intelligence in Scheduling (CI-Sched 2007) - Honolulu, United States Duration: 1 Apr 2007 → 5 Apr 2007 |
Conference
| Conference | 2007 IEEE Symposium on Computational Intelligence in Scheduling (CI-Sched 2007) |
|---|---|
| Place | United States |
| City | Honolulu |
| Period | 1/04/07 → 5/04/07 |
Fingerprint
Dive into the research topics of 'Solving the exam timetabling problem via a multi-objective evolutionary algorithm - A more general approach'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver