Reliable routing in stochastic time-dependent network with the use of actual and forecast information of the traffic flows

Abstract

This paper addresses the reliable routing problem in stochastic time-dependent networks using actual and forecast information of the traffic flow parameters. We consider the following optimality criterion: maximization the probability of arriving on time at a destination given a departure time and a time budget. The proposed model is compared with an existing algorithm. Conducted experiments show that the proposed method with a slight increase in computational complexity increases the probability of on-time arriving in a stochastic time-dependent network. The proposed algorithm was implemented and tested using the large transport network of Samara, Russia.

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 — 3 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.