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

Бесплатный доступ

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.

Reliable shortest path, adaptive routing, time-dependent network, stochastic network

Короткий адрес: https://sciup.org/14059463

IDR: 14059463   |   DOI: 10.18287/2412-6179-2016-40-2-275-283

Статья научная