Multiple-Retrieval Case-Based Reasoning for Course Timetabling Problems

Burke, Edmund and MacCarthy, Bart and Petrovic, Sanja and Qu, Rong (2005) Multiple-Retrieval Case-Based Reasoning for Course Timetabling Problems. Journal of Operations Research Society, 57 (2). pp. 148-162.

WarningThere is a more recent version of this item available.

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

Abstract

The structured representation of cases by attribute graphs in a Case-Based Reasoning (CBR) system for course timetabling has been the subject of previous research by the authors. In that system, the case base is organised as a decision tree and the retrieval process chooses those cases which are sub attribute graph isomorphic to the new case. The drawback of that approach is that it is not suitable for solving large problems. This paper presents a multiple-retrieval approach that partitions a large problem into small solvable sub-problems by recursively inputting the unsolved part of the graph into the decision tree for retrieval. The adaptation combines the retrieved partial solutions of all the partitioned sub-problems and employs a graph heuristic method to construct the whole solution for the new case. We present a methodology which is not dependant upon problem specific information and which, as such, represents an approach which underpins the goal of building more general timetabling systems. We also explore the question of whether this multiple-retrieval CBR could be an effective initialisation method for local search methods such as Hill Climbing, Tabu Search and Simulated Annealing. Significant results are obtained from a wide range of experiments. An evaluation of the CBR system is presented and the impact of the approach on timetabling research is discussed. We see that the approach does indeed represent an effective initialisation method for these approaches.

Item Type:Article
Uncontrolled Keywords:Timetabling problems, Case-Based Reasoning, Attribute graph, Scheduling problems, Hill climbing, Tabu search, Simulate annealing, Graph heuristic method
Schools/Departments:Faculty of Science > School of Computer Science and Information Technology
ID Code:347
Deposited By:Qu, Rong
Deposited On:12 Dec 2005
Last Modified:09 Nov 2007 12:26

Available Versions of this Item

Repository Staff Only: item control page