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

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.

https://doi.org/10.1080/10248079308903779

Cite as:

@article{Kaufman_1993,
	doi = {10.1080/10248079308903779},
	url = {https://doi.org/10.1080%2F10248079308903779},
	year = 1993,
	month = {jan},
	publisher = {Informa {UK} Limited},
	volume = {1},
	number = {1},
	pages = {1--11},
	author = {David E. Kaufman and Robert L. Smith},
	title = {{FASTEST} {PATHS} {IN} {TIME}-{DEPENDENT} {NETWORKS} {FOR} {INTELLIGENT} {VEHICLE}-{HIGHWAY} {SYSTEMS} {APPLICATION}$ast$},
	journal = {I V H S Journal}
}