In this paper a new formulation of within-day dynamic traffic assignment is presented, where a dynamic user equilibrium is expressed as a fixed-point problem in terms of arc flow temporal profiles. Specifically, it is shown that, by extending to the dynamic case the concept of network loading map, one need not introduce the continuous network loading problem in order to ensure the temporal consistency of the supply model. On this basis it is possible to devise efficient assignment algorithms, based on piece-wise linear or piece-wise constant approximation of temporal profiles over predefined time intervals covering the period of analysis, whose complexity is equal to the one resulting in the static case multiplied by the number of time intervals. With specific reference to a Logit path choice model, an implicit path enumeration network loading procedure is obtained as an extension of Dial's algorithm; then, the fixed-point problem is solved through the Bather's method. (C) 2004 Elsevier Ltd. All rights reserved.

A within-day dynamic traffic assignment model for urban road networks / Bellei, Giuseppe; Gentile, Guido; Papola, Natale. - In: TRANSPORTATION RESEARCH PART B-METHODOLOGICAL. - ISSN 0191-2615. - 39:1(2005), pp. 1-29. [10.1016/j.trb.2004.02.002]

A within-day dynamic traffic assignment model for urban road networks

BELLEI, Giuseppe;GENTILE, Guido;PAPOLA, Natale
2005

Abstract

In this paper a new formulation of within-day dynamic traffic assignment is presented, where a dynamic user equilibrium is expressed as a fixed-point problem in terms of arc flow temporal profiles. Specifically, it is shown that, by extending to the dynamic case the concept of network loading map, one need not introduce the continuous network loading problem in order to ensure the temporal consistency of the supply model. On this basis it is possible to devise efficient assignment algorithms, based on piece-wise linear or piece-wise constant approximation of temporal profiles over predefined time intervals covering the period of analysis, whose complexity is equal to the one resulting in the static case multiplied by the number of time intervals. With specific reference to a Logit path choice model, an implicit path enumeration network loading procedure is obtained as an extension of Dial's algorithm; then, the fixed-point problem is solved through the Bather's method. (C) 2004 Elsevier Ltd. All rights reserved.
2005
dial's algorithm; dial’s algorithm; dynamic traffic assignment; dynamic user equilibrium; fixed point problem; implicit path enumeration; implicit path formulation; network loading map; temporal profiles
01 Pubblicazione su rivista::01a Articolo in rivista
A within-day dynamic traffic assignment model for urban road networks / Bellei, Giuseppe; Gentile, Guido; Papola, Natale. - In: TRANSPORTATION RESEARCH PART B-METHODOLOGICAL. - ISSN 0191-2615. - 39:1(2005), pp. 1-29. [10.1016/j.trb.2004.02.002]
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

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/233751
 Attenzione

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

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