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

Burke, Edmund; MacCarthy, Bart L.; Petrovic, Sanja; Qu, Rong

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.

Citation

Burke, E., MacCarthy, B. L., Petrovic, S., & Qu, R. (2001). Case-based reasoning in course timetabling: an attribute graph approach.

• Conference Name: International Conference on Case-Based Reasoning
• Publication Date: Jan 1, 2001
• Deposit Date: Dec 12, 2005
• Publicly Available Date: Oct 9, 2007
• Peer Reviewed: Peer Reviewed
• Public URL: https://nottingham-repository.worktribe.com/output/1023235