| Texto completo | |
| Autor(es): |
Saviniec, Landir
[1]
;
Santos, Maristela O.
[2]
;
Costa, Alysson M.
[3]
;
dos Santos, Lana M. R.
[4]
Número total de Autores: 4
|
| Afiliação do(s) autor(es): | [1] Univ Fed Parana, Campus Avancado Jandaia, BR-86900000 Jandaia Do Sul, Parana - Brazil
[2] Univ Sao Paulo, Inst Ciencias Matemat & Comp, Ave Trabalhador Sao Carlense 400, BR-13566590 Sao Carlos, SP - Brazil
[3] Univ Melbourne, Sch Math & Stat, Parkville, Vic 3010 - Australia
[4] Univ Fed Vicosa, Dept Matemat, Ave Peter Henry Rolfs Campus Univ, BR-36570000 Vicosa, MG - Brazil
Número total de Afiliações: 4
|
| Tipo de documento: | Artigo Científico |
| Fonte: | European Journal of Operational Research; v. 280, n. 3, p. 1064-1081, FEB 1 2019. |
| Citações Web of Science: | 0 |
| Resumo | |
High school timetabling problems consist in building periodic timetables for class-teacher meetings considering compulsory and non-compulsory requirements. This family of problems has been widely studied since the 1950s, mostly via mixed-integer programming and metaheuristic techniques. However, the efficient search of optimal or near-optimal solutions is still a challenge for many problems of practical size. In this paper, we investigate mixed-integer programming formulations and a parallel metaheuristic based algorithm for solving high school timetabling problems with compactness and balancing requirements. We propose two pattern-based formulations and a solution algorithm that simultaneously exploits column generation and a team of metaheuristics to build and improve solutions. Extensive computational experiments conducted with real-world instances demonstrate that our formulations are competitive with the best existing high school timetabling formulations, while our parallel algorithm presents superior performance to alternative methods available in the literature. (C) 2019 Published by Elsevier B.V. (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 |