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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Research on Dynamic Stochastic Shortest Path Problem


    Contributors:
    Pan, Fanlu (author) / Zhang, Yang (author)

    Conference:

    International Conference of Logistics Engineering and Management (ICLEM) 2010 ; 2010 ; Chengdu, China


    Published in:

    ICLEM 2010 ; 3686-3692


    Publication date :

    2010-09-09




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Time-Constrained Shortest-Path Problem in Stochastic Dynamic Networks

    National Research Council (U.S.) | British Library Conference Proceedings | 2005


    The Variance-Constrained Shortest Path Problem

    Sivakumar, Raj A. | Online Contents | 1994



    Solving partially observable stochastic shortest-path games

    Tomášek, Petr / Horák, Karel / Aradhye, Aditya et al. | BASE | 2021

    Free access