Case Based Heuristic Selection for Timetabling Problems

Burke, Edmund and Petrovic, Sanja and Qu, Rong (2006) Case Based Heuristic Selection for Timetabling Problems. Journal of Scheduling, 9 (2). pp. 115-132. ISSN 1094-6136

This is the latest version of this item.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
155Kb

Official URL: http://springerlink.metapress.com/content/u384473118wl6213/fulltext.pdf

Abstract

This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solving the problem in hand. Knowledge discovery techniques are employed in two distinct scenarios. Firstly, we model the problem and the problem solving situations along with specific heuristics for those problems. Secondly, we refine the case base and discard cases which prove to be non-useful in solving new problems. Experimental results are presented and analyzed. It is shown that case based reasoning can act effectively as an intelligent approach to learn which heuristics work well for particular timetabling situations. We conclude by outlining and discussing potential research issues in this critical area of knowledge discovery for different difficult timetabling problems.

Item Type:Article
Additional Information:The original publication is available at www.springerlink.com
Uncontrolled Keywords:case based reasoning, course timetabling, exam timetabling, graph heuristics, knowledge discovery, meta-heuristics
Schools/Departments:Faculty of Science > School of Computer Science and Information Technology
ID Code:473
Deposited By:Qu, Rong
Deposited On:27 Feb 2007
Last Modified:09 Nov 2007 11:56

Available Versions of this Item

Repository Staff Only: item control page