BDBComp
Parceria:
SBC
Applying ILS algorithm with a new neighborhood operator to solve a large benchmark of the High School Timetabling Problem

Landir SaviniecAdemir Aparecido Constantino

This paper introduces a new benchmark dataset to the high school timetabling problem (HSTP) with more than one hundred instances taken from Brazilian high schools. To solve the problem, our approach makes use of Iterated Local Search (ILS) metaheuristic. The black-box heuristic of ILS incorporates a Steepest Descent (SD) procedure running a new problem dependent neighborhood operator. Then we give details about the benchmark dataset and present the best solutions found by ILS algorithm.

http://www.din.uem.br/sbpo/sbpo2012/pdf/arq0438.pdf

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD