Please use this identifier to cite or link to this item:
Title: A multi-objective evolutionary algorithm for examination timetabling
Authors: Cheong, C.Y.
Tan, K.C. 
Veeravalli, B. 
Keywords: Combinatorial problems
Evolutionary algorithms
Exam timetabling problem
Multi-objective optimization
Issue Date: Apr-2009
Citation: Cheong, C.Y., Tan, K.C., Veeravalli, B. (2009-04). A multi-objective evolutionary algorithm for examination timetabling. Journal of Scheduling 12 (2) : 121-146. ScholarBank@NUS Repository.
Abstract: This paper considers the scheduling of exams for a set of university courses. The solution to this exam timetabling problem involves the optimization of complete timetables such that there are as few occurrences of students having to take exams in consecutive periods as possible but at the same time minimizing the timetable length and satisfying hard constraints such as seating capacity and no overlapping exams. To solve such a multi-objective combinatorial optimization problem, this paper presents a multi-objective evolutionary algorithm that uses a variable-length chromosome representation and incorporates a micro-genetic algorithm and a hill-climber for local exploitation and a goal-based Pareto ranking scheme for assigning the relative strength of solutions. It also imports several features from the research on the graph coloring problem. The proposed algorithm is shown to be a more general exam timetabling problem solver in that it does not require any prior information of the timetable length to be effective. It is also tested against a few influential and recent optimization techniques and is found to be superior on four out of seven publicly available datasets. © 2008 Springer Science+Business Media, LLC.
Source Title: Journal of Scheduling
ISSN: 10946136
DOI: 10.1007/s10951-008-0085-5
Appears in Collections:Staff Publications

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

Google ScholarTM



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