USING CONGESTION ZONES FOR SOLVING THE TIME DEPENDENT VEHICLE ROUTING PROBLEM

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.