Route choice model and algorithm for dynamic assignment in overcrowded bus networks with real-time information at stops

The paper presents a route choice model and algorithm for dynamic assignment in congested, i.e. overcrowded, transit networks where it is assumed that passengers are supported with real-time information on carrier arrivals at stops. If the stop layout is such that passenger congestion results in First-In-First-Out (FIFO) queues, a new formulation is devised for calculating waiting times, total travel times and route splits. Numerical results for a simple example network show the effect of congestion and information on route choice, both in terms of total travel time to the destination and route split. Moreover, it is shown that while the provision of information does not lead to a remarkable decrease in total travel time, with the exception of some particular instances, it changes the travel behaviour of passengers that seem to be more averse to queuing at later stages of their journey and, thus, prefer to interchange at less congested stations. This result suggests that information can help to achieve a more equilibrate use of the network