The Traveling Tournament Problem [1] is an interesting combinatorial optimization problem that occurs in the planning of schedules for sports leagues and tournaments. Roughly speaking, the problem is to schedule games such that every team meets every other team twice (a double round-robin tournament), the length of home stands (consecutive home games) and road trips (consecutive away games) meets constraints and the overall travel distance is minimized.

The goal of this project is to do some literature research on existing solution methods, to implement and discuss a solution and to evaluate it on some benchmarks proposed in [1] (they are now available at https://robinxval.ugent.be/RobinX/travelRepo.php).

[1] Easton, K., Nemhauser, G., & Trick, M. (2001). The traveling tournament problem description and benchmarks. In Principles and Practice of Constraint Programming—CP 2001: 7th International Conference, CP 2001 (pp. 580-584). Springer Berlin Heidelberg.