Template-Type: ReDIF-Paper 1.0
Author-Name: Dollevoet, T.A.B.
Author-Name-Last: Dollevoet
Author-Name-First: Twan
Author-Name: Huisman, D.
Author-Name-Last: Huisman
Author-Name-First: Dennis
Author-Person: phu27
Author-Name: Schmidt, M.E.
Author-Name-Last: Schmidt
Author-Name-First: Marie
Author-Name: Schöbel, A.
Author-Name-Last: Schöbel
Author-Name-First: Anita
Title: Delay Management with Re-Routing of Passengers
Abstract: 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.
Creation-Date: 2010-05-11
File-URL: https://repub.eur.nl/pub/19445/EI2010-31.pdf
File-Format: application/pdf
Series: RePEc:ems:eureir
Number: EI 2010-31
Keywords: OD-pairs, delay management, public transportation, re-routing
Handle: RePEc:ems:eureir:19445