Please use this identifier to cite or link to this item: https://doi.org/10.1109/SCIS.2007.367685
Title: Solving the exam timetabling problem via a multi-objective evolutionary algorithm - A more general approach
Authors: Cheong, C.Y.
Tan, K.C. 
Veeravalli, B. 
Issue Date: 2007
Citation: Cheong, C.Y., Tan, K.C., Veeravalli, B. (2007). Solving the exam timetabling problem via a multi-objective evolutionary algorithm - A more general approach. Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007 : 165-172. ScholarBank@NUS Repository. https://doi.org/10.1109/SCIS.2007.367685
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.
Source Title: Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007
URI: http://scholarbank.nus.edu.sg/handle/10635/71815
ISBN: 1424407044
DOI: 10.1109/SCIS.2007.367685
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

10
checked on Nov 19, 2018

WEB OF SCIENCETM
Citations

2
checked on Nov 19, 2018

Page view(s)

17
checked on Aug 31, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.