Abstract
We consider the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. It consists of designing a schedule for a sports league of n teams such that the total traveling costs of the teams are minimized. The most important variant of the traveling tournament problem imposes restrictions on the number of consecutive home games or away games a team may have. We consider the case where at most two consecutive home games or away games are allowed. We show that the well-known independent lower bound for this case cannot be reached and present two approximation algorithms for the problem. The first algorithm has an approximation ratio of \({3/2+\frac{6}{n-4}}\) in the case that n/2 is odd, and of \({3/2+\frac{5}{n-1}}\) in the case that n/2 is even. Furthermore, we show that this algorithm is applicable to real world problems as it yields close to optimal tournaments for many standard benchmark instances. The second algorithm we propose is only suitable for the case that n/2 is even and n ≥ 12, and achieves an approximation ratio of 1 + 16/n in this case, which makes it the first \({1+\mathcal{O}(1/n)}\) -approximation for the problem.
Similar content being viewed by others
References
Anagnostopoulos A, Michel L, Van Hentenryck P, Vergados Y (2006) A simulated annealing approach to the travelling tournament problem. J Sched 9(2): 177–193
Bhattacharyya R (2009) A note on complexity of traveling tournament problem. Optimization Online
Campbell RT, Chen DS (1976) A minimum distance basketball scheduling problem. In: Machol RE, Ladany SP, Morrison D (eds) Management science in sports, studies in the management sciences. North-Holland Publishing Company, North-Holland, pp 15–25
Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh
de Werra D (1981) Scheduling in sports. In: Studies on graphs and discrete programming, Ann Discret Math, vol 11, pp 381–395. North-Holland Publishing Company, North-Holland
Easton K, Nemhauser G, Trick M (2001) The traveling tournament problem description and benchmarks. In: Proceedings of the 7th international conference on principles and practice of constraint programming (CP), LNCS, vol 2239, pp 580–584
Easton K, Nemhauser G, Trick M (2003) Solving the travelling tournament problem: a combined integer programming and constraint programming approach. In: Proceedings of the 4th international conference on the practice and theory of automated timetabling (PATAT), LNCS, vol 2740, pp 100–109
Kendall G, Knust S, Ribeiro C, Urrutia S (2010) Scheduling in sports: an annotated bibliography. Comput Oper Res 37(1): 1–19
Miyashiro R, Matsui T, Imahori S (2012) An approximation algorithm for the traveling tournament problem. Ann Oper Res (online). doi:10.1007/s10479-010-0742-x
Miyashiro R, Matsui T, Imahori S (2008) An approximation algorithm for the traveling tournament problem. In: Proceedings of the 7th international conference on the practice and theory of automated timetabling (PATAT)
Rasmussen R, Trick M (2008) Round robin scheduling—a survey. Eur J Oper Res 188: 617–636
Thielen C, Westphal S (2011) Complexity of the traveling tournament problem. Theor Comput Sci 412(4-5): 345–351
Trick M (2011) Challenge traveling tournament instances. http://mat.gsia.cmu.edu/TOURN/
Westphal S, Noparlik K (2010) A 5.875-approximation for the traveling tournament problem. In: Proceedings of the 8th international conference on the practice and theory of automated timetabling (PATAT)
Westphal S, Noparlik K (2012) A 5.875-approximation for the traveling tournament problem. Ann Oper Res (online). doi:10.1007/s10479-012-1061-1
Yamaguchi D, Imahori S, Miyashiro R, Matsui T (2011) An improved approximation algorithm for the traveling tournament problem. Algorithmica 61: 1077–1091
Author information
Authors and Affiliations
Corresponding author
Additional information
Parts of this work appeared as an extended abstract in: Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010), Part II, Otfried Cheong, Kyung-Yong Chwa, and Kunsoo Park (eds.), LNCS vol. 6507 (2010), pp. 303–314, Springer.
Rights and permissions
About this article
Cite this article
Thielen, C., Westphal, S. Approximation algorithms for TTP(2). Math Meth Oper Res 76, 1–20 (2012). https://doi.org/10.1007/s00186-012-0387-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-012-0387-4