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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Time-Dependent Shortest Path with Travel Time Equivalents of Inconveniences


    Additional title:

    Lecture Notes in Operations res.


    Contributors:

    Conference:

    International Conference on Operations Research ; 2023 ; Hamburg, Germany August 29, 2023 - September 01, 2023



    Publication date :

    2025-07-23


    Size :

    7 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English





    Shortest Paths in Stochastic Time-Dependent Networks with Link Travel Time Correlation

    Dong, Wei / Vu, Hai L. / Nazarathy, Yoni et al. | Transportation Research Record | 2013



    Time-Dependent, Label-Constrained Shortest Path Problems with Applications

    Sherali, H. D. / Hobeika, A. G. / Kangwalklai, S. | British Library Online Contents | 2003


    Reversibility of the time-dependent shortest path problem

    Daganzo, Carlos F. | Online Contents | 2002