摘要：AbstractThis 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 considerscommon linesand strategies with alternative routes. As such, theshortest hyperpath problemis extended to a dynamic scenario with capacity constraints where the diversion probabilities depend on the time 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, theBottleneck Queuemodel 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 everyattractive set, while allowing overtaking among passengers having different attractive sets but queuing single file.
关键词：dynamic transit assignment;dynamic shortest hyperpaths;FIFO queues for attractive sets;Erlang pdf
