10.4230/OASICS.ATMOS.2009.2143
Dollevoet, Twan
Twan
Dollevoet
Huisman, Dennis
Dennis
Huisman
Schmidt, Marie
Marie
Schmidt
Schoebel, Anita
Anita
Schoebel
Delay Management with Re-Routing of Passengers
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2009
Transportation
Delay Management
Re-Routing
OD-pairs Transportation
Delay Management
Re-Routing
OD-pairs
Clausen, Jens
Jens
Clausen
Di Stefano, Gabriele
Gabriele
Di Stefano
2009
2009-11-25
2009-11-25
2009-11-25
en
urn:nbn:de:0030-drops-21433
10.4230/OASIcs.ATMOS.2009
978-3-939897-11-8
2190-6807
10.4230/OASIcs.ATMOS.2009
OASIcs, Volume 12, ATMOS 2009
9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)
2012
12
4
1
17
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Clausen, Jens
Jens
Clausen
Di Stefano, Gabriele
Gabriele
Di Stefano
2190-6807
Open Access Series in Informatics (OASIcs)
2009
12
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
17 pages
201022 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
Trains often arrive delayed at stations where passengers have to change to other trains. The question of delay management is whether these trains should wait for the original train or depart on time. In traditional delay management models passengers always take their originally planned route. This means, they are in case of a missed connection always delayed with the cycle time of the timetable. In this paper, we propose a model where re-routing of passengers is incorporated. \\
To describe the problem we represent it as an event-activity network similar to the one used in traditional delay management, with some additional events to incorporate origin and destination of the passengers. We prove NP-hardness of this problem, and we present an integer programming formulation for which we report the first numerical results. Furthermore, we discuss the variant in which we assume fixed costs for maintaining transfers and we present a polynomial algorithm for the special case of only one origin-destination pair.
OASIcs, Vol. 12, 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09), pages 1-17