IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v275y2019i1d10.1007_s10479-017-2595-z.html
   My bibliography  Save this article

The sport teams grouping problem

Author

Listed:
  • Túlio A. M. Toffolo

    (KU Leuven
    Federal University of Ouro Preto)

  • Jan Christiaens

    (KU Leuven)

  • Frits C. R. Spieksma

    (KU Leuven)

  • Greet Vanden Berghe

    (KU Leuven)

Abstract

The sport teams grouping problem (STGP) concerns the assignment of sport teams to round-robin tournaments. The objective is to minimize the total travel distance of the participating teams while simultaneously respecting fairness constraints. The STGP is an NP-Hard combinatorial optimization problem highly relevant in practice. This paper investigates the performance of some complimentary optimization approaches to the STGP. Three integer programming formulations are presented and thoroughly analyzed: two compact formulations and another with an exponential number of variables, for which a branch-and-price algorithm is proposed. Additionally, a meta-heuristic method is applied to quickly generate feasible high-quality solutions for a set of real-world instances. By combining the different approaches’ results, solutions within 1.7% of the optimum values were produced for all feasible instances. Additionally, to support further research, the considered STGP instances and corresponding solutions files were shared online.

Suggested Citation

  • Túlio A. M. Toffolo & Jan Christiaens & Frits C. R. Spieksma & Greet Vanden Berghe, 2019. "The sport teams grouping problem," Annals of Operations Research, Springer, vol. 275(1), pages 223-243, April.
    • Handle: RePEc:spr:annopr:v:275:y:2019:i:1:d:10.1007_s10479-017-2595-z
    DOI: 10.1007/s10479-017-2595-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2595-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-017-2595-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Knust, Sigrid, 2010. "Scheduling non-professional table-tennis leagues," European Journal of Operational Research, Elsevier, vol. 200(2), pages 358-367, January.
    2. VANDERBECK, François & WOLSEY, Laurence A., 2010. "Reformulation and decomposition of integer programs," LIDAM Reprints CORE 2188, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Januario, Tiago & Urrutia, Sebastián & Ribeiro, Celso C. & de Werra, Dominique, 2016. "Edge coloring: A natural model for sports scheduling," European Journal of Operational Research, Elsevier, vol. 254(1), pages 1-8.
    4. Xue, Li & Luo, Zhixing & Lim, Andrew, 2015. "Two exact algorithms for the traveling umpire problem," European Journal of Operational Research, Elsevier, vol. 243(3), pages 932-943.
    5. Toffolo, Túlio A.M. & Wauters, Tony & Van Malderen, Sam & Vanden Berghe, Greet, 2016. "Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem," European Journal of Operational Research, Elsevier, vol. 250(3), pages 737-744.
    6. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    7. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    8. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    9. Dries Goossens & Frits Spieksma, 2009. "Scheduling the Belgian Soccer League," Interfaces, INFORMS, vol. 39(2), pages 109-118, April.
    10. Michael A. Trick & Hakan Yildiz & Tallys Yunes, 2012. "Scheduling Major League Baseball Umpires and the Traveling Umpire Problem," Interfaces, INFORMS, vol. 42(3), pages 232-244, June.
    11. Michael A. Trick & Hakan Yildiz, 2011. "Benders' cuts guided large neighborhood search for the traveling umpire problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 771-781, December.
    12. Schonberger, J. & Mattfeld, D. C. & Kopfer, H., 2004. "Memetic Algorithm timetabling for non-commercial sport leagues," European Journal of Operational Research, Elsevier, vol. 153(1), pages 102-116, February.
    13. Barry McCollum & Edmund Burke, 2014. "The practice and theory of automated timetabling," Annals of Operations Research, Springer, vol. 218(1), pages 1-2, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ruta Dadeliene & Stanislav Dadelo & Natalija Pozniak & Leonidas Sakalauskas, 2020. "Analysis of top kayakers’ training-intensity distribution and physiological adaptation based on structural modelling," Annals of Operations Research, Springer, vol. 289(2), pages 195-210, June.
    2. Guillermo Durán, 2021. "Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 125-155, April.
    3. Li, Miao & Davari, Morteza & Goossens, Dries, 2023. "Multi-league sports scheduling with different leagues sizes," European Journal of Operational Research, Elsevier, vol. 307(1), pages 313-327.
    4. Dries Goossens & Jeroen Beliën, 2023. "Teaching Integer Programming by Scheduling the Belgian Soccer League," INFORMS Transactions on Education, INFORMS, vol. 23(3), pages 164-172, May.
    5. Luisa I. Martínez-Merino & Diego Ponce & Justo Puerto, 2023. "Constraint relaxation for the discrete ordered median problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(3), pages 538-561, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Guillermo Durán, 2021. "Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 125-155, April.
    2. Yun-Chia Liang & Yen-Yu Lin & Angela Hsiang-Ling Chen & Wei-Sheng Chen, 2021. "Variable Neighborhood Search for Major League Baseball Scheduling Problem," Sustainability, MDPI, vol. 13(7), pages 1-18, April.
    3. Rigo, Cezar Antônio & Seman, Laio Oriel & Camponogara, Eduardo & Morsch Filho, Edemar & Bezerra, Eduardo Augusto & Munari, Pedro, 2022. "A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service," European Journal of Operational Research, Elsevier, vol. 303(1), pages 168-183.
    4. Gondzio, Jacek & González-Brevis, Pablo & Munari, Pedro, 2013. "New developments in the primal–dual column generation technique," European Journal of Operational Research, Elsevier, vol. 224(1), pages 41-51.
    5. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    6. Kristiansen, Simon & Sørensen, Matias & Stidsen, Thomas R., 2011. "Elective course planning," European Journal of Operational Research, Elsevier, vol. 215(3), pages 713-720, December.
    7. Panagiotis Andrianesis & Dimitris Bertsimas & Michael C. Caramanis & William W. Hogan, 2020. "Computation of Convex Hull Prices in Electricity Markets with Non-Convexities using Dantzig-Wolfe Decomposition," Papers 2012.13331, arXiv.org, revised Oct 2021.
    8. Zhu, Wenbin & Huang, Weili & Lim, Andrew, 2012. "A prototype column generation strategy for the multiple container loading problem," European Journal of Operational Research, Elsevier, vol. 223(1), pages 27-39.
    9. Paul A. Chircop & Timothy J. Surendonk & Menkes H. L. van den Briel & Toby Walsh, 2022. "On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage," Annals of Operations Research, Springer, vol. 312(2), pages 723-760, May.
    10. Réal Carbonneau & Gilles Caporossi & Pierre Hansen, 2014. "Globally Optimal Clusterwise Regression By Column Generation Enhanced with Heuristics, Sequencing and Ending Subset Optimization," Journal of Classification, Springer;The Classification Society, vol. 31(2), pages 219-241, July.
    11. Eliashberg, Jehoshua & Hegie, Quintus & Ho, Jason & Huisman, Dennis & Miller, Steven J. & Swami, Sanjeev & Weinberg, Charles B. & Wierenga, Berend, 2009. "Demand-driven scheduling of movies in a multiplex," International Journal of Research in Marketing, Elsevier, vol. 26(2), pages 75-88.
    12. Alfandari, Laurent & Plateau, Agnès & Scheplerc, Xavier, 2014. "A Branch-and-Price-and-Cut Approach for Sustainable Crop Rotation Planning," ESSEC Working Papers WP1408, ESSEC Research Center, ESSEC Business School.
    13. Laurent Alfandari & Agnès Plateau & Xavier Schepler, 2014. "A Branch-and-Price-and-Cut approach for Sustainable Crop Rotation Planning," Working Papers hal-00987708, HAL.
    14. Jans, Raf, 2010. "Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 251-254, July.
    15. Jean Bertrand Gauthier & Jacques Desrosiers & Marco E. Lübbecke, 2016. "Tools for primal degenerate linear programs: IPS, DCA, and PE," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(2), pages 161-204, June.
    16. Muter, İbrahim & Birbil, Ş. İlker & Bülbül, Kerem, 2018. "Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows," European Journal of Operational Research, Elsevier, vol. 264(1), pages 29-45.
    17. Borzou Rostami & Guy Desaulniers & Fausto Errico & Andrea Lodi, 2021. "Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times," Operations Research, INFORMS, vol. 69(2), pages 436-455, March.
    18. Timo Gschwind & Stefan Irnich, 2016. "Dual Inequalities for Stabilized Column Generation Revisited," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 175-194, February.
    19. Desrosiers, Jacques & Gauthier, Jean Bertrand & Lübbecke, Marco E., 2014. "Row-reduced column generation for degenerate master problems," European Journal of Operational Research, Elsevier, vol. 236(2), pages 453-460.
    20. Melanie Erhard, 2021. "Flexible staffing of physicians with column generation," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 212-252, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:275:y:2019:i:1:d:10.1007_s10479-017-2595-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.