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 organized as a decision tree and the retrieval process chooses those cases that 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 dependent 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 initialization 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 initialization method for these approaches.
|
309
|
Case-based reasoning: Foundational issues, methodological variations, and system approaches
– Aamodt, Plaza
- 1994
|
|
110
|
A survey of automated timetabling
– Schaerf
- 1999
|
|
95
|
introduction to Timetabling
– Werra
- 1985
|
|
60
|
Dowsland: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
– Aickelin, K
|
|
58
|
Recent research directions in automated timetabling
– Burke, Petrovic
- 2002
|
|
57
|
Constructing School Timetables using Simulated Annealing: Sequential and Parallel Algorithms
– Abramson
- 1991
|
|
56
|
Newall: A multi-stage evolutionary algorithm for the timetabling problem
– Burke, P
- 1999
|
|
50
|
A Tabu-Search Hyper-heuristic for Timetabling and Rostering
– Burke, Kendall, et al.
- 2003
|
|
48
|
Tabu search techniques for large high-school timetabling problems
– Schaerf
- 1996
|
|
48
|
Case based Reasoning
– Kolodner
- 1993
|
|
41
|
Recent developments in practical course timetabling
– Carter, Laporte
- 1998
|
|
41
|
editors. Practice and Theory of Automated Timetabling
– Burke, Ross
- 1996
|
|
40
|
Recent developments in practical examination timetabling. The Practice and Theory of Automated Timetabling I: Selected Papers from
– Carter, Laporte
- 1996
|
|
36
|
CABINS: A framework of knowledge acquisition and iterative revision for schedule improvement and reactive repair
– Miyashita, Sycara
- 1995
|
|
31
|
Comparison of Annealing techniques for Academic Course Scheduling
– Saleh, Coddington
- 1998
|
|
30
|
A Tabu Search algorithm for computing an operational timetable
– Costa
- 1994
|
|
30
|
Applying Case-Based Reasoning to Autoclave Loading
– Hennessy, Hinkle
- 1992
|
|
29
|
Computer-aided school and university timetabling: a new wave. The Practice and Theory of Automated Timetabling I: Selected Papers from
– Bardadym
- 1996
|
|
24
|
A tabu search approach to the constraint satisfaction problem as a general problem solver
– Nonobe, Ibaraki
- 1998
|
|
18
|
Case-based reasoning for production scheduling
– Schmidt
- 1998
|
|
17
|
Case-based reasoning in scheduling: reusing solution components
– Cunningham, Smyth
- 1997
|
|
14
|
A max-min ant system for the university course timetabling problem
– Socha, Knowles, et al.
- 2002
|
|
9
|
Initialisation Strategies and Diversity in Evolutionary Timetabling
– Burke, Newall, et al.
- 1998
|
|
9
|
A decomposition algorithm for practical timetabling problems
– Carter
- 1983
|
|
8
|
A time-predefined approach to course timetabling
– Burke, Bykov, et al.
- 2003
|
|
8
|
Case-Based Reasoning: An Overview
– Mántaras, Plaza
- 1997
|
|
7
|
A lagrangian relaxation approach to the classroom assignment problem
– Carter
- 1986
|
|
7
|
Convergence of a hill-climbing genetic algorithm for graph matching
– Cross, Myers, et al.
- 2000
|
|
6
|
Methods and Systems for Case Retrieval Exploiting the Case Structure. FABEL--Report 39, Gesellschaft fur Mathematik und Datenverarbeitung mbH, Forschungsbereich Kunstliche Intelligenz
– Gebhardt
- 1995
|
|
5
|
Complexity of some special types of timetabling problems
– Werra, Asratian, et al.
- 2002
|
|
5
|
R.: Structured cases in CBR – re-using and adapting cases for timetabling problems
– Burke, MacCarthy, et al.
- 2000
|
|
5
|
Case-based reasoning: A categorised bibliography
– Marir, Watson
- 1994
|
|
5
|
Combining case-based reasoning and constraint logic programming techniques for packaged nurse rostering systems
– Scott, Simpson, et al.
- 1997
|
|
5
|
The University Course Timetabling Problem with a 3-phase approach
– Kostuch
- 2004
|
|
4
|
A novel approach to finding feasible solutions to personnel rostering problems
– Beddoe, Petrovic
- 2003
|
|
4
|
Collaborative Case-Based Reasoning
– McGinty, Smyth
- 2001
|
|
3
|
De Causmaecker P, Vanden Berghe G and Van Landeghem H
– Burke
- 2004
|
|
3
|
A Tabu Search for Computing an Operational Timetable
– Costa
- 1994
|
|
3
|
Massively parallel support for case-based planning
– WA, MP, et al.
- 1994
|
|
2
|
Cowling P., De Causmaecker P., Vanden Berghe G
– Burke
- 2001
|
|
2
|
A learning reactive scheduler using CBR/L
– Szelke, Markus
- 1997
|
|
2
|
Automated examination timetabling
– RF
- 1995
|
|
2
|
Survey on structure-based case retrieval. The Knowledge Engineering Review
– Gebhardt
- 1997
|
|
1
|
A and Rousseau J-M
– Wren
- 1995
|
|
1
|
Nemhauser G and Trick M (2004). Sports scheduling
– Easton
|
|
1
|
Lim A and Rodrigues B (2003). Nurse rostering problems—a bibliographic survey. Eur JOpl Res 151
– Cheang, Li
|
|
1
|
de Causmaecker P (2002). The Practice and Theory of Automated Timetabling
– Burke
|
|
1
|
Trick M (eds) (2004). The
– Burke
|
|
1
|
E and Petrovic S(2002). Recent research directions in automated timetabling. Eur JOpl Res 140
– Burke
|
|
1
|
University timetabling. In: Leung J (ed). Handbook of Scheduling: Algorithms, Models, and Performance Analysis, Chapter 45
– E
- 2004
|
