FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION
FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION
- New search for: Kaufman, David E.
- New search for: Smith, Robert L.
- New search for: Kaufman, David E.
- New search for: Smith, Robert L.
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.
Document information
FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION
Journal of Intelligent Transportation Systems ; 1 , 1 ; 1-11
1993-01-01
11 pages
Article (Journal)
Electronic Resource
English
Similar titles
FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR IVHS APPLICATION
Taylor & Francis Verlag | 1993
Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
| Online Contents | 2001
Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
| British Library Conference Proceedings | 2001
Bitwise Algorithm for Fastest Paths in Time-Dependent Networks
| Transportation Research Record | 2001