Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The First Optimized Railway Timetable in Practice
Transportation Science
To Wait or Not to Wait? The Bicriteria Delay Management Problem in Public Transportation
Transportation Science
The New Dutch Timetable: The OR Revolution
Interfaces
To Wait or Not to Wait---And Who Goes First? Delay Management with Priority Decisions
Transportation Science
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
| Hi-index | 0.00 |
The question of delay management (DM) is whether trains should wait for a delayed feeder train or should depart on time. In classical DM models, passengers are assumed to take their originally planned routes. After the wait-depart decisions are made, passengers will certainly change to the best-possible route according to these decisions. In this paper, we propose a model where such a rerouting of passengers is incorporated in the DM process. To describe the problem, we represent it as an event-activity network similar to the one used in classical DM, with some additional events to incorporate origin and destination of the passengers. We present an integer programming formulation of this problem. Furthermore, we discuss the variant in which we assume fixed costs for maintaining connections, and we present a polynomial algorithm for the special case of only one origin-destination pair that we later use to derive a strong lower bound for the integer program. Finally, computational experiments based on real-world data from Netherlands Railways show that significant improvements with respect to the passengers' traveling times can be obtained by taking the rerouting of passengers into account in the model.