This paper proposes a dynamic vehicle routing problem (DVRP) model with nonstationary stochastic travel times under traffic congestion. Depending on the traffic conditions, the travel time between two nodes, particularly in a city, may not be proportional to distance and changes both dynamically and stochastically over time. Considering this environment, we propose a Markov decision process model to solve this problem and adopt a rollout-based approach to the solution, using approximate dynamic programming to avoid the curse of dimensionality. We also investigate how to estimate the probability distribution of travel times of arcs which, reflecting reality, are considered to consist of multiple road segments. Experiments are conducted using a real-world problem faced by Singapore logistics/delivery company and authentic road traffic information.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion




    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    55.84 Straßenverkehr / 55.24 / 55.84 / 55.24 Fahrzeugführung, Fahrtechnik



    Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion

    Kim, Gitae / Ong, Yew Soon / Cheong, Taesu et al. | IEEE | 2016



    Using Congestion Zones for Solving the Time Dependent Vehicle Routing Problem

    Tonči Carić / Juraj Fosin | DOAJ | 2020

    Free access


    Solving a Dynamic Real-Life Vehicle Routing Problem

    Goel, Asvin / Gruhn, Volker | BASE | 2006

    Free access