Citation
Late acceptance hill-climbing for high school timetabling. Journal of Scheduling, 19 (4): 453-465, 2016.
Selected
Abstract
The application of the Late Acceptance Hill-Climbing (LAHC) to solve the High School Timetabling Problem is the subject of this manuscript. The original algorithm and two variants proposed here are tested jointly with other state-of-art methods to solve the instances proposed in the Third International Timetabling Competition. Following the same rules of the competition, the LAHC-based algorithms noticeably outperformed the winning methods. These results, and reports from the literature, suggest that the LAHC is a reliable method that can compete with the most employed local search algorithms.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/s10951-015-0458-5 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
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
@ARTICLE{2016-453-465-SI, author = {Fonseca, George H. G. and Santos, Haroldo G. and Carrano, Eduardo G.},
title = {{Late acceptance hill-climbing for high school timetabling}},
journal = {Journal of Scheduling},
year = {2016},
volume = {{19}},
pages = {453--465},
number = {4},
note = {Selected},
abstract = {{The application of the Late Acceptance Hill-Climbing (LAHC) to solve the High School Timetabling Problem is the subject of this manuscript. The original algorithm and two variants proposed here are tested jointly with other state-of-art methods to solve the instances proposed in the Third International Timetabling Competition. Following the same rules of the competition, the LAHC-based algorithms noticeably outperformed the winning methods. These results, and reports from the literature, suggest that the LAHC is a reliable method that can compete with the most employed local search algorithms.}},
doi = {{10.1007/s10951-015-0458-5}},
eissn = {{1099-1425}},
issn = {{1094-6136}},
orcid-numbers = {{Carrano, Eduardo/0000-0003-3368-4245}},
owner = {Graham},
researcherid-numbers = {{Carrano, Eduardo/A-2350-2015}},
timestamp = {2017.01.18},
unique-id = {{ISI:000379627200007}} }