IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-58405-3_77.html
   My bibliography  Save this book chapter

Time-Dependent Shortest Path with Travel Time Equivalents of Inconveniences

In: Operations Research Proceedings 2023

Author

Listed:
  • Marc Gennat

    (Hochschule Niederrhein University of Applied Sciences)

  • Lukas Spengler

    (Hochschule Niederrhein University of Applied Sciences)

Abstract

To assess the quality of mobility systems, inconveniences associated with using different modes of transport can be quantified by incorporating travel time equivalents into the actual travel time. This combined value is referred to as travel resistance. Examples of these inconveniences include changing between trains, waiting times, walking distances to stations, and searching for parking spaces when using motorized private transport. This contribution adapts widely recognized shortest path algorithms, such as the Dijkstra or the A* search algorithm to determine the path with the least travel resistance for various modes of transportation.

Suggested Citation

  • Marc Gennat & Lukas Spengler, 2025. "Time-Dependent Shortest Path with Travel Time Equivalents of Inconveniences," Lecture Notes in Operations Research, in: Guido Voigt & Malte Fliedner & Knut Haase & Wolfgang Brüggemann & Kai Hoberg & Joern Meissner (ed.), Operations Research Proceedings 2023, chapter 0, pages 601-607, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-58405-3_77
    DOI: 10.1007/978-3-031-58405-3_77
    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:lnopch:978-3-031-58405-3_77. 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.