Skip to main content

Research Repository

Advanced Search

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

Petrovic, Sanja; Qu, Rong

Authors

SANJA PETROVIC SANJA.PETROVIC@NOTTINGHAM.AC.UK
Professor of Operational Research

Profile Image

RONG QU rong.qu@nottingham.ac.uk
Associate Professor



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.

Citation

Petrovic, S., & Qu, R. (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 TechnologiesIOS Press

Publication Date Jan 1, 2002
Deposit Date Dec 12, 2005
Publicly Available Date Oct 9, 2007
Publisher IOS Press
Peer Reviewed Peer Reviewed
Book Title Knowledge-Based Intelligent Information Engineering Systems and Allied Technologies
Public URL http://eprints.nottingham.ac.uk/id/eprint/350
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf

Files


rxqKES02.pdf (49 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations