Mathematical modeling and tabu search heuristic for the traveling tournament problem

Authors:
Jin Ho Lee;Young Hoon Lee;Yun Ho Lee
Affiliations:
Department of Information and Industrial Engineering, Yonsei University, Seoul, Korea;Department of Information and Industrial Engineering, Yonsei University, Seoul, Korea;Department of Information and Industrial Engineering, Yonsei University, Seoul, Korea
Venue:
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Year:
2006

Citing 4
Cited 0

Combinatorial aspects of construction of competition Dutch Professional Football Leagues

Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Tabu Search

Tabu Search
The Traveling Tournament Problem Description and Benchmarks

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Scheduling a Major College Basketball Conference

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

As professional sports have become big businesses all over the world, many researches with respect to sports scheduling problem have been worked over the last two decades. The traveling tournament problem (TTP) is defined as minimizing total traveling distance for all teams in the league. In this study, a mathematical model for the TTP is presented. This model is formulated using an integer programming (IP). In order to solve practical problems with large size of teams, a tabu search heuristic is suggested. Also, the concepts of alternation and intimacy were introduced for effective neighborhood search. Experiments with several instances are tested to evaluate their performances. It was shown that the proposed heuristic shows good performances with computational efficiency.