We consider the problem of individual route guidance in an Intelligent Vehicle-Highway Systems (IVHS ) environment, based on time-dependent forecasts of link travel time. We propose a consistency condition which deterministic forecasts should be constrained to satisfy, and show that under consistency, the time-dependent fastest path can be calculated with exactly the same computational complexity as for static fastest paths, regardless of the time index set. In particular, consistency reduces computational complexity by O(T) in a T-period discrete time problem. We also comment on the stochastic fastest path problem, suggesting modifications to a general-case algorithm from the literature.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION


    Beteiligte:


    Erscheinungsdatum :

    01.01.1993


    Format / Umfang :

    11 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch






    Bitwise Algorithm for Fastest Paths in Time-Dependent Networks

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


    Bitwise Algorithm for Fastest Paths in Time-Dependent Networks

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


    Automated Identification of Fastest Vehicle Paths at Roundabouts

    Rubio-Martín, Juan Luis / Jurado-Piña, Rafael / Pardillo-Mayora, José María | ASCE | 2019