This paper provides a framework for solving the Time Dependent Vehicle Routing Problem (TDVRP) by using historical data. The data are used to predict travel times during certain times of the day and derive zones of congestion that can be used by optimization algorithms. A combination of well-known algorithms was adapted to the time dependent setting and used to solve the real-world problems. The adapted algorithm outperforms the best-known results for TDVRP benchmarks. The proposed framework was applied to a real-world problem and results show a reduction in time delays in serving customers compared to the time independent case.


    Access

    Download


    Export, share and cite



    Title :

    Using Congestion Zones for Solving the Time Dependent Vehicle Routing Problem


    Contributors:
    Tonči Carić (author) / Juraj Fosin (author)


    Publication date :

    2020




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown





    Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion

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



    Time-Dependent Green Vehicle Routing Problem

    Masghati-Amoli, Golnush / Haghani, Ali | Springer Verlag | 2020


    Distance-dependent congestion pricing for downtown zones

    Daganzo, Carlos F | Online Contents | 2015