Late acceptance hill-climbing for high school timetabling.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorFonseca, George Henrique Godim da-
Autor(es): dc.creatorSantos, Haroldo Gambini-
Autor(es): dc.creatorCarrano, Eduardo Gontijo-
Data de aceite: dc.date.accessioned2025-08-21T15:09:44Z-
Data de disponibilização: dc.date.available2025-08-21T15:09:44Z-
Data de envio: dc.date.issued2017-07-26-
Data de envio: dc.date.issued2017-07-26-
Data de envio: dc.date.issued2016-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/8333-
Fonte completa do material: dc.identifierhttps://link.springer.com/article/10.1007/s10951-015-0458-5-
Fonte completa do material: dc.identifierhttps://doi.org/10.1007/s10951-015-0458-5-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1003960-
Descrição: dc.descriptionThe 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.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectThird International Timetabling Competition-
Palavras-chave: dc.subjectLocal search-
Título: dc.titleLate acceptance hill-climbing for high school timetabling.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.