The problem of computing minimum-time paths from all nodes to one destination node, for all possible departure times, in continuous-time dynamic networks with piecewise linear link travel-time functions is considered. Two types of algorithms to solve this problem are presented: a continuous-time label-correcting algorithm and an algorithm that determines optimal minimum travel-time functions in decreasing order of departure times. The algorithms are valid in networks in which “first in, first out” holds and does not necessarily hold. Computer implementations of these algorithms were developed and are available. It is demonstrated that the algorithms have modest computational time and memory requirements. The decreasing order of time algorithm generally requires less running time than the label-correcting algorithm, which is comparatively easier to implement.


    Zugriff

    Download

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Computing Fastest Paths in Continuous-Time Dynamic Networks with Piecewise Linear Link Travel-Time Functions


    Weitere Titelangaben:

    Transportation Research Record: Journal of the Transportation Research Board


    Beteiligte:


    Erscheinungsdatum :

    01.01.2001




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Computing Fastest Paths in Continuous-Time Dynamic Networks with Piecewise Linear Link Travel-Time Functions

    Chabini, I. / National Research Council | British Library Conference Proceedings | 2001



    Bitwise Algorithm for Fastest Paths in Time-Dependent Networks

    Chabini, I. / Yadappanavar, V. / National Research Council | British Library Conference Proceedings | 2001


    Bitwise Algorithm for Fastest Paths in Time-Dependent Networks

    Chabini, Ismail / Yadappanavar, Vinay | Transportation Research Record | 2001