Abstract
The traveling tournament problem is a well-known combinatorial optimization problem with direct applications to sport leagues scheduling, that sparked intensive algorithmic research over the last decade. With the Challenge Traveling Tournament Instances as an established benchmark, the most successful approaches to the problem use meta-heuristics like tabu search or simulated annealing, partially heavily parallelized. Integer programming based methods on the other hand are hardly able to tackle larger benchmark instances. In this work we present a hybrid approach that draws on the power of commercial integer programming solvers as well as the speed of local search heuristics. Our proposed method feeds the solution of one algorithm phase to the other one, until no further improvements can be made. The applicability of this method is demonstrated experimentally on the galaxy instance set, resulting in currently best known solutions for most of the considered instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
After completing the presented experiments, some results were further improved; partially by applying the presented algorithm to a differently generated set of starting solutions.
References
Anagnostopoulos, A., Michel, L., Van Hentenryck, P., & Vergados, Y. (2006). A simulated annealing approach to the traveling tournament problem. Journal of Scheduling, 9(2), 177–193.
Benoist, T., Laburthe, L., & Rottembourg, B. (2001). Lagrange relaxation and constraint programming collaborative schemes for traveling tournament problems. In Proceedings of the 3rd International Workshop on the Integration of AI and OR Techniques (CP-AI-OR). (pp. 15–26).
Di Gaspero, L., & Schaerf, A. (2005). A tabu search approach to the traveling tournament problem. In Proceedings of the 6th Metaheuristics International Conference (MIC-2005), Austria. Vienna, Available as electronic proceedings.
Di Gaspero, L., & Schaerf, A. (2007). A composite-neighborhood tabu search approach to the traveling tournament problem. Journal of Heuristics, 13, 189–207.
de Werra, D. (1981). Scheduling in Sports. In P. Hansen (Ed.), Studies on graphs and integer programming (Vol. 11, pp. 381–395). North Holland: Annals of Discrete Mathematics.
Easton, K., Nemhauser, G., & Trick, M. (2001). The traveling tournament problem description and benchmarks. Principles and Practice of Constraint Programming CP, 2001, 580–584.
Easton, K., Nemhauser, G., & Trick, M. (2003). Solving the travelling tournament problem: A combined integer programming and constraint programming approach. In E. Burke & P. Causmaecker (Eds.), Practice and Theory of Automated Timetabling IV (Vol. 2740, pp. 100–109)., Lecture Notes in Computer Science Springer: Berlin Heidelberg.
Glover, F., Taillard, E., & Taillard, E. (1993). A user’s guide to tabu search. Annals of Operations Research, 41(1), 1–28.
Henz, M. (2004). Playing with constraint programming and large neighborhood search for traveling tournaments. In Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT). (pp. 23–32).
Gurobi Optimization Inc.,. (2011). Gurobi optimizer. Version 4.5.
Irnich, S. (2010). A new branch-and-price algorithm for the traveling tournament problem. European Journal of Operational Research, 204(2), 218–228.
Kirkman, T. P. (1847). On a problem in combinations. The Cambridge and Dublin Mathematical Journal, 2, 191–204.
Kendall, G., Knust, S., Ribeiro, C. C., & Urrutia, S. (2010). Invited review: Scheduling in sports: An annotated bibliography. Computers and Operations Research, 37, 1–19.
Lim, A., Rodrigues, B., & Zhang, X. (2006). A simulated annealing and hill- climbing algorithm for the traveling tournament problem. European Journal of Operations Research, 174, 1459–1478.
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).
Melo, R. A., Urrutia, S., & Ribeiro, C. C. (2009). The traveling tournament problem with predefined venues. Journal of Scheduling, 12, 607–622.
Ribeiro, C. C. (2011). Sports scheduling: Problems and applications. International Transactions in Operational Research, 19, 201–226.
Ribeiro, C. C., & Urrutia, S. (2007). Heuristics for the mirrored traveling tournament problem. European Journal of Operational Research, 179(3), 775–787.
Trick, M. (2011). Challenge traveling tournament problems benchmark. http://mat.gsia.cmu.edu/TOURN/. Accessed Jan 2012.
Thielen, C., & Westphal, S. (2011). Complexity of the traveling tournament problem. Theoretical Computer Science, 412(4–5), 345–351.
Urrutia, S., Ribeiro, C.C., Melo, R.A. (2007). A new lower bound to the traveling tournament problem. In Computational Intelligence in Scheduling, 2007. SCIS ’07. IEEE Symposium on, (pp. 15–18).
van Hentenryck, P., & Vergados, Y. (2006). Traveling tournament scheduling: A systematic evaluation of simulated annealing. LNCS, 3990, 228–243.
Westphal, S., & Noparlik, K. (2012). A 5.875-approximation for the traveling tournament problem. Annals of Operations Research. doi:10.1007/s10479-012-1061-1.
Yamaguchi, D., Imahori, S., Miyashiro, R., & Matsui, T. (2009). An improved approximation algorithm for the traveling tournament problem. In: Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC), volume 5878 of LNCS, (pp. 679–688).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Goerigk, M., Westphal, S. A combined local search and integer programming approach to the traveling tournament problem. Ann Oper Res 239, 343–354 (2016). https://doi.org/10.1007/s10479-014-1586-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-014-1586-6