Skip to main navigation Skip to search Skip to main content

Which algorithm to select in sports timetabling?

  • David Van Bulck*
  • , Dries Goossens
  • , Jan Patrick Clarner
  • , Angelos Dimitsas
  • , George H.G. Fonseca
  • , Carlos Lamas-Fernandez
  • , Martin Mariusz Lester
  • , Jaap Pedersen
  • , Antony E. Phillips
  • , Roberto Maria Rosati
  • *Corresponding author for this work

Publication: Scientific journal › Journal article › peer-review

Abstract

Any sports competition needs a timetable, specifying when and where teams meet each other. The recent International Timetabling Competition (ITC2021) on sports timetabling showed that, although it is possible to develop general algorithms, the performance of each algorithm varies considerably over the problem instances. This paper provides a problem type analysis for sports timetabling, resulting in powerful insights into the strengths and weaknesses of eight state-of-the-art algorithms. Based on machine learning techniques, we propose an algorithm selection system that predicts which algorithm is likely to perform best based on the type of competition and constraints being used (i.e., the problem type) in a given sports timetabling problem instance. Furthermore, we visualize how the problem type relates to algorithm performance, providing insights and possibilities to further enhance several algorithms. Finally, we assess the empirical hardness of the instances. Our results are based on large computational experiments involving about 50 years of CPU time on more than 500 newly generated problem instances.

Original languageEnglish
Pages (from-to)575-591
Number of pages17
JournalEuropean Journal of Operational Research
Volume318
Issue number2
DOIs
Publication statusPublished - 16 Oct 2024
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2024 Elsevier B.V.

Keywords

  • Algorithm selection
  • Instance space analysis
  • ITC2021
  • OR in sports
  • Sports scheduling

Cite this