Citation
The traveling tournament problem with predefined venues. Journal of Scheduling, 12 (6): 607-622, 2009.
Selected
Abstract
Sports scheduling is a very attractive application area not only because of the interesting mathematical structures of the problems, but also due to their importance in practice and to the big business that sports have become. In this paper, we introduce the Traveling Tournament Problem with Predefined Venues, which consists in scheduling a compact single round robin tournament with a predefined venue assignment for each game (i.e., the venue where each game takes place is known beforehand) while the total distance traveled by the teams is minimized. Three integer programming formulations are proposed and compared. We also propose some simple enumeration strategies to generate feasible solutions to real-size instances in a reasonable amount of time. We show that two original enumeration strategies outperform an improvement heuristic embedded within a commercial solver. Comparative numerical results are presented.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/s10951-008-0097-1 You can link directly to the original paper, via the doi, from here
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@ARTICLE{2009-607-622-SI, author = {R. A. Melo and S. Urrutia and C. C. Ribeiro},
title = {The traveling tournament problem with predefined venues},
journal = {Journal of Scheduling},
year = {2009},
volume = {12},
pages = {607--622},
number = {6},
note = {Selected},
abstract = {Sports scheduling is a very attractive application area not only because of the interesting mathematical structures of the problems, but also due to their importance in practice and to the big business that sports have become. In this paper, we introduce the Traveling Tournament Problem with Predefined Venues, which consists in scheduling a compact single round robin tournament with a predefined venue assignment for each game (i.e., the venue where each game takes place is known beforehand) while the total distance traveled by the teams is minimized. Three integer programming formulations are proposed and compared. We also propose some simple enumeration strategies to generate feasible solutions to real-size instances in a reasonable amount of time. We show that two original enumeration strategies outperform an improvement heuristic embedded within a commercial solver. Comparative numerical results are presented.},
doi = {10.1007/s10951-008-0097-1},
owner = {user},
timestamp = {2012.05.25} }