Skip to main content
SpringerLink
Log in
Book cover

International Conference on Mining Intelligence and Knowledge Exploration

MIKE 2018: Mining Intelligence and Knowledge Exploration pp 64–79Cite as

Solving the Traveling Tournament Problem with Predefined Venues by Parallel Constraint Programming

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11308))

Abstract

The Traveling Tournament Problem with Predefined Venues (TTPPV) is a practical problem arising from sports scheduling. We describe two different modeling approaches for this problem, each of which is suitable for different sizes of instance. The experimental results show that our modeling approaches lead to improved performance compared to previous techniques in terms of the number of feasible solutions and the optimal value. Furthermore, we present how to execute the models in parallel through data-level parallelism. The parallel versions do not only gain speedup but also attain significant improvement on optimal value since more subtrees are searched independently.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    In the present paper, the index of an array starts from 1.

References

  1. Pesant, G.: CSPLib: a problem library for constraints. Accessed 08 Apr 2018

    Google Scholar 

  2. Melo, R.A., Urrutiá, S., Ribeiro, C.C.: The traveling tournament problem with predefined venues. J. Sched. 12(6), 607–622 (2009)

    Article  MathSciNet  Google Scholar 

  3. Kendall, G., Knust, S., Ribeiro, C.C., Urrutia, S.: Scheduling in sports: an annotated bibliography. Comput. Oper. Res. 37(1), 1–19 (2010)

    Article  MathSciNet  Google Scholar 

  4. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, Boston (1995)

    Google Scholar 

  5. Rossi, F., Van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier, New York (2006)

    MATH  Google Scholar 

  6. Lecoutre, C.: STR2: optimized simple tabular reduction for table constraints. Constraints 16(4), 341–371 (2011)

    Article  MathSciNet  Google Scholar 

  7. Prud’homme, C., Fages, J.-G., Lorca, X.: Choco Documentation. TASC - LS2N CNRS UMR 6241, COSLING S.A.S. (2017)

    Google Scholar 

  8. Lecoutre, C.: Constraint Networks: Techniques and Algorithms. Wiley, Hoboken (2009)

    Book  Google Scholar 

  9. Pesant, G.: A constraint programming approach to the traveling tournament problem with predefined venues. In: Practice and Theory of Automated Timetabling, pp. 303–316 (2012)

    Google Scholar 

  10. Zanarini, A., Pesant, G.: More robust counting-based search heuristics with alldifferent constraints. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 354–368. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13520-0_38

    Chapter  Google Scholar 

  11. Régin, J.-C., Rezgui, M., Malapert, A.: Embarrassingly parallel search. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 596–610. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40627-0_45

    Chapter  Google Scholar 

  12. Smith, B.M.: Modelling. In: Foundations of Artificial Intelligence, vol. 2, pp. 377–406. Elsevier, Amsterdam (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Brandenburg University of Technology Cottbus-Senftenberg, Konrad-Wachsmann-Allee 5, 03044, Cottbus, Germany

    Ke Liu, Sven Löffler & Petra Hofstedt

Authors
  1. Ke Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sven Löffler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Petra Hofstedt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ke Liu .

Editor information

Editors and Affiliations

  1. Technical University of Cluj-Napoca, Cluj-Napoca, Romania

    Adrian Groza

  2. Indian Institute of Information Technology, Sri City, India

    Rajendra Prasath

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, K., Löffler, S., Hofstedt, P. (2018). Solving the Traveling Tournament Problem with Predefined Venues by Parallel Constraint Programming. In: Groza, A., Prasath, R. (eds) Mining Intelligence and Knowledge Exploration. MIKE 2018. Lecture Notes in Computer Science(), vol 11308. Springer, Cham. https://doi.org/10.1007/978-3-030-05918-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-05918-7_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-05917-0

  • Online ISBN: 978-3-030-05918-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation