Research on Dynamic Stochastic Shortest Path Problem

Abstract

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.