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

Which algorithm to select in sports timetabling?

Author

Listed:
  • 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, Roberto Maria

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.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:318:y:2024:i:2:p:575-591
    DOI: 10.1016/j.ejor.2024.06.005
    as

    Download full text from publisher

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

    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:318:y:2024:i:2:p:575-591. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.