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 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 having different attractive sets but queuing single file.

Dynamic User Equilibrium in public transport networks with passenger congestion and hyperpaths / Valentina, Trozzi; Gentile, Guido; Michael G. H., Bell; Ioannis, Kaparias. - In: PROCEDIA: SOCIAL & BEHAVIORAL SCIENCES. - ISSN 1877-0428. - 80:(2013), pp. 427-454. (Intervento presentato al convegno 20th International Symposium on Transportation and Traffic Theory (ISTTT) tenutosi a Noordwijk, NETHERLAND) [10.1016/j.sbspro.2013.05.024].

Dynamic User Equilibrium in public transport networks with passenger congestion and hyperpaths

GENTILE, Guido;
2013

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 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 having different attractive sets but queuing single file.
2013
20th International Symposium on Transportation and Traffic Theory (ISTTT)
dynamic shortest hyperpaths; fifo queues for attractive sets; dynamic transit assignment; erlang pdf
04 Pubblicazione in atti di convegno::04c Atto di convegno in rivista
Dynamic User Equilibrium in public transport networks with passenger congestion and hyperpaths / Valentina, Trozzi; Gentile, Guido; Michael G. H., Bell; Ioannis, Kaparias. - In: PROCEDIA: SOCIAL & BEHAVIORAL SCIENCES. - ISSN 1877-0428. - 80:(2013), pp. 427-454. (Intervento presentato al convegno 20th International Symposium on Transportation and Traffic Theory (ISTTT) tenutosi a Noordwijk, NETHERLAND) [10.1016/j.sbspro.2013.05.024].
File allegati a questo prodotto
File Dimensione Formato  
Trozzi_Dynamic-user-equilibrium_2013.pdf

accesso aperto

Note: contributo
Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 961.43 kB
Formato Adobe PDF
961.43 kB Adobe PDF

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/523625
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 8
social impact