Journal of Scheduling

, Volume 9, Issue 2, pp 177–193 | Cite as

A simulated annealing approach to the traveling tournament problem

  • A. Anagnostopoulos
  • L. Michel
  • P. Van Hentenryck
  • Y. Vergados
Regular Papers

Abstract

Automating the scheduling of sport leagues has received considerable attention in recent years, as these applications involve significant revenues and generate challenging combinatorial optimization problems. This paper considers the traveling tournament problem (TTP) which abstracts the salient features of major league baseball (MLB) in the United States. It proposes a simulated annealing algorithm (TTSA) for the TTP that explores both feasible and infeasible schedules, uses a large neighborhood with complex moves, and includes advanced techniques such as strategic oscillation and reheats to balance the exploration of the feasible and infeasible regions and to escape local minima at very low temperatures. TTSA matches the best-known solutions on the small instances of the TTP and produces significant improvements over previous approaches on the larger instances. Moreover, TTSA is shown to be robust, because its worst solution quality over 50 runs is always smaller or equal to the best-known solutions.

Keywords

Sport scheduling Travelling tournament problems Local search Simulated annealing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benoist, T., F. Laburthe, and B. Rottembourg, “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
  2. Connelly, D. T., “General purpose simulated annealing.” Journal of Operations Research, 43, (1992).Google Scholar
  3. Díaz, Juan A. and E. Fernández, “A tabu search heuristic for the generalized assignment problem,” European Journal of Operational Research, 132(1), 22–38, (July 2001).Google Scholar
  4. Easton, K., G. Nemhauser, and M. Trick, “The traveling tournament problem description and benchmarks,” in Seventh International Conference on the Principles and Practice of Constraint Programming (CP'99), Paphos, Cyprus. Springer-Verlag, LNCS 2239, (2001) pp. 580–589.Google Scholar
  5. Glover, F. and M. Laguna, Tabu Search. Kluwer Academic Publishers, 1997.Google Scholar
  6. Kirkpatrick, S., C. Gelatt, and M. Vecchi, “Optimization by simulated annealing,” Science, 220, 671–680 (1983).Google Scholar
  7. Laguna, M., J. P. Kelly, Gonzalez-Velarde, and F. Glover, “Tabu search for the multilevel generalized assignment problems,” European Journal of Operational Research, 42, 677–687 (1995).Google Scholar
  8. Osman, I.H., “Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem,” Annals of Operations Research, 41, 421–451 (1993).CrossRefGoogle Scholar
  9. Pesch, E. and F. Glover, “TSP Ejection Chains,” Discrete Applied Mathematics, 76, 165–181, (1997).CrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  • A. Anagnostopoulos
    • 1
  • L. Michel
    • 1
    • 2
  • P. Van Hentenryck
    • 1
  • Y. Vergados
    • 1
  1. 1.Brown UniversityProvidence
  2. 2.University of ConnecticutStoors

Personalised recommendations