Variable Neighborhood Search based algorithms for high school timetabling.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorFonseca, George Henrique Godim da-
Autor(es): dc.creatorSantos, Haroldo Gambini-
Data de aceite: dc.date.accessioned2019-11-06T13:31:52Z-
Data de disponibilização: dc.date.available2019-11-06T13:31:52Z-
Data de envio: dc.date.issued2015-01-16-
Data de envio: dc.date.issued2015-01-16-
Data de envio: dc.date.issued2014-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/4240-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/557357-
Descrição: dc.descriptionThis work presents the application of Variable Neighborhood Search (VNS) based algorithms to the High School Timetabling Problem. The addressed model of the problem was proposed by the Third International Timetabling Competition (ITC2011), which released many instances from educational institutions around the world and attracted 17 competitors. Some of the VNS algorithm variants were able to outperform the winner of Third I T C solver, which proposed a Simulated Annealing – Iterated local Search approach. This result coupled with another reports in the literature points that VNS based algorithms are a practical solution method for providing high quality solutions for some hard timetabling problems. Moreover they are easy to implement with few parameters to adjust.-
Idioma: dc.languageen-
Direitos: dc.rightsO Periódico Computers & Operations Research concede permissão para depósito do artigo no Repositório Institucional da UFOP. Número da licença: 3544811285426.-
Palavras-chave: dc.subjectVariable neighborhood search-
Palavras-chave: dc.subjectHigh school-
Título: dc.titleVariable Neighborhood Search based algorithms for high school timetabling.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.