Work

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

Year: 2016

Type: article

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.

Source: Computer Optics

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

Authors: A. Agafonov, V. Myasnikov

Language: English

Topic: Transportation Planning and Optimization

Subfield: Transportation

Field: Social Sciences

Domain: Social Sciences

SDGs: Sustainable cities and communities, Industry, innovation and infrastructure

Open Access status: diamond

OpenAlex ID: W2511448261

FWCI: 9.337

Cites:

Cited by: 27

Related to: 10