Abstract
We present extensions to the Online Delay Management Problem on a Single Train Line. While a train travels along the line, it learns at each station how many of the passengers wanting to board the train have a delay of δ. If the train does not wait for them, they get delayed even more since they have to wait for the next train. Otherwise, the train waits and those passengers who were on time are delayed by δ. The problem consists in deciding when to wait in order to minimize the total delay of all passengers on the train line. We provide an improved lower bound on the competitive ratio of any deterministic online algorithm solving the problem using game tree evaluation. For the extension of the original model to two possible passenger delays δ 1 and δ 2, we present a 3-competitive deterministic online algorithm. Moreover, we study an objective function modeling the refund system of the German national railway company, which pays passengers with a delay of at least Δ a part of their ticket price back. In this setting, the aim is to maximize the profit. We show that there cannot be a deterministic competitive online algorithm for this problem and present a 2-competitive randomized algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adenso-Díaz B, Oliva González M, González-Torre P (1999) On-line timetable re-scheduling in regional train services. Transp Res Part B Methodol 33(6): 387–398
Anderegg L, Penna P, Widmayer P (2002) Online train disposition: to wait or not to wait? Electron Notes Theor Comput Sci 66(6):32–41
Berger A, Hoffmann R, Lorenz U, Stiller S (2008) TOPSU—RDM a simulation platform for online railway delay management. In: Proceedings of the 1st international conference on simulation tools and techniques for communications, networks and systems (SIMUTools). pp 1–8
Biederbick C, Suhl L (2004) Decision support tools for customer-oriented dispatching. Algorithm Methods Railw Optim LNCS 4359: 171–183
Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge
Gatto M, Glaus B, Jacob R, Peeters L, Widmayer P (2004a) Railway delay management: exploring its algorithmic complexity. In: Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS, vol 3111. pp 199–211
Gatto M, Jacob R, Peeters L, Widmayer P (2004b) Online delay management on a single train line. In: Proceedings of the 4th workshop on algorithmic methods and models for optimization of railways (ATMOS), LNCS, vol 4359. pp 306–320
Gatto M, Jacob R, Peeters L, Schöbel A (2005) The computational complexity of delay management. In: Proceedings of the 31st international workshop on graph-theoretic concepts in computer science (WG), LNCS, vol 3787. pp 227–238
Osborne MJ (2004) An introduction to game theory. Oxford University Press, Oxford
Schöbel A (2001) A model for the delay management problem based on mixed-integer-programming. Electron Notes Theor Comput Sci 50(1): 1–10
Schöbel A (2006) Optimization in public transportation. Springer, Berlin
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Krumke, S.O., Thielen, C. & Zeck, C. Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization. Math Meth Oper Res 74, 53–75 (2011). https://doi.org/10.1007/s00186-011-0349-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-011-0349-2