A dynamic route choice model for public transport networks with boarding queues

Document Type

Journal Article

Publication Date


Subject Area

ridership - behaviour, operations - capacity, operations - crowding


transit networks, dynamic hyperpaths, passenger congestion, FIFO queues, Erlang distribution


The concepts of optimal strategy and hyperpath were born within the framework of static frequency-based public transport assignment, where it is assumed that travel times and frequencies do not change over time and no overcrowding occurs. However, the formation of queues at public transport stops can prevent passengers from boarding the first vehicle approaching and can thus lead to additional delays in their trip. Assuming that passengers know from previous experience that for certain stops/lines they will have to wait for the arrival of the 2nd, 3rd, …, k-th vehicle, they may alter their route choices, thus resulting in a different assignment of flows across the network. The aim of this paper is to investigate route choice behaviour changes as a result of the formation and dispersion of queues at stops within the framework of optimal travel strategies. A new model is developed, based on modifications of existing algorithms.


Permission to publish the abstract has been given by Taylor&Francis, copyright remains with them.