Some optimal inapproximability results
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
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
Delay Management Problem: Complexity Results and Robust Algorithms
COCOA 2008 Proceedings of the 2nd 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
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
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 for public transport consists of deciding whether vehicles should wait for delayed transferring passengers, with the objective of minimizing the overall passenger discomfort. This paper classifies the computational complexity of delay management problems with respect to various structural parameters, such as the maximum number of passenger transfers, the graph topology, and the capability of trains to reduce delays. Our focus is to distinguish between polynomially solvable and nP-complete problem variants. To that end, we show that even fairly restricted versions of the delay management problem are hard to solve.