Programação de tabelas para torneios round robin simples com estádios predefinidos

AUTOR(ES)
DATA DE PUBLICAÇÃO

2009

RESUMO

Sport timetabling is a growing area of operations research and computer science. Sport timetabling problems have a great economic importance since the quality of the schedule directly influences the performance of teams and the income obtained by the sponsors and broadcasters. This great economic impact and high degree of difficulty of the problems have attracted a growing number of researchers. This work addresses the Traveling Tournament Problem with Predefined Venues. In the first of this work, a local search based heuristic is proposed to obtain good feasible solutions to the problem. Four neighborhoods are used in the local search procedure. A graph theory based method is proposed to generate initial solutions to the problem. In the second part of this work, a combinatorial relaxation of an integer linear programming is used to obtain dual bounds to the problem. The computational results show that both the heuristic and the method to generate dual bounds outperform the previous results in the literature for all test instances.

ASSUNTO(S)

computação teses. teoria dos jogos teses. pesquisa operacional teses. otimização matemática.

Documentos Relacionados