Title :
A New Lower Bound to the Traveling Tournament Problem
Author :
Urrutia, Sebastián ; Ribeiro, Celso C. ; Melo, Rafael A.
Author_Institution :
Dept. of Comput. Sci., Univ. Fed. de Minas Gerais, Belo Horizonte
Abstract :
Optimization in sports is a field of increasing interest. The traveling tournament problem abstracts certain characteristics of sports scheduling problems. We propose a new method for determining a lower bound to this problem. The new bound improves upon the previously best known lower bound. Numerical results on benchmark instances showed reductions as large as 38.6% in the gaps between lower and upper bounds.
Keywords :
scheduling; sport; travelling salesman problems; lower bound; optimization; sports scheduling; traveling tournament problem; Abstracts; Cities and towns; Computational intelligence; Computer science; Processor scheduling; Qualifications; Repeaters; Round robin; Scholarships; Upper bound;
Conference_Titel :
Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on
Conference_Location :
Honolulu, HI
Print_ISBN :
1-4244-0704-4
DOI :
10.1109/SCIS.2007.367664
