IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v351y2025i1d10.1007_s10479-024-06394-7.html
   My bibliography  Save this article

Modelling and approximate approaches to organising horse race schedules

Author

Listed:
  • Antoine Houdayer

    (CNAM)

  • Agnès Plateau

    (CNAM)

  • Eric Soutil

    (CNAM)

Abstract

In this paper, we study a scheduling problem in horse race organisation. Horse races must be planned using a predefined racing calendar over a given time period to maximise the total number of runners, while satisfying hard constraints based on racing codes and soft constraints for the modelling of potential race sequences. Two metaheuristics guided by a penalty function and using specialised neighbourhoods are implemented and applied to real and artificial instances. The numerical experiments show the effectiveness of the methods compared to a more naïve neighbourhood, a heuristic, and manual planning by human experts. We then propose a compact 0-1 linear programming formulation that simplifies the initial problem and provide a proof of its NP-hardness to highlight the difficulty of the problem we have solved.

Suggested Citation

  • Antoine Houdayer & Agnès Plateau & Eric Soutil, 2025. "Modelling and approximate approaches to organising horse race schedules," Annals of Operations Research, Springer, vol. 351(1), pages 543-561, August.
    • Handle: RePEc:spr:annopr:v:351:y:2025:i:1:d:10.1007_s10479-024-06394-7
    DOI: 10.1007/s10479-024-06394-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-024-06394-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/s10479-024-06394-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

    for a different version of it.

    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:annopr:v:351:y:2025:i:1:d:10.1007_s10479-024-06394-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.

    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.