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

Petrovic, Sanja; Qu, Rong

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 Technologies. IOS 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: https://nottingham-repository.worktribe.com/output/1022918