IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-032-00385-0_62.html
   My bibliography  Save this book chapter

Metaheuristics for Problems in Sports Scheduling

In: Handbook of Heuristics

Author

Listed:
  • Celso C. Ribeiro

    (Universidade Federal Fluminense, Institute of Computing)

  • Sebastián Urrutia

    (Molde University College, Faculty of Logistics)

  • Dominique de Werra

    (Ecole Polytechnique Fédérale de Lausanne, Département de Mathématiques)

Abstract

In this chapter, we consider the problem of scheduling time-constrained round-robin sports tournament problems, metaheuristics for its approximate solution, and their practical applications. This chapter uses graph theory as the fundamental tool. It presents a short introduction to its essential elements, definitions, and results relevant to the subject of this work. We also introduce the basic graph model used to represent single round-robin tournaments and the circle method for constructing timetables. We describe the different neighborhood structures that have been used in the literature of metaheuristics and local search procedures for scheduling time-constrained single round-robin sports tournaments: Home-Away Swap, Team Swap, Partial Team Swap, Round Swap, Partial Round Swap, and Generalized Partial Team Swap. They may be directly extended to double round-robin problems. We conclude by presenting a collection of applications of metaheuristics to sports scheduling problems.

Suggested Citation

  • Celso C. Ribeiro & Sebastián Urrutia & Dominique de Werra, 2025. "Metaheuristics for Problems in Sports Scheduling," Springer Books, in: Rafael Martí & Panos M. Pardalos & Mauricio G.C. Resende (ed.), Handbook of Heuristics, edition 0, chapter 48, pages 1493-1522, Springer.
    • Handle: RePEc:spr:sprchp:978-3-032-00385-0_62
    DOI: 10.1007/978-3-032-00385-0_62
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    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:spr:sprchp:978-3-032-00385-0_62. 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: 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.