Skip to main content
SpringerLink
Log in

Sports League Scheduling: Enumerative Search for Prob026 from CSPLib

  • Conference paper
Book cover Principles and Practice of Constraint Programming - CP 2006 (CP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4204))

  • 1236 Accesses

Abstract

This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the best known constraint programing algorithm is limited to T≤40. The proposed approach relies on interesting properties which are used to constraint the search process.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Gent, I., Walsh, T.: CSPLib: A benchmark library for constraints. . In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 480–481. Springer, Heidelberg (1998), http://www.csplib.org/

    Google Scholar 

  2. Colbourn, C., Dinitz, J. (eds.): The CRC Handbook of Combinatorial Designs. Discrete Mathematics and Its Applications, vol. 4. CRC Press, Boca Raton (1996)

    MATH  Google Scholar 

  3. Gelling, E., Odeh, R.: On 1-factorizations of the complete graph and the relationship to round-robin schedules. Congressus Numerantium 9, 213–221 (1974)

    MathSciNet  Google Scholar 

  4. McAloon, K., Tretkoff, C., Wetzel, G.: Sports league scheduling. In: Proceedings of the Third ILOG Optimization Suite International Users’ Conference (1997)

    Google Scholar 

  5. Gomes, C., Selman, B., McAloon, K., Tretkoff, C.: Randomization in backtrack search: Exploiting heavy-tailed profiles for solving hard scheduling problems. In: Proceedings AIPS 1998, pp. 208–213. AAAI Press, Menlo Park (1998)

    Google Scholar 

  6. Béjar, R., Manyà, F.: Solving combinatorial problems with regular local search algorithms. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS (LNAI), vol. 1705, pp. 33–43. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Gomes, C., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proceedings AAAI/IAAI 1998, pp. 431–437. AAAI Press/MIT Press (1998)

    Google Scholar 

  8. Béjar, R., Manyà, F.: Solving the round robin problem using propositional logic. In: Proceedings AAAI/IAAI 2000, pp. 262–266. AAAI Press/MIT Press (2000)

    Google Scholar 

  9. Régin, J.-C.: Modeling and solving sports league scheduling with constraint programming. In: Proceedings INFORMS 1998 (1998)

    Google Scholar 

  10. Wetzel, G., Zabatta, F.: Technical report, City University of New York, USA (1998)

    Google Scholar 

  11. Van Hentenryck, P., et al.: Constraint programming in OPL. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol. 1702, pp. 98–116. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  12. Régin, J.-C.: Constraint programming and sports scheduling problems. In: Proceedings INFORMS 1999 (1999)

    Google Scholar 

  13. Hamiez, J.-P., Hao, J.-K.: Solving the sports league scheduling problem with tabu search. In: Nareyek, A. (ed.) ECAI-WS 2000. LNCS, vol. 2148, pp. 24–36. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Schellenberg, P., van Rees, G., Vanstone, S.: The existence of balanced tournament designs. Ars Combinatoria 3, 303–318 (1977)

    MATH  MathSciNet  Google Scholar 

  15. Hamiez, J.P., Hao, J.K.: A linear-time algorithm to solve the Sports League Scheduling Problem (prob026 of CSPLib). Discrete Applied Mathematics 143, 252–265 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  16. Haselgrove, J., Leech, J.: A tournament design problem. American Mathematical Monthly 84(3), 198–201 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  17. Gomes, C.P., Sellmann, M.: Streamlined constraint reasoning. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 274–289. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Lockwood, E.H.: American tournaments. The Mathematical Gazette 20, 333 (1936)

    Article  Google Scholar 

  19. Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetries in matrix models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 462–476. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LERIA, Université d’Angers, UFR Sciences, 2, boulevard Lavoisier, 49045 CEDEX 01, Angers, France

    Jean-Philippe Hamiez & Jin-Kao Hao

Authors
  1. Jean-Philippe Hamiez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin-Kao Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LINA UMR CNRS 6241, University of Nantes,  

    Frédéric Benhamou

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hamiez, JP., Hao, JK. (2006). Sports League Scheduling: Enumerative Search for Prob026 from CSPLib. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_57

Download citation

  • DOI: https://doi.org/10.1007/11889205_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46267-5

  • Online ISBN: 978-3-540-46268-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation