Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/handle/123456789/4240
Title: Variable Neighborhood Search based algorithms for high school timetabling.
Authors: Fonseca, George Henrique Godim da
Santos, Haroldo Gambini
Keywords: Variable neighborhood search
High school
Issue Date: 2014
Citation: FONSECA, G. H. G. da.; SANTOS, H. G. Variable Neighborhood Search based algorithms for high school timetabling. Computers & Operations Research, v. 52, p. 203-208, 2014. Disponível em: <http://www.sciencedirect.com/science/article/pii/S0305054813003328>. Acesso em: 09 jan. 2015.
Abstract: This 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.
URI: http://www.repositorio.ufop.br/handle/123456789/4240
metadata.dc.identifier.doi: https://doi.org/10.1016/j.cor.2013.11.012
ISSN: 0305-0548
metadata.dc.rights.license: O 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.
Appears in Collections:DECEA - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_VariableNeighborhoodSearch.pdf270,25 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.