Travel times in congested urban transportation networks are time varying and represented by random variables. Travel times on next route that can at best be known a priori probabilistically depend on the vehicle revealed arrival time at intermediate nodes. Stochastic path travel times over a time are given for both a priori optimization and time-adaptive choices. Model considering on-line messages about the traffic jam only when which occurs are then got one by one is presented and an algorithm to solve the model is constructed.
Research on Dynamic Stochastic Shortest Path Problem
International Conference of Logistics Engineering and Management (ICLEM) 2010 ; 2010 ; Chengdu, China
ICLEM 2010 ; 3686-3692
2010-09-09
Conference paper
Electronic Resource
English
Time-Constrained Shortest-Path Problem in Stochastic Dynamic Networks
British Library Conference Proceedings | 2005
|The Variance-Constrained Shortest Path Problem
Online Contents | 1994
|An efficient dynamic model for solving the shortest path problem
Online Contents | 2013
|