Citation
Late Acceptance Hill-Climbing Applied to the High School Timetabling Problem. In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium, pages 331-344, 2013.
Paper
Abstract
This work presents an application of the Late Acceptance Hill-Climbing (LAHC) algorithm and some variations to solve the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC2012), which released many real instances from educational institutions around the world and provided mechanisms to fairly compare the performance of solvers for the problem. The LAHC algorithm was able to overcome the solver proposed by the winner of the ITC2012, which consisted in a Simulated Annealing and Iterated local Search hybrid approach. Some variants of the LAHC algorithms showed promissory results. The Stagnation Free version of LAHC, for example, improved the results of the original algorithm. The combination of Simulated Annealing and LAHC was also a very promising alternative, and obtained the best average solutions for the considered instances. These results, coupled with another reports in the literature, points out that the LAHC is a reliable method that can compete with widely known local search algorithms.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
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
URL
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.
Bibtex
@INPROCEEDINGS{2013-331-344-P, author = {G. H.G. Fonseca and H. G. Santos and T. A.M. To?olo},
title = {Late Acceptance Hill-Climbing Applied to the High School Timetabling Problem },
booktitle = {In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium},
year = {2013},
editor = {G. Kendall and B. McCollum and G. {Venden Berghe}},
pages = {331--344},
note = {Paper},
abstract = { This work presents an application of the Late Acceptance Hill-Climbing (LAHC) algorithm and some variations to solve the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC2012), which released many real instances from educational institutions around the world and provided mechanisms to fairly compare the performance of solvers for the problem. The LAHC algorithm was able to overcome the solver proposed by the winner of the ITC2012, which consisted in a Simulated Annealing and Iterated local Search hybrid approach. Some variants of the LAHC algorithms showed promissory results. The Stagnation Free version of LAHC, for example, improved the results of the original algorithm. The combination of Simulated Annealing and LAHC was also a very promising alternative, and obtained the best average solutions for the considered instances. These results, coupled with another reports in the literature, points out that the LAHC is a reliable method that can compete with widely known local search algorithms.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2013-331-344-P.pdf} }