Late acceptance hill-climbing for high school timetabling.
Nenhuma Miniatura Disponível
Data
2016
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
The application of the Late Acceptance HillClimbing
(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.
Descrição
Palavras-chave
Third International Timetabling Competition, Local search
Citação
FONSECA, G. H. G.; SANTOS, H. G.; CARRANO, E. G. Late acceptance hill-climbing for high school timetabling. Journal of Scheduling, v. 19, n. 4, p. 453-465, ago. 2016. Disponível em: <https://link.springer.com/article/10.1007/s10951-015-0458-5>. Acesso em: 26 jul. 2017.