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
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
Computers and Operations Research
Sustainable revenue management: A smart card enabled agent-based modeling approach
Decision Support Systems
| Hi-index | 0.00 |
Assume that a train reaches a station with delay. At the station there is a bus ready to depart. The question of whether the bus should wait for the delayed train or depart on time is called the delay management problem. Different single objective functions for this problem have been introduced and analyzed. In this paper, we present a bicriteria model for the delay management problem, taking into account both the delay of the vehicles and the number of passengers who miss a connection. Our model does not depend on detailed data about the passengers and hence can be easily implemented in practice. To analyze the problem, we present an integer programming formulation and a graph-theoretic approach that is based on discrete time/cost trade-off project networks. Using results of project planning, we develop an efficient solution method. We tested our procedure using real-world data. The results show the applicability of the approach.