Case-Based Heuristic Selection for Timetabling Problems

Case-Based Heuristic Selection for Timetabling Problems (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Edmund K. Burke , Sanja Petrovic , Rong Qu

Citations:

25 - 10 self

BibTeX

@MISC{Burke03case-basedheuristic,
    author = {Edmund K. Burke and Sanja Petrovic and Rong Qu},
    title = {Case-Based Heuristic Selection for Timetabling Problems},
    year = {2003}
}

OpenURL

Abstract

This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solving the new problem in hand. Knowledge discovery techniques are employed in two distinct scenarios. Firstly, we model the problem and the problem solving situations along with specific heuristics for those problems. Secondly, we refine the case base and discard cases which prove to be non-useful in solving new problems. Experimental results are presented and analyzed. It is shown that case based reasoning can act effectively as an intelligent approach to learn which heuristics work well for particular timetabling situations. We conclude by outlining and discussing potential research issues in this area of knowledge discovery for different difficult timetabling problems

Keyphrases

timetabling problem case-based heuristic selection new problem case base particular timetabling situation specific heuristic automated university course knowledge discovery case-based heuristic selection approach exam timetabling previous similar situation current state intelligent approach different difficult timetabling problem potential research issue knowledge discovery technique experimental result discard case distinct scenario