A schedule‐based dynamic transit network model — Recent advances and prospective future research

Abstract Using the schedule‐based approach, in which scheduled timetables are used to describe the movement of vehicles, a dynamic transit assignment model is formulated. Passengers are assumed to travel on a path with minimum generalized cost that consists of four components: in‐vehicle time; waiting time; walking time; and a time penalty for each line change. A specially developed branch and bound algorithm is used to generate the time‐dependent minimum path. The assignment procedure is conducted over a period in which both passenger demand and train headway are varying. This paper presents an overview of the research that has been carried out by the authors to develop the schedule‐based transit assignment model, and offers perspectives for future research.