IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v275y2019i2d10.1007_s10479-018-3013-x.html
   My bibliography  Save this article

Scheduling a non-professional indoor football league: a tabu search based approach

Author

Listed:
  • David Bulck

    (Ghent University)

  • Dries R. Goossens

    (Ghent University)

  • Frits C. R. Spieksma

    (TU Eindhoven)

Abstract

This paper deals with a real-life scheduling problem of a non-professional indoor football league. The goal is to develop a schedule for a time-relaxed, double round-robin tournament which avoids close successions of games involving the same team in a limited period of time. This scheduling problem is interesting, because games are not planned in rounds. Instead, each team provides time slots in which they can play a home game, and time slots in which they cannot play at all. We present an integer programming formulation and a heuristic based on tabu search. The core component of this algorithm consists of solving a transportation problem, which schedules (or reschedules) all home games of a team. Our heuristic generates schedules with a quality comparable to those found with IP solvers, however with considerably less computational effort. These schedules were approved by the league organizers, and used in practice for the seasons 2009–2010 till 2016–2017.

Suggested Citation

  • David Bulck & Dries R. Goossens & Frits C. R. Spieksma, 2019. "Scheduling a non-professional indoor football league: a tabu search based approach," Annals of Operations Research, Springer, vol. 275(2), pages 715-730, April.
    • Handle: RePEc:spr:annopr:v:275:y:2019:i:2:d:10.1007_s10479-018-3013-x
    DOI: 10.1007/s10479-018-3013-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-3013-x
    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-018-3013-x?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. David Pisinger & Stefan Ropke, 2010. "Large Neighborhood Search," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 399-419, Springer.
    2. 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.
    3. Stephan Westphal, 2014. "Scheduling the German Basketball League," Interfaces, INFORMS, vol. 44(5), pages 498-508, October.
    4. 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.
    5. Knust, Sigrid, 2010. "Scheduling non-professional table-tennis leagues," European Journal of Operational Research, Elsevier, vol. 200(2), pages 358-367, January.
    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. 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.
    2. 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.

    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. Durán, Guillermo & Durán, Santiago & Marenco, Javier & Mascialino, Federico & Rey, Pablo A., 2019. "Scheduling Argentina’s professional basketball leagues: A variation on the Travelling Tournament Problem," European Journal of Operational Research, Elsevier, vol. 275(3), pages 1126-1138.
    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. Schönberger, Jörn, 2015. "Scheduling of Sport League Systems with Inter-League Constraints," Discussion Papers 2/2015, Technische Universität Dresden, "Friedrich List" Faculty of Transport and Traffic Sciences, Institute of Transport and Economics.
    4. Christian Ackermann & Felix Hahne & Julia Rieck, 2022. "Matching and Scheduling of Student-Company-Talks for a University IT-Speed Dating Event," SN Operations Research Forum, Springer, vol. 3(3), pages 1-29, September.
    5. David Van Bulck & Dries Goossens, 2022. "Optimizing rest times and differences in games played: an iterative two-phase approach," Journal of Scheduling, Springer, vol. 25(3), pages 261-271, June.
    6. 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.
    7. 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.
    8. Tasbih Tuffaha & Burak Çavdaroğlu & Tankut Atan, 2023. "Round-robin scheduling with regard to rest differences," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 269-301, July.
    9. 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.
    10. El Mehdi, Er Raqabi & Ilyas, Himmich & Nizar, El Hachemi & Issmaïl, El Hallaoui & François, Soumis, 2023. "Incremental LNS framework for integrated production, inventory, and vessel scheduling: Application to a global supply chain," Omega, Elsevier, vol. 116(C).
    11. Bach, Lukas & Hasle, Geir & Schulz, Christian, 2019. "Adaptive Large Neighborhood Search on the Graphics Processing Unit," European Journal of Operational Research, Elsevier, vol. 275(1), pages 53-66.
    12. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
    13. Guerrero, W.J. & Prodhon, C. & Velasco, N. & Amaya, C.A., 2013. "Hybrid heuristic for the inventory location-routing problem with deterministic demand," International Journal of Production Economics, Elsevier, vol. 146(1), pages 359-370.
    14. Mo, Pengli & Yao, Yu & D’Ariano, Andrea & Liu, Zhiyuan, 2023. "The vehicle routing problem with underground logistics: Formulation and algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    15. Andrea Lodi & Enrico Malaguti & Nicolás E. Stier-Moses & Tommaso Bonino, 2016. "Design and Control of Public-Service Contracts and an Application to Public Transportation Systems," Management Science, INFORMS, vol. 62(4), pages 1165-1187, April.
    16. Manfred Gilli & Enrico Schumann, 2012. "Heuristic optimisation in financial modelling," Annals of Operations Research, Springer, vol. 193(1), pages 129-158, March.
    17. Mohamed Abdel-Basset & Reda Mohamed & Karam M. Sallam & Ripon K. Chakrabortty, 2022. "Light Spectrum Optimizer: A Novel Physics-Inspired Metaheuristic Optimization Algorithm," Mathematics, MDPI, vol. 10(19), pages 1-63, September.
    18. Masson, Renaud & Lahrichi, Nadia & Rousseau, Louis-Martin, 2016. "A two-stage solution method for the annual dairy transportation problem," European Journal of Operational Research, Elsevier, vol. 251(1), pages 36-43.
    19. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    20. Ulrike Ritzinger & Jakob Puchinger & Richard Hartl, 2016. "Dynamic programming based metaheuristics for the dial-a-ride problem," Annals of Operations Research, Springer, vol. 236(2), pages 341-358, January.

    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:2:d:10.1007_s10479-018-3013-x. 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.