IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-10629-8_6.html
   My bibliography  Save this book chapter

Pedestrian Route Choice by Iterated Equilibrium Search

In: Traffic and Granular Flow '13

Author

Listed:
  • Tobias Kretz

    (PTV Group)

  • Karsten Lehmann

    (PTV Group)

  • Ingmar Hofsäß

    (PTV Group)

Abstract

In vehicular traffic planning it is a long standing problem how to assign demand such on the available model of a road network that an equilibrium with regard to travel time or generalized costs is realized. For pedestrian traffic this question can be asked as well. However, as the infrastructure of pedestrian dynamics is not a network (a graph), but two-dimensional, there is in principle an infinitely large set of routes. As a consequence none of the iterating assignment methods developed for road traffic can be applied for pedestrians. In this contribution a method to overcome this problem is briefly summarized and applied with an example geometry which as a result is enhanced with routes with intermediate destination areas of certain shape. The enhanced geometry is used in some exemplary assignment calculations.

Suggested Citation

  • Tobias Kretz & Karsten Lehmann & Ingmar Hofsäß, 2015. "Pedestrian Route Choice by Iterated Equilibrium Search," Springer Books, in: Mohcine Chraibi & Maik Boltes & Andreas Schadschneider & Armin Seyfried (ed.), Traffic and Granular Flow '13, edition 127, pages 47-54, Springer.
  • Handle: RePEc:spr:sprchp:978-3-319-10629-8_6
    DOI: 10.1007/978-3-319-10629-8_6
    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-319-10629-8_6. 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.