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

Veronica Dal Sasso (), Leonardo Lamorgese (), Carlo Mannino (), Andrea Onofri () and Paolo Ventura ()
Additional contact information
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

Transportation Science, 2025, vol. 59, issue 1, 187-205

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.

Keywords: deadlock detection; 1 linear programming; branch and cut; railways; real-time optimization (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2024.0521 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:59:y:2025:i:1:p:187-205

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().