IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-39669-4_35.html
   My bibliography  Save this book chapter

A Uzawa Algorithm for Static Traffic Assignment in an Orthotropic Network

In: Traffic and Granular Flow '11

Author

Listed:
  • 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)

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.

Suggested Citation

  • Tibye Saumtally & Jean-Patrick Lebacque & Habib Haj-Salem, 2013. "A Uzawa Algorithm for Static Traffic Assignment in an Orthotropic Network," Springer Books, in: Valery V. Kozlov & Alexander P. Buslaev & Alexander S. Bugaev & Marina V. Yashina & Andreas Schadsch (ed.), Traffic and Granular Flow '11, edition 127, pages 361-378, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-39669-4_35
    DOI: 10.1007/978-3-642-39669-4_35
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-39669-4_35. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.