Identifying effective guaranteed connections in a multimodal public transport network

Abstract

Minimizing transfer waiting time is important in making public transport networks more attractive. A guaranteed transfer, with the departing vehicle waiting on moderately delayed arriving vehicles at a transfer node, is an effective way to reduce waiting times at transfers between low frequency public transport lines. This comes at the cost of a new delay for some non-transferring passengers. The method described in this paper, based on max-plus algebra, classifies potential connections based on their feasibility for given initial delays, in order to help operational decisions on-line and to assist public transport companies off-line in identifying transfers vulnerable to delays. A case study shows the applicability of the approach for a real-life multimodal network.