Traveling tournament problem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

The traveling tournament problem (TTP) is a mathematical optimization problem. The question involves scheduling a series of teams such that:

  1. Each team plays every other team twice, once at home and once in the other's stadium.
  2. No team plays the same opponent in two consecutive weeks.
  3. No team plays more than three games in a row at home, or three games in a row on the road.

A matrix is provided of the travel distances between each team's home city. All teams start and end at their own home city, and the goal is to minimize the total travel distance for every team over the course of the whole season.[1]

There have been many papers published on the subject, and a contest exists to find the best solutions for certain specific schedules.[2]

References[edit]

  1. ^ "Solving the Traveling Tournament Problem" (PDF).
  2. ^ "Challenge Traveling Tournament Problems". mat.gsia.cmu.edu. Retrieved 2018-06-18.