Abstract
The problem of individual route choice in an Intelligent Vehicle Highway Systems environment, based on time-dependent forecasts of link travel time is considered. A consistency condition is proposed in 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. The stochastic fastest path problem is also considered and modifications to a general-case algorithm from the literature are suggested. This paper was discussed by H Koutsopoulos, pp 89-91 and by A Ziliaskopoulos and H Mahmassani, pp 91-93 with the authors' reply on pp 93-94 of this issue.