Skip to main content
SpringerLink
Log in

The Timetable Constrained Distance Minimization Problem

  • Conference paper
Book cover 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

The Timetable Constrained Distance Minimization Problem is a sports scheduling problem applicable for tournaments where the total travel distance must be minimized. In this paper we define the problem and present an integer programming and a constraint programming formulation for the problem. Furthermore, we describe a hybrid integer programming/constraint programming approach and a branch and bound algorithm for solving the Timetable Constrained Distance Minimization Problem. Finally, the computational performances of the four solution methods are tested and compared.

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. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: Column generation for solving huge integer programs. Operations Research 46(3), 316–329 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Croce, F.D., Oliveri, D.: Scheduling the Italian football league: An ILP-based approach. Computers & Operations Research 33(7), 1963–1974 (2006)

    Article  MATH  Google Scholar 

  3. Easton, K., Nemhauser, G., Trick, M.: The traveling tournament problem: Description and benchmarks. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 580–584. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  5. Elf, M., Jünger, M., Rinaldi, G.: Minimizing breaks by maximizing cuts. Operations Research Letters 31, 343–349 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Henz, M.: Constraint-based round robin tournament planning. In: De Schreye, D. (ed.) Proceedings of the International Conference on Logic Programming, Las Cruces, New Mexico, pp. 545–557. MIT Press, Cambridge (1999)

    Google Scholar 

  7. Henz, M.: Scheduling a major college basketball conference - revisited. Operations Research 49, 163–168 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Henz, M., Müller, T., Thiel, S.: Global constraints for round robin tournament scheduling. European Journal of Operational Research 153(1), 92–101 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. ILOG, ILOG OPL Studio 3.7, Language Manual (2003)

    Google Scholar 

  10. Miyashiro, R., Matsui, T.: Semidefinite programming based approaches to the break minimization problem. Computers & Operations Research 33(7), 1975–1982 (2006)

    Article  MATH  Google Scholar 

  11. Nemhauser, G.L., Trick, M.A.: Scheduling a Major College Basketball Conference. Operations Research 46(1), 1–8 (1998)

    Article  MathSciNet  Google Scholar 

  12. Rasmussen, R.V., Trick, M.A.: A Benders approach for the constrained minimum break problem. European Journal of Operational Research (to appear)

    Google Scholar 

  13. Régin, J.C.: Minimization of the number of breaks in sports scheduling problems using constraint programming, Constraint programming and large scale discrete optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 57, pp. 115–130 (2001)

    Google Scholar 

  14. Russell, R.A., Leung, J.M.Y.: Devising a Cost Effective Schedule for a Baseball League. Operations Research 42(4), 614–625 (1994)

    Article  MATH  Google Scholar 

  15. Schaerf, A.: Scheduling Sport Tournaments using Constraint Logic Programming. Constraints 4, 43–65 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  16. Trick, M.A.: A Schedule-Then-Break Approach to Sports Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 242–253. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research, University of Aarhus, Ny Munkegade, Building 1530, 8000, Aarhus C, Denmark

    Rasmus V. Rasmussen

  2. Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, 15213, USA

    Michael A. Trick

Authors
  1. Rasmus V. Rasmussen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael A. Trick
    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

Rasmussen, R.V., Trick, M.A. (2006). The Timetable Constrained Distance Minimization Problem. 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_15

Download citation

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

  • 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