IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v59y2025i1p187-205.html
   My bibliography  Save this article

A 0,1 Linear Programming Approach to Deadlock Detection and Management in Railways

Author

Listed:
  • Veronica Dal Sasso

    (Siemens Mobility, 00154 Rome, Italy)

  • Leonardo Lamorgese

    (Siemens Mobility, 00154 Rome, Italy)

  • Carlo Mannino

    (Sintef, 0314 Oslo, Norway; and Siemens Mobility, 0596 Oslo, Norway)

  • Andrea Onofri

    (Siemens Mobility, 00154 Rome, Italy)

  • Paolo Ventura

    (Siemens Mobility, 00154 Rome, Italy)

Abstract

In railway systems, a deadlock occurs when trains accidentally occupy positions that prevent each other from moving forward. Although deadlocks are rare events, they do occur from time to time, requiring costly recourse actions and generating significant knock-on delays. In this paper, we present a noncompact 0,1 linear programming formulation and a methodology for discovering (possibly future) deadlocks and the subsequent implementation of optimal recovery measures. The approach is implemented in a tool to dispatch trains in real time developed in cooperation with Union Pacific (UP) and currently in operations on the entire UP network.

Suggested Citation

  • Veronica Dal Sasso & Leonardo Lamorgese & Carlo Mannino & Andrea Onofri & Paolo Ventura, 2025. "A 0,1 Linear Programming Approach to Deadlock Detection and Management in Railways," Transportation Science, INFORMS, vol. 59(1), pages 187-205, January.
  • Handle: RePEc:inm:ortrsc:v:59:y:2025:i:1:p:187-205
    DOI: 10.1287/trsc.2024.0521
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2024.0521
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2024.0521?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:ortrsc:v:59:y:2025:i:1:p:187-205. 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.