This paper considers all the variants of the traveling tournament problem (TTP) proposed in [17, 7] to abstract the salient features of major league baseball (MLB) in the United States. The variants include different distance metrics and both mirrored and non-mirrored schedules. The paper shows that, with appropriate enhancements, simulated annealing is robust across the distance metrics and mirroring. In particular, the algorithm matches or improves most best-known solutions and produces numerous new best solutions spread over all classes of problems. The main technical contribution underlying these results is a number of compositive neighborhood moves that aggregate sequences of existing moves; these novel moves preserve the mirroring or distance structure of the candidate schedule, while performing interesting transformations.


Simulated Annealing Tabu Search Distance Metrics Major League Baseball Feasibility Constraint 
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., Michel, L., Van Hentenryck, P., Vergados, Y.: A Simulated Annealing Approach to the Traveling Tournament Problem. In: CP-AI-OR 2003, Montreal, Canada (May 2003)Google Scholar
  2. 2.
    Benoist, T., Laburthe, F., Rottembourg, B.: Lagrange Relaxation and Constraint Programming Collaborative Schemes for Travelling Tournament Problems. In: CP-AI-OR 2001, Wye College (Imperial College), Ashford, Kent UK (April 2001)Google Scholar
  3. 3.
    Connelly, D.T.: General Purpose Simulated Annealing. European Journal of Operations Research 43 (1992)Google Scholar
  4. 4.
    Davenport, A., Tsang, E.: Solving Constraint Satisfaction Sequencing Problems by Iterative Repair. In: Procceedings of the First International Conference on the Practical Applications of Constraint Technologies and Logic Programming (PACLP 1999), London, April 1999, pp. 345–357 (1999)Google Scholar
  5. 5.
    Díaz, J.A., Fernández, E.: A tabu search heuristic for the generalized assignment problem. European Journal of Operational Research 132(1), 22–38 (2001)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Dinitz, J.H., Stinson, D.R.: A Hill-climbing Algorithm for the Construction of One-Factorizations and Room Squares. SIAM J. Alg. Disc. Meth. 8(3), 430–438 (1987)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Easton, K., Nemhauser, G., Trick, M.: The traveling tournament problem description and benchmarks. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 580–589. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Di Gaspero, L., Schaerf, A.: A Tabu Search Approach to the Traveling Tournament Problem. In: Proceedings of RCRA 2005, Associazione Italiana per l’Intelligenza Artificiale (AI*IA), Ferrara, Italy, June 2005, pp. 23–27 (2005)Google Scholar
  9. 9.
    Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)CrossRefMATHGoogle Scholar
  10. 10.
    Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Laguna, M., Kelly, J.P., Gonzalez-Velarde, Glover, F.: Tabu search for the multilevel generalized assignment problems. European Journal of Operational Research 42, 677–687 (1995)MATHGoogle Scholar
  12. 12.
    Lim, A., Rodrigues, B., Zhang, X.: Scheduling Sports Competitions at Multiple Venues Revisited. European Journal of Operational Research (2005) (accepted for publication)Google Scholar
  13. 13.
    Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41, 421–451 (1993)CrossRefMATHGoogle Scholar
  14. 14.
    Pesch, E., Glover, F.: TSP Ejection Chains. Discrete Applied Mathematics 76, 165–181 (1997)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Rasmussen, R., Trick, M.: A Benders Approach to the Constrained Minimum Break Problem. European Journal of Operational Research (2005) (accepted for publication)Google Scholar
  16. 16.
    Ribeiro, C.C., Urrutia, S.: Heuristics for the Mirrored Traveling Tournament Problem. In: Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2004), pp. 323–342 (2004)Google Scholar
  17. 17.
  18. 18.
    Van Hentenryck, P., Vergados, Y.: Minimizing Breaks in Sport Scheduling with Local Search. In: Proceedings of the 15th International Conference on Automated Planning and Scheduling, Monterey, CA (June 2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Pascal Van Hentenryck
    • 1
  • Yannis Vergados
    • 1
  1. 1.Computer Science DepartmentBrown UniversityProvidenceUSA

Personalised recommendations