Abstract
The evaluation of potential benefits of new information systems to road users and of demand management measures, like limited traffic zones and road pricing, in congested areas, requires representing time of the day dynamic of traffic flows on the road network and users’ behaviour. This can be accomplished by taking into account several aspects such as users’ information level and travel demand distribution over time, with the objective to get a forecast of the expected smoothing effects of adopted measures and information systems. Modelling approaches presented to perform this assessment are briefly reviewed in this paper, with the aim of improving traffic congestion representation in a˙ dynamic framework. In particular, queuing phenomena are studied and explicitly introduced in a simple link performance model embedded in a dynamic assignment procedure. Moreover, properties of the proposed model are investigated, the computation algorithm is defined and some preliminary results of its application to small size test networks are presented and discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Addison J.D., Heydecker B.G., “A Mathematical Model For Dynamic Traffic Assignment Transportation and Traffic Theory”, C. F. Daganzo ed. 171–183 Elsevier 1993.
Bellei G., Bielli M., “Dynamic Assignment for Trip Planning Systems Assessment”Atti del Convegno Nazionale ANIPLA L’Automazione neiSistemi di Trasporto 1990.
Bellei G., Bielli M., “Sensitivity Analysis of a Dynamic Equilibrium Model for Route and Arrival Time Choice”presented at the 2nd CapriSeminar on Urban Traffic Networks 1992.
Ben-Akiva M., Cyna M., De Palma A., “Dynamic Model of Peakperiod Traffic Congestion”Transp. Res.18B 339–355 1984.
Bernstein D., Friesz T.L., Tobin R. L., Wie B. W., “A Variational Control Formulation of the Simultaneous Route and Departure-Time Choice Equilibrium Problem”Transportation and Traffic TheoryC. F. Daganzo ed. 107–126 Elsevier 1993.
Boyce D.E., Ran B., LeBlanc L.J., “Solving Dynamic User Optimal Traffic Assignment Model”Urban Transportation Center AdvanceWorking Papers Series N.ll (submitted to Transpn. Sci.) 1992.
Carey M., “A Constraint Qualif˙icanon for a Dynamic Traffic Assignment Model”Traltsplt. Sci.20 55–58 1986.
Carey M., “Optimal Time-varying Flows on Congested Networks”Oper. Res.35 pp.58–69 1987
Carey M., “Non convexity of the Dynamic Traffic Assignment Problem”Transpn. Res.26B 127–133 1992
Cascetta E., Cantarella G.E., “A Day-to-Day and Within-Day Dynamic Stochastic Assignment Model”, Transpn. Res. 25A.277–291 1991.
Daganzo C. F., “Stochastic Network Equilibrium with Multiple Vehicle Types and Asymmetric, Indefinite Links Cost Jacobians”Transpn. Sci.17 282–300 1983.
Di Gangi M., “Continous Flow Approach in Dynamic Network Loading”presented at the 2nd Capri Seminar on Urban Traffic Networks 1992.
Drissi-Kaïtouni O.Hameda-Benchekroun A., “A Dynamic Traffic Assignment Model and a Solution Algorithm”Transpn. Sci.26 119–128 1992.
Ford L.R., Fulkerson D.R., “Flows in Networks”,Princeton University Press.Princeton N. J. 1962.
Friesz T.L., Luque F.J., Tobin R.L., Wie B.W. “Dynamic User Optimal Traffic Assignment Model Based on Optimal Control Approach”Op. Res.37 pp.893–901 1989.
Hamerslag R., “Dynamic Assignment in Three-Dimensional Time Space”Transpn Res. Rec.1220 28–32 1988.
Ho J.K., “A Successive Linear Optimization Approach to the Dynamic Traffic Assignment Problem”Transpn. Sci.14 pp.295–305 1980.
Ho J.K., “Solving the Dynamic Traffic Assignment Problem on a Hypercube Multicomputer”Transp. Res.24B pp.443–451 1990.
Janson B.N., “Dynamic Traffic Assignment for Urban Road Networks”Transpn. Res.25B pp.143–161 1991.
Mahmassani H.S., Chang G.L., “Experiments with Departure Time Choice Dynamics of Urban Commuters”Transpn. Res 20B pp.297 -320 1986.
Mahmassani H.S., Chang G.L., “Travel Time Prediction and Departure Time Adjustment Behaviour Dynamics in a Congested Traffic System”Transpn. Res 22B pp.217–232 1988.
Merchant D.K., Nemhauser G.L., “A Model and Algorithm for the Dynamic Traffic Assignment Problem”Transpn. Sci.12 183–199 1978a.
Merchant D.K., Nemhauser G.L., “Optimality Conditions for a Dynamic Traffic Assignment Model”Transp. Sci.12 200–207 1978b.
Papageorgiou M., “Dynamic Modelling, Assignment and Route Guidance in Traffic Networks”Transp. Res.24B pp.471–495 1990.
Ran B., Shimazaki T., “A General Model and Algorithm for the Dynamic Traffic Assignment Problem”Proceedings of the 5th World Conference on Transportation Resarch- Yokohama, Japan 1989.
Ran B., Boyce D.E., LeBlanc L.J., “Dynamic User-Optimal Departure Time and Route Choice Model: A Bilevel, Optimal Control Formulation”submitted to Ann. of Op. Res., special issue onAdvances in Equilibrium Modelling, Analysis and Computation 1992a.
Ran B., Boyce D.E., LeBlanc L.J., “Dynamic User-Optimal Route Choice Models Based on Stochastic Route Travel Times”presented atthe 2nd Capri Seminar on Urban Traffic Networks 1992b.
Smith M.J., “A New Dynamic Traffic Model and the Existence and Calculation of Dynamic User Equilibria on Congested Capacityconstrained Road Networks”Transp. Res.27B pp 49–64 1993.
Vythoulkas P.K., “A Dynamic Stochastic Assignmenl Model for the Analysis of General Networks”Transp. Res.24B pp.453–469 1990.
Wie B.W., Friesz T.L., Tobin R.L., “Dynamic User Optimal Traffic Assignment on Congested MuItidestination Networks”Transp. Res.24B pp.431–442 1990.
YagarS.“Emulation of Dynamic Equilibrium in Traffic Networks”Traffic Equilibrium Methods240–264 (Florian M. Editor) Springer- Verlag 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin. Heidelberg
About this paper
Cite this paper
Bellei, G., Bielli, M. (1996). Dynamic Traffic Assignment in Congested Networks. In: Bianco, L., Toth, P. (eds) Advanced Methods in Transportation Analysis. Transportation Analysis. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85256-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-85256-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85258-9
Online ISBN: 978-3-642-85256-5
eBook Packages: Springer Book Archive