Case-Based Initialisation of Metaheuristics for Examination Timetabling

  • Petrovic S
  • Yang Y
  • Dror M
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Examination timetabling problems are traditionally solved by choosing a solu-tion procedure from a plethora of heuristic algorithms based either on a direct construction principle or on some incremental improvement procedure. A num-ber of hybrid approaches have also been examined in which a sequential heuris-tic and a metaheuristic are employed successively. As a rule, best results for a problem instance are obtained by implementing heuristics with domain-specific knowledge. However, solutions of this kind are not easily adoptable across dif-ferent problem classes. In order to lessen the need for a problem-specific knowl-edge we developed a novel solution approach to examination timetabling by in-corporating the case-based reasoning methodology. A solution to a given prob-lem is constructed by implementing case-based reasoning to select a sequential heuristic, which produces a good initial solution for the Great Deluge meta-heuristic. A series of computational experiments on benchmark problems were conducted which subsequently demonstrate that this approach gives compara-ble or better results than solutions generated not only by a single Great Deluge algorithm, but also the state-of-the-art approaches.

Cite

CITATION STYLE

APA

Petrovic, S., Yang, Y., & Dror, M. (2005). Case-Based Initialisation of Metaheuristics for Examination Timetabling. In Multidisciplinary Scheduling: Theory and Applications (pp. 289–308). Springer-Verlag. https://doi.org/10.1007/0-387-27744-7_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free