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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anagnostopoulos, A., Michael, L.V., Hentenryck, P., Vergados, Y.: A simulated annealing approach to the traveling tournament problem. In: Proceeding of CP-AI-OR (2003)
Benoist, T., Laburthe, F., Rottembourge, B.: Lagrangian relaxation and constraint programming collaborative schemes for traveling tournament problem. In: CP-AI-OR, pp. 15–26. Wye College (2001)
Costa, D.: An evolutionary tabu search algorithm and the NHL scheduling problem. In: INFOR, vol. 3(33), pp. 161–178 (1995)
Easton, K., Nemhauser, G., Trick, M.: The traveling tournament problem description and benchmarks. In: Proceeding of the 7th International Conference on the Principle and Practice of Constraint Programming, Paphos, Cyprus, pp. 580–589 (2001)
Easton, K., Nemhauser, G., Trick, M.: Solving the traveling tournament problem: a combined integer programming and constraint programming approach. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 100–109. Springer, Heidelberg (2003)
Ferland, J.A., Fleurent, C.: Computer aided scheduling for a sport league. In: INFOR, vol. 29(1), pp. 14–25
Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Dordrecht (1997)
James, C.B., John, R.B.: Reducing traveling costs and player fatigue in National Basketball Association. The Institute of Management Science 10(3), 98–102 (1980)
Lim, A., Rodrigues, B., Zhang, X.: A simulated annealing and hill-climbing algorithm for the traveling tournament problem. European Journal of Operational Research 131, 78–94 (2005)
Nemhauser, G.L., Trick, M.A.: Scheduling a major college basketball conference. Operations Research 46(1), 1–8 (1998)
Russel, R.A., Leung, J.M.Y.: Devising a cost effective schedule for a baseball league. Operations Research 42(4), 614–625 (1994)
Schreuder, J.A.M.: Combinatorial aspects of construction of competition Dutch professional football leagues. Discrete Applied Mathematics 35(3), 301–312 (1992)
Trick, M.: Challenge traveling tournament problem (2004), http://mat.gsia.cmu.edu/TTP/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, J.H., Lee, Y.H., Lee, Y.H. (2006). Mathematical Modeling and Tabu Search Heuristic for the Traveling Tournament Problem. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_92
Download citation
DOI: https://doi.org/10.1007/11751595_92
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34075-1
Online ISBN: 978-3-540-34076-8
eBook Packages: Computer ScienceComputer Science (R0)