Abstract
The well-known traveling tournament problem is a hard optimization problem in which a double round robin sports league schedule has to be constructed while minimizing the total travel distance over all teams. The teams start and end their tours at their home venues, are only allowed to play a certain maximum number of games in a row at home or away, and must not play against each other in two consecutive rounds. The latter aspects introduce also a difficult feasibility aspect. In this work, we study a beam search approach based on a recursive state space formulation. We compare different state ordering heuristics for the beam search based on lower bounds derived by means of decision diagrams. Furthermore, we introduce a randomized beam search variant that adds Gaussian noise to the heuristic value of a node for diversifying the search in order to enable a simple yet effective parallelization. In our computational study, we use randomly generated instances to compare and tune algorithmic parameters and present final results on the classical National League and circular benchmark instances. Results show that this purely construction-based method provides mostly better solutions than existing ant-colony optimization and tabu search algorithms and it comes close to the leading simulated annealing based approaches without using any local search. For two circular benchmark instances we found new best solutions for which the last improvement was twelve years ago. The presented state space formulation and lower bound techniques could also be beneficial for exact methods like A\(^*\) or DFS\(^*\) and may be used to guide the randomized construction in ACO or GRASP approaches.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anagnostopoulos, A., Michel, L., Van Hentenryck, P., Vergados, Y.: A simulated annealing approach to the traveling tournament problem. J. Sched. 9(2), 177–193 (2006)
Bergman, D., Cire, A.A., van Hoeve, W.J., Hooker, J.N.: Decision Diagrams for Optimization. AIFTA. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42849-9
Di Gaspero, L., Schaerf, A.: A composite-neighborhood tabu search approach to the traveling tournament problem. J. Heuristics 13(2), 189–207 (2007)
Easton, K., Nemhauser, G., Trick, M.: The traveling tournament problem description and benchmarks. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 580–584. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45578-7_43
López-Ibáñez, M., Dubois-Lacoste, J., Cáceres, L.P., Birattari, M., Stützle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)
Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. Int. J. Prod. Res. 26(1), 35–62 (1988)
Rasmussen, R.V., Trick, M.A.: A benders approach for the constrained minimum break problem. Eur. J. Oper. Res. 177(1), 198–213 (2007)
Ribeiro, C.C., Urrutia, S.: Heuristics for the mirrored traveling tournament problem. Eur. J. Oper. Res. 179(3), 775–787 (2007)
Thielen, C., Westphal, S.: Complexity of the traveling tournament problem. Theoret. Comput. Sci. 412(4–5), 345–351 (2011)
Urrutia, S., Ribeiro, C.C., Melo, R.A.: A new lower bound to the traveling tournament problem. In: 2007 IEEE Symposium on Computational Intelligence in Scheduling, pp. 15–18. IEEE (2007)
Uthus, D.C., Riddle, P.J., Guesgen, H.W.: An ant colony optimization approach to the traveling tournament problem. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 81–88. ACM (2009)
Uthus, D.C., Riddle, P.J., Guesgen, H.W.: DFS* and the traveling tournament problem. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 279–293. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01929-6_21
Uthus, D.C., Riddle, P.J., Guesgen, H.W.: Solving the traveling tournament problem with iterative-deepening A*. J. Sched. 15(5), 601–614 (2012)
Van Hentenryck, P., Vergados, Y.: Population-based simulated annealing for traveling tournaments. In: Proceedings of the 22nd National Conference on Artificial Intelligence, no. 1, pp. 267–262. MIT Press (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Frohner, N., Neumann, B., Raidl, G.R. (2020). A Beam Search Approach to the Traveling Tournament Problem. In: Paquete, L., Zarges, C. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2020. Lecture Notes in Computer Science(), vol 12102. Springer, Cham. https://doi.org/10.1007/978-3-030-43680-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-43680-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43679-7
Online ISBN: 978-3-030-43680-3
eBook Packages: Computer ScienceComputer Science (R0)