The question of delay management is whether trains should wait for a delayed feeder train or should depart on time. In classical delay management models passengers always take their originally planned route. 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 classical delay management, with some additional events to incorporate origin and destination of the passengers. We present an integer programming formulation of this problem. Furthermore, we discuss the variant in which we assume fixed costs for maintaining connections and we present a polynomial algorithm for the special case of only one origin-destination pair. Finally, computational experiments based on real-world data from Netherlands Railways show that significant improvements can be obtained by taking the re-routing of passengers into account in the model.

Additional Metadata
Keywords OD-pairs, delay management, public transportation, re-routing
Publisher Erasmus School of Economics (ESE)
Persistent URL hdl.handle.net/1765/19445
Citation
Dollevoet, T.A.B, Huisman, D, Schmidt, M, & Schobel, A. (2010). Delay Management with Re-Routing of Passengers (No. EI 2010-31). Report / Econometric Institute, Erasmus University Rotterdam (pp. 1–31). Erasmus School of Economics (ESE). Retrieved from http://hdl.handle.net/1765/19445