Tonči Carić
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.
Kok AL, Hans EW, Schutten JMJ. Vehicle routing under time-dependent travel times: The impact of congestion avoidance. Computers & Operations Research. 2012;39(5): 910-8.
Gendreau M, Ghiani G, Guerriero E. Time-dependent routing problems: A review. Computers & Operations Research. 2015;64: 189-97.
Dantzig GB, Ramser JH. The truck dispatching problem. Management Science. 1959;6(1): 80-91.
Eksioglu B, Vural AV, Reisman A. The vehicle routing problem: A taxonomic review. Computers & Industrial Engineering. 2009;57(4): 1472-83.
Braekers K, Ramaekers K, van Nieuwenhuyse I. The vehicle routing problem: State of the art classification and review. Computers & Industrial Engineering. 2016;99: 300-13.
Ichoua S, Gendreau M, Potvin J-Y. Vehicle dispatching with time-dependent travel times. European Journal of Operational Research. 2003;144: 379-96.
Fleischmann B, Gietz M, Gnutzmann S. Time-varying travel times in vehicle routing. Transportation Science. 2004;38(2): 160-73.
Hash
Guest Editor: Eleonora Papadimitriou, PhD
Editors: Marko Matulin, PhD, Dario Babić, PhD, Marko Ševrović, PhD
Accelerating Discoveries in Traffic Science |
2024 © Promet - Traffic&Transportation journal