Use este identificador para citar ou linkar para este item:
http://www.repositorio.ufop.br/jspui/handle/123456789/8333
Título: | Late acceptance hill-climbing for high school timetabling. |
Autor(es): | Fonseca, George Henrique Godim da Santos, Haroldo Gambini Carrano, Eduardo Gontijo |
Palavras-chave: | Third International Timetabling Competition Local search |
Data do documento: | 2016 |
Referência: | 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. |
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. |
URI: | http://www.repositorio.ufop.br/handle/123456789/8333 |
Link para o artigo: | https://link.springer.com/article/10.1007/s10951-015-0458-5 |
DOI: | https://doi.org/10.1007/s10951-015-0458-5 |
ISSN: | 1099-1425 |
Aparece nas coleções: | DECSI - Artigos publicados em periódicos |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
ARTIGO_LateAcceptanceHill.pdf | 1,56 MB | Adobe PDF | Visualizar/Abrir |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.