A Uzawa Algorithm for Static Traffic Assignment in an Orthotropic Network

Tibye Saumtally (), Jean-Patrick Lebacque () and Habib Haj-Salem ()
Additional contact information
Tibye Saumtally: Université Paris Est, GRETTIA, Le Descartes 2
Jean-Patrick Lebacque: IFSTTAR, GRETTIA, Le Descartes 2
Habib Haj-Salem: IFSTTAR, GRETTIA, Le Descartes 2

A chapter in Traffic and Granular Flow '11, 2013, pp 361-378 from Springer

Abstract: 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.

Keywords: Saddle Point; Traffic Flow; Demand Function; Travel Cost; User Equilibrium (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-39669-4_35

Ordering information: This item can be ordered from
http://www.springer.com/9783642396694

DOI: 10.1007/978-3-642-39669-4_35

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().