Skip to main content
SpringerLink
Log in

Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling

  • Conference paper
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3990))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. Connelly, D.T.: General Purpose Simulated Annealing. European Journal of Operations Research 43 (1992)

    Google Scholar 

  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. 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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Chapter  Google Scholar 

  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. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)

    Book  MATH  Google Scholar 

  10. Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    MATH  Google Scholar 

  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. Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41, 421–451 (1993)

    Article  MATH  Google Scholar 

  14. Pesch, E., Glover, F.: TSP Ejection Chains. Discrete Applied Mathematics 76, 165–181 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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. Trick, M.: http://mat.gsia.cmu.edu/TOURN/ (2002)

  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 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Brown University, Providence, RI, 02912, USA

    Pascal Van Hentenryck & Yannis Vergados

Authors
  1. Pascal Van Hentenryck
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yannis Vergados
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Toronto, Canada

    J. Christopher Beck

  2. School of Computing, University of Leeds, U.K.

    Barbara M. Smith

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Van Hentenryck, P., Vergados, Y. (2006). Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling. In: Beck, J.C., Smith, B.M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2006. Lecture Notes in Computer Science, vol 3990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11757375_19

Download citation

  • DOI: https://doi.org/10.1007/11757375_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34306-6

  • Online ISBN: 978-3-540-34307-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation