IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v70y2022i4p2101-2118.html
   My bibliography  Save this article

Easy Cases of Deadlock Detection in Train Scheduling

Author

Listed:
  • Veronica Dal Sasso

    (OptRail, Rome 00154, Italy)

  • Leonardo Lamorgese

    (OptRail, Rome 00154, Italy)

  • Carlo Mannino

    (SINTEF, Oslo 0373, Norway; University of Oslo, Oslo, Norway)

  • Antonio Tancredi

    (OptRail, Rome 00154, Italy)

  • Paolo Ventura

    (Institute of System Analysis and Informatics (IASI) of CNR, Rome 00185, Italy)

Abstract

A deadlock occurs when two or more trains are preventing each other from moving forward by occupying the required tracks. Deadlocks are rare but pernicious events in railroad operations and, in most cases, are caused by human errors. Recovering is a time-consuming and costly operation, producing large delays and often requiring crew rescheduling and complex switching moves. In practice, most deadlocks involve only two long trains missing their last potential meet location. In this paper, we prove that, for any network configuration, the identification of two-train deadlocks can be performed in polynomial time. This is the first exact polynomial algorithm for such a practically relevant combinatorial problem. We also develop a pseudo-polynomial but efficient oracle that allows real-time early detection and prevention of any (potential) two-train deadlock in the Union Pacific (a U.S. class 1 rail company) railroad network. A deadlock prevention module based on the work in this paper will be put in place at Union Pacific to prevent all deadlocks of this kind.

Suggested Citation

  • Veronica Dal Sasso & Leonardo Lamorgese & Carlo Mannino & Antonio Tancredi & Paolo Ventura, 2022. "Easy Cases of Deadlock Detection in Train Scheduling," Operations Research, INFORMS, vol. 70(4), pages 2101-2118, July.
    • Handle: RePEc:inm:oropre:v:70:y:2022:i:4:p:2101-2118
    DOI: 10.1287/opre.2022.2283
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.2283
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2022.2283?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
    ---><---

    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:inm:oropre:v:70:y:2022:i:4:p:2101-2118. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.