IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v323y2025i1p208-223.html
   My bibliography  Save this article

Beyond leagues: A single incomplete round robin tournament for multi-league sports timetabling

Author

Listed:
  • Li, Miao
  • Van Bulck, David
  • Goossens, Dries

Abstract

Most sports associations regularly face the problem of determining and scheduling games for dozens if not hundreds of non-professional (youth) teams. For practical reasons and player convenience, it is key that the schedule respects venue capacities and minimizes travel distance. A classic approach is to split up teams over leagues, and then have each league play a round robin tournament. In a round robin tournament, each team competes against every other team in the tournament an equal number of times. This paper proposes an alternative approach, organizing a single yet incomplete round robin tournament involving all teams. In this format, which can be seen as a static Swiss system tournament, each team plays the same number of games, but teams are not required to face the same opponents. We exploit this flexibility to reduce the total travel distance and venue capacity conflicts. We provide theoretical results on the computational complexity of finding an incomplete round robin tournament, as well as sufficient conditions on its existence. Besides a Benders’ decomposition for the classic round robin approach, we develop a relax-and-fix and an iterative two-phase decomposition metaheuristic for the incomplete round robin approach. The metaheuristic first determines the home-away status of teams based on their club’s venue capacity, and thereafter selects suitable opponents while minimizing travel distances. Extensive experiments using real-life benchmark instances from the literature confirm the advantage of an incomplete round robin tournament compared to the classic multi-league round robin approach and validate the effectiveness of the proposed heuristics.

Suggested Citation

  • Li, Miao & Van Bulck, David & Goossens, Dries, 2025. "Beyond leagues: A single incomplete round robin tournament for multi-league sports timetabling," European Journal of Operational Research, Elsevier, vol. 323(1), pages 208-223.
    • Handle: RePEc:eee:ejores:v:323:y:2025:i:1:p:208-223
    DOI: 10.1016/j.ejor.2024.11.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724008579
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.11.007?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Richard Hoshino & Ken-ichi Kawarabayashi, 2013. "An Approximation Algorithm for the Bipartite Traveling Tournament Problem," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 720-728, November.
    2. 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.
    3. David S. Johnson & Cecilia R. Aragon & Lyle A. McGeoch & Catherine Schevon, 1989. "Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning," Operations Research, INFORMS, vol. 37(6), pages 865-892, December.
    4. Mendonca, D. & Raghavachari, M., 2000. "Comparing the efficacy of ranking methods for multiple round-robin tournaments," European Journal of Operational Research, Elsevier, vol. 123(3), pages 593-605, June.
    5. László Csató, 2013. "Ranking by pairwise comparisons for Swiss-system tournaments," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(4), pages 783-803, December.
    6. Van Bulck, David & Goossens, Dries, 2023. "The international timetabling competition on sports timetabling (ITC2021)," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1249-1267.
    7. Fernando Alarcón & Guillermo Durán & Mario Guajardo & Jaime Miranda & Hugo Muñoz & Luis Ramírez & Mario Ramírez & Denis Sauré & Matías Siebert & Sebastián Souyris & Andrés Weintraub & Rodrigo Wolf-Yad, 2017. "Operations Research Transforms the Scheduling of Chilean Soccer Leagues and South American World Cup Qualifiers," Interfaces, INFORMS, vol. 47(1), pages 52-69, February.
    8. Dong, Zhi-Long & Ribeiro, Celso C. & Xu, Fengmin & Zamora, Ailec & Ma, Yujie & Jing, Kui, 2023. "Dynamic scheduling of e-sports tournaments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    9. George L. Nemhauser & Michael A. Trick, 1998. "Scheduling A Major College Basketball Conference," Operations Research, INFORMS, vol. 46(1), pages 1-8, February.
    10. Mark Grabau, 2012. "Softball Scheduling as Easy as 1-2-3 (Strikes You're Out)," Interfaces, INFORMS, vol. 42(3), pages 310-319, June.
    11. Van Bulck, David & Goossens, Dries & Clarner, Jan-Patrick & Dimitsas, Angelos & Fonseca, George H.G. & Lamas-Fernandez, Carlos & Lester, Martin Mariusz & Pedersen, Jaap & Phillips, Antony E. & Rosati,, 2024. "Which algorithm to select in sports timetabling?," European Journal of Operational Research, Elsevier, vol. 318(2), pages 575-591.
    12. Schmand, Daniel & Schröder, Marc & Vargas Koch, Laura, 2022. "A greedy algorithm for the social golfer and the Oberwolfach problem," European Journal of Operational Research, Elsevier, vol. 300(1), pages 310-319.
    13. Van Bulck, David & Goossens, Dries, 2023. "A traditional Benders’ approach to sports timetabling," European Journal of Operational Research, Elsevier, vol. 307(2), pages 813-826.
    14. van Doornmalen, Jasper & Hojny, Christopher & Lambers, Roel & Spieksma, Frits C.R., 2023. "Integer programming models for round robin tournaments," European Journal of Operational Research, Elsevier, vol. 310(1), pages 24-33.
    15. 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.
    16. Rasmussen, Rasmus V. & Trick, Michael A., 2008. "Round robin scheduling - a survey," European Journal of Operational Research, Elsevier, vol. 188(3), pages 617-636, August.
    17. László Csató, 2017. "On the ranking of a Swiss system chess team tournament," Annals of Operations Research, Springer, vol. 254(1), pages 17-36, July.
    Full references (including those not matched with items on IDEAS)

    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. Devriesere, Karel & Csató, László & Goossens, Dries, 2025. "Tournament design: A review from an operational research perspective," European Journal of Operational Research, Elsevier, vol. 324(1), pages 1-21.
    3. Ritxar Arlegi & Dinko Dimitrov, 2023. "League competitions and fairness," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-18, May.
    4. van Doornmalen, Jasper & Hojny, Christopher & Lambers, Roel & Spieksma, Frits C.R., 2023. "Integer programming models for round robin tournaments," European Journal of Operational Research, Elsevier, vol. 310(1), pages 24-33.
    5. László Csató, 2024. "Club coefficients in the UEFA Champions League: Time for shift to an Elo-based formula," International Journal of Performance Analysis in Sport, Taylor & Francis Journals, vol. 24(2), pages 119-134, March.
    6. Van Bulck, David & Goossens, Dries & Clarner, Jan-Patrick & Dimitsas, Angelos & Fonseca, George H.G. & Lamas-Fernandez, Carlos & Lester, Martin Mariusz & Pedersen, Jaap & Phillips, Antony E. & Rosati,, 2024. "Which algorithm to select in sports timetabling?," European Journal of Operational Research, Elsevier, vol. 318(2), pages 575-591.
    7. L'aszl'o Csat'o, 2023. "Club coefficients in the UEFA Champions League: Time for shift to an Elo-based formula," Papers 2304.09078, arXiv.org, revised Oct 2023.
    8. Szádoczki, Zsombor, 2022. "Operációkutatás a sportok profitabilitásáért. László Csató: Tournament Design. How Operations Research Can Improve Sports Rules? Palgrave Pivots in Sports Economics, Palgrave Macmillan, 2021, 175 o," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(2), pages 283-288.
    9. 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.
    10. Guillermo Durán & Mario Guajardo & Facundo Gutiérrez & Javier Marenco & Denis Sauré & Gonzalo Zamorano, 2021. "Scheduling the Main Professional Football League of Argentina," Interfaces, INFORMS, vol. 51(5), pages 361-372, September.
    11. László Csató, 2019. "An impossibility theorem for paired comparisons," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 497-514, June.
    12. Éva Orbán-Mihálykó & Csaba Mihálykó & László Gyarmati, 2024. "Evaluating the capacity of paired comparison methods to aggregate rankings of separate groups," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 32(1), pages 109-129, March.
    13. Szádoczki, Zsombor & Bozóki, Sándor & Tekile, Hailemariam Abebe, 2022. "Filling in pattern designs for incomplete pairwise comparison matrices: (Quasi-)regular graphs with minimal diameter," Omega, Elsevier, vol. 107(C).
    14. Elizabeth L. Bouzarth & Benjamin C. Grannan & John M. Harris & Kevin R. Hutson, 2022. "Scheduling the Valley Baseball League," Interfaces, INFORMS, vol. 52(2), pages 189-197, March.
    15. Lim, A. & Rodrigues, B. & Zhang, X., 2006. "A simulated annealing and hill-climbing algorithm for the traveling tournament problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1459-1478, November.
    16. Özlü, Oğuzhan & Sokol, Joel, 2016. "An optimization approach to designing a baseball scout network," European Journal of Operational Research, Elsevier, vol. 255(3), pages 948-960.
    17. Ágoston, Kolos Csaba & Csató, László, 2022. "Inconsistency thresholds for incomplete pairwise comparison matrices," Omega, Elsevier, vol. 108(C).
    18. L'aszl'o Csat'o, 2024. "Most Swiss-system tournaments are unfair: Evidence from chess," Papers 2410.19333, arXiv.org, revised Jul 2025.
    19. Roberto Maria Rosati & Matteo Petris & Luca Di Gaspero & Andrea Schaerf, 2022. "Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021," Journal of Scheduling, Springer, vol. 25(3), pages 301-319, June.
    20. Lim, A. & Rodrigues, B. & Zhang, X., 2006. "Scheduling sports competitions at multiple venues--Revisited," European Journal of Operational Research, Elsevier, vol. 175(1), pages 171-186, November.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:ejores:v:323:y:2025:i:1:p:208-223. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.