Case-based reasoning in course timetabling: an attribute graph approach

Burke, Edmund and MacCarthy, Bart L. and Petrovic, Sanja and Qu, Rong (2001) Case-based reasoning in course timetabling: an attribute graph approach. In: International Conference on Case-Based Reasoning, Jul 2001, Vancouver, Sanada.

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

Abstract

An earlier Case-based Reasoning (CBR) approach developed by the authors for educational course timetabling problems employed structured cases to represent the complex relationships between courses. Previous solved cases represented by attribute graphs were organized hierarchically into a decision tree. The retrieval searches for graph isomorphism among these attribute graphs. In this paper, the approach is further developed to solve a wider range of problems. We also attempt to retrieve those graphs that have common similar structures but also have some differences. Costs that are assigned to these differences have an input upon the similarity measure. A large number of experiments are performed consisting of different randomly produced timetabling problems and the results presented here strongly indicate that a CBR approach could provide a significant step forward in the development of automated system to solve difficult timetabling problems. They show that using relatively little effort, we can retrieve these structurally similar cases to provide high quality timetables for new timetabling problems.

Item Type:Conference or Workshop Item (Paper)
Schools/Departments:Faculty of Science > School of Computer Science
ID Code:357
Deposited By:Qu, Rong
Deposited On:12 Dec 2005
Last Modified:21 Feb 2013 18:07

Repository Staff Only: item control page