Case-based reasoning for course timetabling problems
The research in this thesis investigates Case-Based Reasoning (CBR), a Knowledge-Based Reasoning technique that proved to be capable of providing good solutions in educational course timetabling problems. Following the basic idea behind CBR, experiences in solving previous similar timetabling proble...
| Main Author: | |
|---|---|
| Format: | Thesis (University of Nottingham only) |
| Language: | English |
| Published: |
2002
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/10020/ |
| _version_ | 1848791010471051264 |
|---|---|
| author | Qu, Rong |
| author_facet | Qu, Rong |
| author_sort | Qu, Rong |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | The research in this thesis investigates Case-Based Reasoning (CBR), a Knowledge-Based Reasoning technique that proved to be capable of providing good solutions in educational course timetabling problems. Following the basic idea behind CBR, experiences in solving previous similar timetabling problems are employed to find the solutions for new problems.
A basic CBR system that is hierarchically organized with structured knowledge representations by attribute graphs is proposed in Chapter Four. The system is then further improved to solve a wider range of problems, which is described in Chapter Five. Evaluations on a large number of experiments indicate that this approach could provide a significant step forward in timetabling and scheduling research.
This basic system works well on relatively small problems. To deal with this drawback a multiple-retrieval approach that partitions large timetabling problems into small solvable sub-problems is presented in Chapter Six. Good results are obtained from a wide range of experiments.
In Chapter Seven, a new idea is introduced in CBR for solving timetabling problems by investigating the approach to select the most appropriate heuristic method rather than to employ it directly on the problem, in the attempt to raise the level of generality at which we can operate. All the evidence obtained from the first stage experiments indicates that there is a range of promising future directions.
Finally in Chapter Eight the results of the work are evaluated and some directions for future work are present. |
| first_indexed | 2025-11-14T18:21:43Z |
| format | Thesis (University of Nottingham only) |
| id | nottingham-10020 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T18:21:43Z |
| publishDate | 2002 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-100202025-02-28T11:06:54Z https://eprints.nottingham.ac.uk/10020/ Case-based reasoning for course timetabling problems Qu, Rong The research in this thesis investigates Case-Based Reasoning (CBR), a Knowledge-Based Reasoning technique that proved to be capable of providing good solutions in educational course timetabling problems. Following the basic idea behind CBR, experiences in solving previous similar timetabling problems are employed to find the solutions for new problems. A basic CBR system that is hierarchically organized with structured knowledge representations by attribute graphs is proposed in Chapter Four. The system is then further improved to solve a wider range of problems, which is described in Chapter Five. Evaluations on a large number of experiments indicate that this approach could provide a significant step forward in timetabling and scheduling research. This basic system works well on relatively small problems. To deal with this drawback a multiple-retrieval approach that partitions large timetabling problems into small solvable sub-problems is presented in Chapter Six. Good results are obtained from a wide range of experiments. In Chapter Seven, a new idea is introduced in CBR for solving timetabling problems by investigating the approach to select the most appropriate heuristic method rather than to employ it directly on the problem, in the attempt to raise the level of generality at which we can operate. All the evidence obtained from the first stage experiments indicates that there is a range of promising future directions. Finally in Chapter Eight the results of the work are evaluated and some directions for future work are present. 2002 Thesis (University of Nottingham only) NonPeerReviewed application/pdf en arr https://eprints.nottingham.ac.uk/10020/1/PhDThesis.pdf Qu, Rong (2002) Case-based reasoning for course timetabling problems. PhD thesis, University of Nottingham. Case-Based Reasoning Timetabling Problems |
| spellingShingle | Case-Based Reasoning Timetabling Problems Qu, Rong Case-based reasoning for course timetabling problems |
| title | Case-based reasoning for course timetabling problems |
| title_full | Case-based reasoning for course timetabling problems |
| title_fullStr | Case-based reasoning for course timetabling problems |
| title_full_unstemmed | Case-based reasoning for course timetabling problems |
| title_short | Case-based reasoning for course timetabling problems |
| title_sort | case-based reasoning for course timetabling problems |
| topic | Case-Based Reasoning Timetabling Problems |
| url | https://eprints.nottingham.ac.uk/10020/ |