In this paper, online stochastic routing policies are developed to identify the optimal next action (path choice) at the current decision node (intersection) for travelers on the basis of their preference for future paths with the shortest travel time, the lowest travel time variability, or a combination, given the network conditions. A modified label-correcting algorithm is provided to solve for the shortest path that results from the proposed routing policies. Its running time is bounded by O(mn2), where m and n are the number of arcs and nodes, respectively, in the network. Since real-time traffic information is usually available with a certain level of accuracy, the proposed online routing policy integrates an existing information fusion model, which provides real-time short-term arc travel time distributions by considering information accuracy. Numerical experiments are used to demonstrate the performance of the proposed routing policies and algorithms, as well as the impacts of real-time information accuracy on the online stochastic routing.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Online Stochastic Routing Incorporating Real-Time Traffic Information


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:
    Du, Lili (author) / Peeta, Srinivas (author) / Kim, Yong Hoon (author)


    Publication date :

    2013-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Optimal vehicle routing with real-time traffic information

    Seongmoon Kim, / Lewis, M.E. / White, C.C. | IEEE | 2005



    Automated Traffic Signal System Incorporating Real-Time Traffic

    Saseendran, Athulya / Worin, Jerin / Jyothika, K. J. et al. | Springer Verlag | 2024


    Near real-time traffic routing

    Yang, Chaowei / Cao, Ying / Xie, Jibo et al. | NTRS | 2012