City Research Online

Abstract

This paper presents a dynamic user equilibrium for bus networks where recurrent overcrowding results in queues at stops. The route-choice model embedded in the dynamic assignment explicitly considers common lines and strategies with alternative routes. As such, the shortest hyperpath problem is extended to a dynamic scenario with capacity constraints where the diversion probabilities depend on the time at which the stop is reached and on the expected congestion level at that time. In order to reproduce congestion for all the lines sharing a stop, the Bottleneck Queue Model with time-varying exit capacity, introduced in Meschini et al. (2007), is extended. The above is applied to separate queues for each line in order to satisfy the First-In-First-Out principle within every attractive set, while allowing overtaking among passengers with different attractive sets but queuing single file. The application of the proposed model to a small example network clearly reproduces the formation and dispersion of passenger queues due to capacity constraints and thus motivates the implementation of the methodology on a real-size network case as the next step for future research.

Publication Type:	Article
Additional Information:	© 2015, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/
Publisher Keywords:	Dynamic transit assignment; Dynamic shortest hyperpaths; FIFO queues for attractive sets; Erlang pdf
Subjects:	H Social Sciences > HE Transportation and Communications
Departments:	School of Science & Technology > Engineering
SWORD Depositor:	Symplectic Administrator

Export

Downloads