Please use this identifier to cite or link to this item:
Title: A SA-VNS approach for the high school timetabling problem.
Authors: Brito, Samuel Souza
Fonseca, George Henrique Godim da
Toffolo, Túlio Ângelo Machado
Santos, Haroldo Gambini
Souza, Marcone Jamilson Freitas
Keywords: Variable neighborhood search
Simulated annealing
High school timetabling problem
Issue Date: 2012
Citation: BRITO, S. S. et al. A SA-VNS approach for the high school timetabling problem. Electronic Notes in Discrete Mathematics, v. 39, p. 169-176, 2012. Disponível em: <>. Acesso em: 22 jan. 2015.
Abstract: The High School Timetabling Problem consists in assigning timeslots and resources to events, satisfying constraints which heavily depend on the specific institution. This work deals with the problem of the ongoing III International Timetabling Competition (ITC), which includes a diverse set of instances from many educational institutions around the world. We proposed an approach based on Simulated Annealing and Variable Neighborhood Search metaheuristics. One important structural feature of our approach is the use of the Kingston’s High School Timetabling Engine (KHE) to generate initial solutions combined with the multi-neighborhood search. Such approach led us to the finals of the ongoing competition.
ISSN: 1571-0653
metadata.dc.rights.license: O periódico Electronic Notes in Discrete Mathematics concede permissão para depósito do artigo no Repositório Institucional da UFOP. Número da licença: 3552521492490.
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_SA-VNSApproachHigh.pdf180,67 kBAdobe PDFView/Open

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