Integer and combinatorial optimization
Integer and combinatorial optimization
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
Delay Management Problem: Complexity Results and Robust Algorithms
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Recoverable Robust Timetables on Trees
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
To Wait or Not to Wait---And Who Goes First? Delay Management with Priority Decisions
Transportation 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 |
The delay management problem deals with reactions in case of delays in public transportation. More specifically, the aim is to decide if connecting vehicles should wait for delayed feeder vehicles or if it is better to depart on time. As objective we consider the convenience over all customers, expressed as the average delay of a customer when arriving at his or her destination. We present path-based and activity-based integer programming models for the delay management problem and show the equivalence of these formulations. Based on these, we present a simplification of the (cubic) activity-based model which results in an integer linear program. We identify cases in which this linearization is correct, namely if the so-called never-meet property holds. We analyze this property using real-world railway data. Finally, we show how to find an optimal solution in linear time if the never-meet property holds.