Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling

Burke, Edmund, MacCarthy, Bart L., Petrovic, Sanja and Qu, Rong (2002) Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling. In: International Conference on the Practice and Theory of Automated Timetabling, Aug 2002, Gent Belgium.

Full text not available from this repository.

Abstract

This paper presents a new hyper-heuristic method using Case-Based Reasoning (CBR) for solving course timetabling problems. The term Hyper-heuristics has recently been employed to refer to 'heuristics that choose heuristics' rather than heuristics that operate directly on given problems. One of the overriding motivations of hyper-heuristic methods is the attempt to develop techniques that can operate with greater generality than is currently possible. The basic idea behind this is that we maintain a case base of information about the most successful heuristics for a range of previous timetabling problems to predict the best heuristic for the new problem in hand using the previous knowledge. Knowledge discovery techniques are used to carry out the training on the CBR system to improve the system performance on the prediction. Initial results presented in this paper are good and we conclude by discussing the con-siderable promise for future work in this area.

Item Type: Conference or Workshop Item (Paper)
RIS ID: https://nottingham-repository.worktribe.com/output/1022714
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Qu, Rong
Date Deposited: 12 Dec 2005
Last Modified: 04 May 2020 20:32
URI: https://eprints.nottingham.ac.uk/id/eprint/356

Actions (Archive Staff Only)

Edit View Edit View