Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems

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.

[img] PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (49kB)

Abstract

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.

Item Type: Book Section
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Depositing User: Qu, Rong
Date Deposited: 12 Dec 2005
Last Modified: 09 Oct 2007 15:52
URI: http://eprints.nottingham.ac.uk/id/eprint/350

Actions (Archive Staff Only)

Edit View Edit View