Links

Modeling Train Movements Through Complex Rail Networks

Lu, Dessouky and Leachman on network modelling, safe buffers and deadlock-free train routing through complex railway networks.

Inglenook Sidings — The Rules

The rules of the classic Inglenook shunting puzzle: a compact track plan with simple rules and surprising operational depth.

Dynamic Scheduling of Trains in Densely Trafficked Rail Networks

Develops the FreePath and Greedy dispatching approaches. Trains may proceed when a safe buffer exists, with preceding trains travelling in the same direction included in the decision.

Searching Feasible Resources to Reduce False-Positive Situations for Resolving Deadlocks with the Banker’s Algorithm in Railway Simulation

Combines the Banker’s algorithm with a search for feasible resources so that safe train movements are rejected less conservatively.

The Tick Formulation for Deadlock Detection and Avoidance in Railways Traffic Control

A formal model that decomposes train journeys into short moves over shared resources and can assign safe waiting places when deadlock threatens.

Deadlock Avoidance and Detection in Railway Simulation Systems

An exact reservation-based algorithm that either produces deadlock-free train scheduling or identifies an unavoidable deadlock.

Reordering and Local Rerouting Strategies to Manage Train Traffic in Real Time

The ROMA system combines the order in which trains use infrastructure with local rerouting through an alternative graph.

Linear-Time Optimal Deadlock Detection for Efficient Scheduling in Multi-Track Railway Networks

A recent linear-time deadlock test for certain multi-track railway networks, evaluated with data from Indian Railways.

Modeling and Supervisory Control of Railway Networks Using Petri Nets

Models stations, tracks, signals and sensors with Petri nets and uses supervisory control to prevent collisions and deadlocks.

Monitor Design for Colored Petri Nets: An Application to Deadlock Prevention in Railway Networks

Uses coloured Petri nets in which places represent tracks and stations while coloured tokens represent different trains.

A Model and Strategy for Train Pathing with Choice of Lines, Platforms, and Routes

A classic train-pathing model with choices between lines, platforms and routes, including mutual constraints and running times.

Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks

Lifelong Multi-Agent Path Finding: agents continue operating while receiving new temporary tasks. This is close to free driving without a fixed final destination.

Conflict-Based Search for Optimal Multi-Agent Path Finding

Conflict-Based Search computes individual paths and then systematically resolves conflicts between multiple concurrently moving agents.