Programação de tabelas para torneios round robin simples com estádios predefinidos
Ano de defesa: | 2009 |
---|---|
Autor(a) principal: | |
Orientador(a): | |
Banca de defesa: | |
Tipo de documento: | Dissertação |
Tipo de acesso: | Acesso aberto |
Idioma: | por |
Instituição de defesa: |
Universidade Federal de Minas Gerais
UFMG |
Programa de Pós-Graduação: |
Não Informado pela instituição
|
Departamento: |
Não Informado pela instituição
|
País: |
Não Informado pela instituição
|
Palavras-chave em Português: | |
Link de acesso: | http://hdl.handle.net/1843/SLSS-7WMNAR |
Resumo: | Sport timetabling is a growing area of operations research andcomputer science. Sport timetabling problems have a great economicimportance since the quality of the schedule directly influences theperformance of teams and the income obtained by the sponsors andbroadcasters. This great economic impact and high degree of difficultyof the problems have attracted a growingnumber of researchers.This work addresses the Traveling Tournament Problem with PredefinedVenues. In the first of this work, a local search based heuristic isproposed to obtain good feasible solutions to the problem. Fourneighborhoods are used in the local search procedure. A graph theorybased method is proposed to generate initial solutions to theproblem. In the second part of this work, a combinatorial relaxationof an integer linear programming is used to obtain dual bounds to theproblem.The computational results show that both the heuristic and the methodto generate dual bounds outperform the previous results in theliterature for all test instances. |