One of the challenges of traffic assignment models is to properly take into account capacity constraint problems in order to avoid traffic propagation through bottlenecks. This allows better evaluations of travel times between the O/D couples of the study area, adequate computations of the performances of the traffic network and design and/or simulation of traffic schemes oriented to protect city centres from excessive traffic flows. The analysts have made most of the modelling efforts related to capacity-constrained assignment on Dynamic Network Loading procedures or on static, but deterministic, assignment models. In this paper a static, stochastic and behaviourally consistent assignment model is presented, as well as its application to a real-size network.
Dealing with capacity constraints within Stochastic User Equilibrium assignment models / Bifulco, GENNARO NICOLA; Crisalli, U.. - 4:(1998), pp. 237-246. (Intervento presentato al convegno 4th International Conference on Urban Transport and the Environment for the 21st Century tenutosi a LISBON, PORTUGAL nel SEP , 1998) [10.2495/UT980231].
Dealing with capacity constraints within Stochastic User Equilibrium assignment models
BIFULCO, GENNARO NICOLA;
1998
Abstract
One of the challenges of traffic assignment models is to properly take into account capacity constraint problems in order to avoid traffic propagation through bottlenecks. This allows better evaluations of travel times between the O/D couples of the study area, adequate computations of the performances of the traffic network and design and/or simulation of traffic schemes oriented to protect city centres from excessive traffic flows. The analysts have made most of the modelling efforts related to capacity-constrained assignment on Dynamic Network Loading procedures or on static, but deterministic, assignment models. In this paper a static, stochastic and behaviourally consistent assignment model is presented, as well as its application to a real-size network.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.