IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v25y2022i3d10.1007_s10951-022-00737-7.html
   My bibliography  Save this article

Pseudo-Boolean optimisation for RobinX sports timetabling

Author

Listed:
  • Martin Mariusz Lester

    (University of Reading)

Abstract

We report on the development of Reprobate, a tool for solving sports timetabling problems in a subset of the RobinX format. Our tool is based around a monolithic translation of a sports timetabling instance into a pseudo-Boolean (PB) optimisation problem; this instance can be solved using existing pseudo-Boolean solvers. Once the tool has found a feasible solution, it can improve it using a second encoding that alters only the home/away pattern of games. We entered our tool into the International Timetabling Competition 2021. While it was effective on many instances, it struggled to cope with schedules involving large break constraints. However, among instances for which it could initially find a feasible solution, the combination of use of a portfolio of solvers, a range of variations on the encoding and the aforementioned local improvement process yielded an average reduction in solution cost of 23%.

Suggested Citation

  • Martin Mariusz Lester, 2022. "Pseudo-Boolean optimisation for RobinX sports timetabling," Journal of Scheduling, Springer, vol. 25(3), pages 287-299, June.
    • Handle: RePEc:spr:jsched:v:25:y:2022:i:3:d:10.1007_s10951-022-00737-7
    DOI: 10.1007/s10951-022-00737-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-022-00737-7
    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/s10951-022-00737-7?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. Markus Triska & Nysret Musliu, 2012. "An effective greedy heuristic for the Social Golfer Problem," Annals of Operations Research, Springer, vol. 194(1), pages 413-425, April.
    2. Markus Triska & Nysret Musliu, 2012. "An improved SAT formulation for the social golfer problem," Annals of Operations Research, Springer, vol. 194(1), pages 427-438, April.
    3. 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.
    4. Van Bulck, David & Goossens, Dries & Schönberger, Jörn & Guajardo, Mario, 2020. "RobinX: A three-field classification and unified data format for round-robin sports timetabling," European Journal of Operational Research, Elsevier, vol. 280(2), pages 568-580.
    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. 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.

    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. 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.
    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. 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.
    4. Roel Lambers & Dries Goossens & Frits C. R. Spieksma, 2023. "The flexibility of home away pattern sets," Journal of Scheduling, Springer, vol. 26(5), pages 413-423, October.
    5. 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.
    6. George H. G. Fonseca & Túlio A. M. Toffolo, 2022. "A fix-and-optimize heuristic for the ITC2021 sports timetabling problem," Journal of Scheduling, Springer, vol. 25(3), pages 273-286, June.
    7. Goller, Daniel & Krumer, Alex, 2020. "Let's meet as usual: Do games played on non-frequent days differ? Evidence from top European soccer leagues," European Journal of Operational Research, Elsevier, vol. 286(2), pages 740-754.
    8. 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.
    9. Yi, Xiajie & Goossens, Dries & Nobibon, Fabrice Talla, 2020. "Proactive and reactive strategies for football league timetabling," European Journal of Operational Research, Elsevier, vol. 282(2), pages 772-785.
    10. Xiajie Yi & Dries Goossens, 2023. "Strategies for dealing with uncertainty in time-relaxed sports timetabling," Annals of Operations Research, Springer, vol. 320(1), pages 473-492, January.
    11. Bergantiños, Gustavo & Moreno-Ternero, Juan D., 2022. "Monotonicity in sharing the revenues from broadcasting sports leagues," European Journal of Operational Research, Elsevier, vol. 297(1), pages 338-346.
    12. Briskorn, Dirk & Horbach, Andrei, 2009. "A Lagrangian approach for minimum cost tournaments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 647, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Jaeseob Han & Seung-Hyun Jeon & Gyeong-Ho Lee & Sangdon Park & Jun-Kyun Choi, 2023. "Power and Frequency Band Allocation Mechanisms for WPT System with Logarithmic-Based Nonlinear Energy Harvesting Model," Sustainability, MDPI, vol. 15(13), pages 1-27, July.
    14. 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.
    15. Jari Kyngäs & Kimmo Nurmi & Nico Kyngäs & George Lilley & Thea Salter & Dries Goossens, 2017. "Scheduling the Australian Football League," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 973-982, August.
    16. David Van Bulck & Dries Goossens & Jo¨rn Scho¨nberger & Mario Guajardo, 2020. "An Instance Data Repository for the Round-robin Sports Timetabling Problem," Management and Labour Studies, XLRI Jamshedpur, School of Business Management & Human Resources, vol. 45(2), pages 184-200, May.
    17. Smith Zachary J. & Bickel J. Eric, 2023. "A roster construction decision tool for MLS expansion teams," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 19(1), pages 1-14, March.
    18. Hoshino, Richard & Kawarabayashi, Ken-ichi, 2011. "A multi-round generalization of the traveling tournament problem and its application to Japanese baseball," European Journal of Operational Research, Elsevier, vol. 215(2), pages 481-497, December.
    19. 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.
    20. Alireza Tajbakhsh & Kourosh Eshghi & Azam Shamsi, 2012. "A hybrid PSO-SA algorithm for the travelling tournament problem," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(1), pages 2-25.

    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:jsched:v:25:y:2022:i:3:d:10.1007_s10951-022-00737-7. 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.