The problem of coordinating transfers consists of determining timetables which ensure the transfer of passengers between trains from different line runs at interchange stations. Two strategies can be considered: (1) Forcing the line runs to be synchronized; that is, a solution can be accepted only if there exists a connection between them, while the goal is minimizing travel times for passengers by using the minimum number of vehicles needed. (2) Minimizing an objective function that penalizes the lack of synchronization between line runs. The problem of transfer coordination turns out to be NP-hard even in the simple case of periodic timetables. Therefore, the problem is usually treated sequentially in two stages: first, determine the frequency of service according to the rate of demand, and then solve the problem of coordination by means of heuristics. This chapter considers a transit line where a train fleet circulates and stops at the stations according to a predetermined timetable which is known by the users. At any instant, passengers arrive at different stations in order to board these vehicles according to an assumed deterministic model of arrivals. In this scenario, a service rescheduling forced by an incidence is determined in order to minimize the loss of passengers who require transfers between different lines at the interchange stations. A case study consisting of a railway line with several equi-spaced stations, where it is possible a connection to other lines at intermediate stations is analyzed for different scenarios where the loss of transfers is penalized.
Rescheduling Railway Timetables in Presence of Passenger Transfers Between Lines Within a Transportation Network
Advs in Intelligent Syst., Computing
21.02.2014
14 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Balance of efficiency and robustness in passenger railway timetables
Online Contents | 2017
|A review of passenger-oriented railway rescheduling approaches
Springer Verlag | 2023
|