Optimization in Public Transportation: Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network (Springer Optimization and Its Applications)
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
Computing delay resistant railway timetables
Computers and Operations Research
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
Information Sciences: an International Journal
The computational complexity of delay management
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Delay Management with Rerouting of Passengers
Transportation Science
| Hi-index | 0.00 |
We provide competitive analyses for the online delay management problem on a single train line. The passengers that want to connect to the train line might arrive delayed at the connecting stations, and these delays happen in an online setting. Our objective is to minimize the total passenger delay on the train line. We relate this problem to the Ski-Rental problem and present a family of 2-competitive online algorithms. Further, we show that no online algorithm for this problem can be better than Golden Ratio competitive, and that no online algorithm can be competitive if the objective accounts only for the optimizable passenger delay.