Mathematical Modeling and Tabu Search Heuristic for the Traveling Tournament Problem

  • Jin Ho Lee
  • Young Hoon Lee
  • Yun Ho Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3982)


As professional sports have become big businesses all over the world, many researches with respect to sports scheduling problem have been worked over the last two decades. The traveling tournament problem (TTP) is defined as minimizing total traveling distance for all teams in the league. In this study, a mathematical model for the TTP is presented. This model is formulated using an integer programming (IP). In order to solve practical problems with large size of teams, a tabu search heuristic is suggested. Also, the concepts of alternation and intimacy were introduced for effective neighborhood search. Experiments with several instances are tested to evaluate their performances. It was shown that the proposed heuristic shows good performances with computational efficiency.


Integer Programming Tabu Search Tabu Search Algorithm National Basketball Association Tabu Search Heuristic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anagnostopoulos, A., Michael, L.V., Hentenryck, P., Vergados, Y.: A simulated annealing approach to the traveling tournament problem. In: Proceeding of CP-AI-OR (2003)Google Scholar
  2. 2.
    Benoist, T., Laburthe, F., Rottembourge, B.: Lagrangian relaxation and constraint programming collaborative schemes for traveling tournament problem. In: CP-AI-OR, pp. 15–26. Wye College (2001)Google Scholar
  3. 3.
    Costa, D.: An evolutionary tabu search algorithm and the NHL scheduling problem. In: INFOR, vol. 3(33), pp. 161–178 (1995)Google Scholar
  4. 4.
    Easton, K., Nemhauser, G., Trick, M.: The traveling tournament problem description and benchmarks. In: Proceeding of the 7th International Conference on the Principle and Practice of Constraint Programming, Paphos, Cyprus, pp. 580–589 (2001)Google Scholar
  5. 5.
    Easton, K., Nemhauser, G., Trick, M.: Solving the traveling tournament problem: a combined integer programming and constraint programming approach. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 100–109. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  6. 6.
    Ferland, J.A., Fleurent, C.: Computer aided scheduling for a sport league. In: INFOR, vol. 29(1), pp. 14–25Google Scholar
  7. 7.
    Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Dordrecht (1997)MATHGoogle Scholar
  8. 8.
    James, C.B., John, R.B.: Reducing traveling costs and player fatigue in National Basketball Association. The Institute of Management Science 10(3), 98–102 (1980)Google Scholar
  9. 9.
    Lim, A., Rodrigues, B., Zhang, X.: A simulated annealing and hill-climbing algorithm for the traveling tournament problem. European Journal of Operational Research 131, 78–94 (2005)Google Scholar
  10. 10.
    Nemhauser, G.L., Trick, M.A.: Scheduling a major college basketball conference. Operations Research 46(1), 1–8 (1998)CrossRefGoogle Scholar
  11. 11.
    Russel, R.A., Leung, J.M.Y.: Devising a cost effective schedule for a baseball league. Operations Research 42(4), 614–625 (1994)CrossRefGoogle Scholar
  12. 12.
    Schreuder, J.A.M.: Combinatorial aspects of construction of competition Dutch professional football leagues. Discrete Applied Mathematics 35(3), 301–312 (1992)MATHCrossRefGoogle Scholar
  13. 13.
    Trick, M.: Challenge traveling tournament problem (2004),

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jin Ho Lee
    • 1
  • Young Hoon Lee
    • 1
  • Yun Ho Lee
    • 1
  1. 1.Department of Information and Industrial EngineeringYonsei UniversitySeoulKorea

Personalised recommendations