Parallel local search algorithms for high school timetabling problems

Autor(es)

Sayiniec, Landir ^[1] ; Santos, Maristela O. ^[1] ; Costa, Alysson M. ^[2]

Afiliação do(s) autor(es)

^[1] Univ Sao Paulo, Inst Ciencias Matemat & Comp, Ave Trabalhador Sao Carlense 400, BR-13566590 Sao Carlos, SP - Brazil

^[2] Univ Melbourne, Sch Math & Stat, 813 Swanston St, Parkville, Vic 3010 - Australia

• Tipo de documento: Artigo Científico
• Fonte: European Journal of Operational Research; v. 265, n. 1, p. 81-98, FEB 16 2018.
• Citações Web of Science: 3

Resumo

High school timetabling consists in assigning meetings between classes and teachers, with the goal of minimizing the violation of specific soft requirements. This family of problems has been frequently considered in the literature, but few strategies employing parallelism have been proposed. In this exploratory study, we consider two different parallel frameworks and present a thorough computational study in order to understand algorithmic decisions that are closely related to performance. Our best algorithm outperforms state-of-the-art algorithms for variants of the problem considered, indicating both the efficiency and the flexibility of the method. (C) 2017 Elsevier B.V. All rights reserved. (AU)

• Processo FAPESP: 15/10032-2 - Algoritmos heurísticos para problemas de definição de horários escolares
• Beneficiário: Landir Saviniec
• Modalidade de apoio: Bolsas no Exterior - Estágio de Pesquisa - Doutorado
• Processo FAPESP: 13/13563-3 - Algoritmos heurísticos para problemas de definição de horários escolares
• Beneficiário: Landir Saviniec
• Modalidade de apoio: Bolsas no Brasil - Doutorado