Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems
This paper studies Knowledge Discovery (KD) using Tabu Search and Hill Climbing within Case-Based Reasoning (CBR) as a hyper-heuristic method for course timetabling problems. The aim of the hyper-heuristic is to choose the best heuristic(s) for given timetabling problems according to the knowledge s...
| Main Authors: | , |
|---|---|
| Format: | Book Section |
| Published: |
IOS Press
2002
|
| Online Access: | https://eprints.nottingham.ac.uk/350/ |
| _version_ | 1848790397390684160 |
|---|---|
| author | Petrovic, Sanja Qu, Rong |
| author_facet | Petrovic, Sanja Qu, Rong |
| author_sort | Petrovic, Sanja |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | This paper studies Knowledge Discovery (KD) using Tabu Search and Hill Climbing within Case-Based Reasoning (CBR) as a hyper-heuristic method for course timetabling problems. The aim of the hyper-heuristic is to choose the best heuristic(s) for given timetabling problems according to the knowledge stored in the case base. KD in CBR is a 2-stage iterative process on both case representation and the case base. Experimental results are analysed and related research issues for future work are discussed. |
| first_indexed | 2025-11-14T18:11:58Z |
| format | Book Section |
| id | nottingham-350 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T18:11:58Z |
| publishDate | 2002 |
| publisher | IOS Press |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-3502020-05-04T20:32:26Z https://eprints.nottingham.ac.uk/350/ Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems Petrovic, Sanja Qu, Rong This paper studies Knowledge Discovery (KD) using Tabu Search and Hill Climbing within Case-Based Reasoning (CBR) as a hyper-heuristic method for course timetabling problems. The aim of the hyper-heuristic is to choose the best heuristic(s) for given timetabling problems according to the knowledge stored in the case base. KD in CBR is a 2-stage iterative process on both case representation and the case base. Experimental results are analysed and related research issues for future work are discussed. IOS Press 2002 Book Section PeerReviewed Petrovic, Sanja and Qu, Rong (2002) Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems. In: Knowledge-Based Intelligent Information Engineering Systems and Allied Technologies. IOS Press, pp. 336-340. |
| spellingShingle | Petrovic, Sanja Qu, Rong Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems |
| title | Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems |
| title_full | Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems |
| title_fullStr | Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems |
| title_full_unstemmed | Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems |
| title_short | Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems |
| title_sort | case-based reasoning as a heuristic selector in a hyper-heuristic for course timetabling problems |
| url | https://eprints.nottingham.ac.uk/350/ |