| People | Locations | Statistics |
|---|---|---|
| Ziakopoulos, Apostolos | Athens |
|
| Vigliani, Alessandro | Turin |
|
| Catani, Jacopo | Rome |
|
| Statheros, Thomas | Stevenage |
|
| Utriainen, Roni | Tampere |
|
| Guglieri, Giorgio | Turin |
|
| Martínez Sánchez, Joaquín |
| |
| Tobolar, Jakub |
| |
| Volodarets, M. |
| |
| Piwowar, Piotr |
| |
| Tennoy, Aud | Oslo |
|
| Matos, Ana Rita |
| |
| Cicevic, Svetlana |
| |
| Sommer, Carsten | Kassel |
|
| Liu, Meiqi |
| |
| Pirdavani, Ali | Hasselt |
|
| Niklaß, Malte |
| |
| Lima, Pedro | Braga |
|
| Turunen, Anu W. |
| |
| Antunes, Carlos Henggeler |
| |
| Krasnov, Oleg A. |
| |
| Lopes, Joao P. |
| |
| Turan, Osman |
| |
| Lučanin, Vojkan | Belgrade |
|
| Tanaskovic, Jovan |
|
MANNINO, CARLO
in Cooperation with on an Cooperation-Score of 37%
Topics
- railway train
- algorithm
- human being
- prevention
- scheduling
- corporation
- railway network
- human error
- railway company
- air traffic
- air traffic control
- beltway
- crash
- simulation
- estimating
- software
- region
- airport
- constraint
- bottleneck
- highway traffic control
- occupation
- airplane
- timetable
- shopping facility
- infrastructure
- timetable scheduling
- single track
- railway traffic
- flexibility
- expansion
- modernization
- rolling stock
- two-rail track
- double track
- property
- managerial personnel
- passenger
- optimisation
- vehicle occupant
- hub
- autumn
- prototype
- deviation
- dispatching
- passenger train
- dispatcher
- main station
- traffic control
- industry
- abstract
- modeling
- operations research
- computer science
- control device
- variable
- flight
- definition
- departure time
- management science
- supporting
- airspace
- workload
- air traffic controller
- vehicle
- routing
- surveillance
- learning
- experiment
- laceration
- aircraft pilotage
- public transport
- transportation engineering
- decision making
- economic growth
- committee
- air shipment
- sustainable development
- aviation
- airline
- aerospace engineering
- attention
- implementation
- design
- regional railway
- landing
- machinery
- engineering
- mixed integer programming
- airport runway
- sequencing
- taxicab
- pressure
- decomposition
- tower
- emergency response time
- commodity
- control system
- shipment
- linear programming
- traffic control system
- costs
- railway station
- show 73 more
Publications (16/16 displayed)
- 2022Easy Cases of Deadlock Detection in Train Schedulingcitations
- 2022Scheduling Vehicles with Spatial Conflicts
- 2022A MILP model for quasi-periodic strategic train timetablingcitations
- 2022Disruption management in railway systems by safe place assignment
- 2022Optimal Train Rescheduling in Oslo Central Stationcitations
- 2021The Tick Formulation for deadlock detection and avoidance in railways traffic controlcitations
- 2020Air Traffic Flow Management with Layered Workload Constraintscitations
- 2020Generalized Periodic Vehicle Routing and Maritime Surveillancecitations
- 2020Combinatorial Learning in Traffic Management
- 2019Can Holistic Optimization Improve Airport Air Traffic Management Performance
- 2018Train Dispatchingcitations
- 2017Optimal design of a regional railway service in Italycitations
- 2017Time-Indexed Formulations for the Runway Scheduling Problemcitations
- 2013Integrated surface and departure management at airports by optimizationcitations
- 2011Real-time traffic control in railway systems
- 2009Optimal Real-Time Traffic Control in Metro Stationscitations
Places of action
article
Easy Cases of Deadlock Detection in Train Scheduling
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. ; acceptedVersion
Topics
Search in FID move catalog