Title
Online delay management on a single train line: beyond competitive analysis
Abstract
We consider the Online Delay Management Problem (ODMP) on a network with a path topology that is served by one train. In this problem the number of delayed passengers who want to board the train is not known beforehand but revealed in an online fashion once the train arrives at the corresponding station. The goal is to decide at which station a train should wait in order to minimize the total delay of all passengers.
Year
DOI
Venue
2013
10.1007/s12469-013-0070-z
Public Transport
Keywords
Field
DocType
stochastic processes,algorithms,analysis
Online algorithm,Transport engineering,Stochastic process,Engineering,On-time performance,Stochastic programming,Operations management,Competitive analysis
Journal
Volume
Issue
ISSN
5
3
1613-7159
Citations 
PageRank 
References 
5
0.44
12
Authors
3
Name
Order
Citations
PageRank
Marco Bender1122.33
sabine buttner250.78
Sven O. Krumke330836.62