Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFonseca, George Henrique Godim da-
dc.contributor.authorSantos, Haroldo Gambini-
dc.contributor.authorCarrano, Eduardo Gontijo-
dc.identifier.citationFONSECA, G. H. G. da; SANTOS, H. G.; CARRANO, E. G. Integrating matheuristics and metaheuristics for timetabling. Computers & Operations Research, v. 1, p. 1-28, 2016. Disponível em: <>. Acesso em: 07 ago. 2016.pt_BR
dc.description.abstractThe High School Timetabling Problem requires the assignment of times and resources to events, while sets of required and desirable constraints must be considered. The most common approach for this problem is to employ metaheuristic methods. This work presents a matheuristic approach that combines a Variable Neighbourhood Search algorithm with mathematical programming-based neighbourhoods for high school timetabling. Computational experiments on well-known benchmark instances demonstrate the success of the proposed hybrid approach, which outperforms the standalone Variable Neighbour- hood Search algorithm by far. Additionally, the proposed algorithm was able to improve 15 out of 17 current best known solutions in a very famous benchmark set.pt_BR
dc.titleIntegrating matheuristics and metaheuristics for timetabling.pt_BR
dc.typeArtigo publicado em periodicopt_BR
dc.rights.licenseO periódico Computers & Operations Research concede permissão para depósito deste artigo no Repositório Institucional da UFOP. Número da licença: 3926560954953.pt_BR
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_IntegratingMatheuristicsMetaheuristics.pdf1,82 MBAdobe PDFView/Open

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