Method for the reliable shortest path search in time-dependent stochastic networks and its application to GIS-based traffic control

Abstract

A reliable shortest path problem in time-dependent stochastic networks is considered in this paper. We develop and research a method for reliable routing that uses actual and forecast information of traffic flow parameters. We compare the performance of the proposed algorithm with that of a well-known algorithm on a real traffic network in the city of Samara, Russia. On the basis of computing experiments it is shown that while being a bit more computationally challenging, the proposed method increases the possibility of successfully solving the shortest path problem in a time-dependent stochastic network.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 27 citations exist upstream.