Case-Based Initialisation of Metaheuristics for Examination. In Selected papers from the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), pages 289-308, Springer, 2005.
Selected
Examination timetabling problems are traditionally solved by choosing a solution procedure from a plethora of heuristic algorithms based either on a direct construction principle or on some incremental improvement procedure. A number of hybrid approaches have also been examined in which a sequential heuristic 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 different problem classes. In order to lessen the need for a problem-specific knowledge we developed a novel solution approach to examination timetabling by incorporating the case-based reasoning methodology. A solution to a given problem is constructed by implementing case-based reasoning to select a sequential heuristic, which produces a good initial solution for the Great Deluge metaheuristic. A series of computational experiments on benchmark problems were conducted which subsequently demonstrate that this approach gives comparable or better results than solutions generated not only by a single Great Deluge algorithm, but also the state-of-the-art approaches.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
The doi for this publication is 10.1007/0-387-27744-7_14 You can link directly to the original paper, via the doi, from here
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
@INBOOK{2005-289-308-SI, chapter = {Selected papers from the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA)},
pages = {289--308},
title = {Case-Based Initialisation of Metaheuristics for Examination},
publisher = {Springer},
year = {2005},
editor = {G. Kendall and E. Burke and S. Petrovic and M. Gendreau},
author = {S. Petrovic and Y. Yang and M. Dror},
note = {Selected},
abstract = {Examination timetabling problems are traditionally solved by choosing a solution procedure from a plethora of heuristic algorithms based either on a direct construction principle or on some incremental improvement procedure. A number of hybrid approaches have also been examined in which a sequential heuristic 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 different problem classes. In order to lessen the need for a problem-specific knowledge we developed a novel solution approach to examination timetabling by incorporating the case-based reasoning methodology. A solution to a given problem is constructed by implementing case-based reasoning to select a sequential heuristic, which produces a good initial solution for the Great Deluge metaheuristic. A series of computational experiments on benchmark problems were conducted which subsequently demonstrate that this approach gives comparable or better results than solutions generated not only by a single Great Deluge algorithm, but also the state-of-the-art approaches.},
doi = {10.1007/0-387-27744-7_14},
owner = {gxk},
timestamp = {2012.05.29} }