A fast heuristic for the train scheduling problem
Computers and Operations Research
A Survey of Optimization Models for Train Routing and Scheduling
Transportation Science
TOPSU - RDM a simulation platform for online railway delay management
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Reordering and Local Rerouting Strategies to Manage Train Traffic in Real Time
Transportation Science
To Wait or Not to Wait? The Bicriteria Delay Management Problem in Public Transportation
Transportation Science
Computing delay resistant railway timetables
Computers and Operations Research
Integer programming approaches for solving the delay management problem
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
Online delay management on a single train line
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
The computational complexity of delay management
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Passenger flow-oriented train disposition
ESA'11 Proceedings of the 19th European conference on Algorithms
Information Sciences: an International Journal
Delay Management with Rerouting of Passengers
Transportation Science
Hi-index | 0.00 |
Delay management is an important issue in the daily operations of any railway company. The task is to update the planned timetable to a disposition timetable in such a way that the inconvenience for the passengers is as small as possible. The two main decisions that have to be made in this respect are the wait-depart decisions, to decide which connections should be maintained in case of delays, and the priority decisions, which determine the order in which trains are allowed to pass a specific piece of track. The latter are necessary to take the limited capacity of the track system into account. While the wait-depart decisions have been intensively studied in the literature, the priority decisions in the capacitated case have been neglected so far in delay management optimization models. In the current paper, we add the priority decisions to the integer programming formulation of the delay management problem and are hence able to deal with the capacitated case. The corresponding constraints are disjunctive constraints leading to cycles in the resulting event-activity network. Nevertheless, we are able to derive reduction techniques for the network that enable us to extend the formulation of the never-meet property from the uncapacitated delay management problem to the capacitated case. We then use our results to derive exact and heuristic solution procedures for solving the delay management problem. The results of the algorithms are evaluated both from a theoretical and a numerical point of view. The latter has been done within a case study using the railway network in the region of Harz, Germany.