SCHEDULING TRAINS ON A RAILWAY NETWORK USING A DISCRETE EVENT MODEL OF RAILWAY TRAFFIC
operations - scheduling, operations - traffic, infrastructure - track, ridership - commuting, mode - rail
Travel time, Train traffic, Schedules and scheduling, Railroad traffic, Networks, Journey time, Double track, Discrete time systems, Discrete systems
This paper develops a local feedback-based travel advance strategy for computing railway network schedules. The strategy uses a discrete event model of train advances along lines of the railway. This approach can quickly handle perturbations in the schedule and is shown to perform well on three time-performance criteria while maintaining the local nature of the strategy. If the local strategy leads to a deadlock, a capacity check algorithm is applied that prevents deadlock, but requires additional nonlocal information. Extensions to the strategy are developed for networks with double-track sections and with variable train characteristics and priorities. The approach also is shown to be computationally efficient.
Dorfman, M, Medanic, J, (2004). SCHEDULING TRAINS ON A RAILWAY NETWORK USING A DISCRETE EVENT MODEL OF RAILWAY TRAFFIC. Transportation Research Part B: Methodological, Volume 38, Issue 1, p. 81-98.