The traveling tournament problem with predefined venues

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 Predefi...

Full description

Saved in:
Bibliographic Details
Published in:Journal of scheduling 2009-12, Vol.12 (6), p.607-622
Main Authors: Melo, Rafael A., Urrutia, Sebastián, Ribeiro, Celso C.
Format: Article
Language:English
Subjects:
Applied mathematics
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control
Optimization
Computer science
Integer programming
Operations Research/Decision Theory
Optimization
Scheduling
Sports
Studies
Supply Chain Management
Teams
Tournaments & championships
Venue
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-008-0097-1