A schedule‐based time‐dependent trip assignment model for transit networks

Abstract

Abstract A schedule‐based time‐dependent trip assignment model for transit networks is presented. First the transit network model is formulated using the schedule‐based approach, in which the vehicles are assumed to arrive punctually in accordance with a scheduled time‐table. Based on a previously developed time‐dependent shortest path algorithm, an all‐or‐nothing network loading procedure is employed to assign the passenger trips onto the network. Both the passenger demand and scheduled time‐table are time‐varying. This provides a versatile tool for the evaluation of the performance of transit networks subject to peak period loading. A case study using the Mass Transit Railway System in Hong Kong is given to illustrate the potential applications of the model.