Abstract
We consider a static traffic assignment problem in a bidimensional network, viewed as a continuum of orthotropic roads. The commuters are spilled over a dense urban area, and try to reach a possible destination. There are a finite number of destinations, which are represented by a small area. The traffic flows from the city area to a determined destination are considered as one commodity. The network supply is defined by the side constraints, or road capacities. The travel demand is variable. The traffic assignment problem is built as a mathematical program inspired from the Beckmann objective function. It is solved by a Lagrangian scheme and a dual method.
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
References
M. Beckmann: A continuous model of transportation, Econometrica 20, 643 (1952)
John Glen Wardrop: Some theorical aspects of road traffic research, Proceedings of the Institute of Civil Engineers, Part II, Vol.1, 325–378 (1952)
Tönu Puu: Continuous economic space modelling, The Annals of Regional Science 43(1), 5–25 (2009)
Rodney James Vaughan: Urban spatial traffic patterns (Pion, London), 1987
Hai Yang, Sam Yagar and Yasunori Iida: Traffic assignment in congested discrete/continuous transportation system, Transportation Research B 28, 161–174 (1994)
S.C. Wong: Multi-commodity traffic assignement by continuum approximation of network flow with variable demand, Transportation Research B 32, 567–581 (1998)
Torbjörn Larsson and Michael Patriksson: An augmented lagrangean dual algorithm for link capacity side constrained traffic assignment problems, Transportation Research B 29, 433–455 (1995)
Azuma Taguchi and Masao Iri: Continuum approximation to dense networks and its application to the analysis of urban road networks, Mathematical Programming Study 20, 178–217 (1982)
Grégoire Allaire: Analyse numérique et optimisation. Une introduction à la modélisation mathématique et à la simulation numérique, Éditions de l’École Polytechnique (2005)
Jean Charles Gilbert: Éléments d’optimisation différentiable - Théorie et algorithmes, Syllabus de cours à l’ENSTA, Paris (2010)
Bertrand Maury: Continuous version of the Uzawa algorithm Comptes Rendus Mathématique 337, 31–36 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saumtally, T., Lebacque, JP., Haj-Salem, H. (2013). A Uzawa Algorithm for Static Traffic Assignment in an Orthotropic Network. In: Kozlov, V., Buslaev, A., Bugaev, A., Yashina, M., Schadschneider, A., Schreckenberg, M. (eds) Traffic and Granular Flow '11. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39669-4_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-39669-4_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39668-7
Online ISBN: 978-3-642-39669-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)