Open Access
RAIRO-Oper. Res.
Volume 55, Number 4, July-August 2021
Page(s) 2203 - 2222
Published online 29 July 2021
  • B. Afshar-Nadjafi and A. Afshar-Nadjafi, A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet. J. King Saud Univ.-Eng. Sci. 29 (2017) 29–34. [Google Scholar]
  • E. Avraham and T. Raviv, The data-driven time-dependent traveling salesperson problem. Transp. Res. Part B: Methodol. 134 (2020) 25–40. [CrossRef] [Google Scholar]
  • H.B. Ban, An efficient two-phase metaheuristic algorithm for The Time Dependent Traveling Salesman Problem. RAIRO:OR 53 (2019) 917–935. [CrossRef] [Google Scholar]
  • J.E. Beasley, Adapting the savings algorithm for varying inter-customer travel times. Omega 9 (1981) 658–659. [CrossRef] [Google Scholar]
  • A.V. Donati, R. Montemanni, N. Casagrande, A.E. Rizzoli and L.M. Gambardella, Time dependent vehicle routing problem with a multi ant colony system. Eur. J Oper. Res. 185 (2008) 1174–1191. [CrossRef] [Google Scholar]
  • M.A. Figliozzi, The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics. Transp. Res. Part E: Logistics Transp. Rev. 48 (2012) 616–636. [CrossRef] [Google Scholar]
  • M. Gmira, M. Gendreau, A. Lodi and J.Y. Potvin, Tabu search for the time-dependent vehicle routing problem with time windows on a road network. Eur. J. Oper. Res. 288 (2021) 129–140. [CrossRef] [Google Scholar]
  • Y. Huang, L. Zhao, T. Van Woensel and J.P. Gross, Time-dependent vehicle routing problem with path flexibility. Transp. Res. Part B: Methodol. 95 (2017) 169–195. [CrossRef] [Google Scholar]
  • A. Karoonsoontawong, P. Punyim, W. Nueangnitnaraporn and V. Ratanavaraha, Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints. Networks Spatial Econ. (2020) 1–50. [Google Scholar]
  • M. Keskin, G. Laporte and B. Çatay, Electric vehicle routing problem with time-dependent waiting times at recharging stations. Comput. Oper. Res. 107 (2019) 77–94. [CrossRef] [Google Scholar]
  • A.L. Kok, E.W. Hans and J.M. Schutten, Vehicle routing under time-dependent travel times: the impact of congestion avoidance. Comput. Oper. Res. 39 (2012) 910–918. [CrossRef] [Google Scholar]
  • S. Kritzinger, K.F. Doerner, R.F. Hartl, G.Ÿ. Kiechle, H. Stadler and S.S. Manohar, Using traffic information for time-dependent vehicle routing. Proc.-Soc. Behav. Sci. 39 (2012) 217–229. [CrossRef] [Google Scholar]
  • D.S. Lai, O.C. Demirag and J.M. Leung, A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph. Transp. Res. Part E: Logistics Transp. Rev. 86 (2016) 32–52. [CrossRef] [Google Scholar]
  • G. Lera-Romero, J.J. Miranda Bront and F.J. Soulignac, Linear edge costs and labeling algorithms: the case of the time-dependent vehicle routing problem with time windows. Networks 76 (2020) 24–53. [CrossRef] [Google Scholar]
  • C. Liu, G. Kou, X. Zhou, Y. Peng, H. Sheng and F.E. Alsaadi, Time-dependent vehicle routing problem with time windows of city logistics with a congestion avoidance approach. Knowl.-Based Syst. 188 (2020) 104813. [CrossRef] [Google Scholar]
  • S. Mancini, A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times. Comput. Oper. Res. 88 (2017) 290–296. [CrossRef] [Google Scholar]
  • M. Mourgaya and F. Vanderbeck, The periodic vehicle routing problem: classification and heuristic. RAIRO:OR 40 (2006) 169–194. [CrossRef] [Google Scholar]
  • P.K. Nguyen, T.G. Crainic and M. Toulouse, A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows. Eur. J. Oper. Res. 231 (2013) 43–56. [CrossRef] [Google Scholar]
  • M. Okude and E. Taniguchi, Hierarchical traffic network for heuristic approximation method of vehicle routing problems. Proc.-Soc. Behav. Sci. 125 (2014) 262–274. [CrossRef] [Google Scholar]
  • J. Respen, N. Zufferey and J.Y. Potvin, Impact of vehicle tracking on a routing problem with dynamic travel times. RAIRO:OR 53 (2019) 401–414. [CrossRef] [Google Scholar]
  • N.R. Sabar, A. Bhaskar, E. Chung, A. Turky and A. Song, A self-adaptive evolutionary algorithm for dynamic vehicle routing problems with traffic congestion. Swarm Evol. Comput. 44 (2019) 1018–1027. [CrossRef] [Google Scholar]
  • M. Setak, M. Habibi, H. Karimi and M. Abedzadeh, A time-dependent vehicle routing problem in multigraph with FIFO property. J. Manuf. Syst. 35 (2015) 37–45. [CrossRef] [Google Scholar]
  • H. Seyyedhasani and J.S. Dvorak, Using the Vehicle Routing Problem to reduce field completion times with multiple machines. Comput. Electron. Agric. 134 (2017) 142–150. [CrossRef] [Google Scholar]
  • M. Soysal and M. Çimen, A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem. Comput. Oper. Res. 88 (2017) 297–305. [Google Scholar]
  • R. Spliet, S. Dabia and T. Van Woensel, The time window assignment vehicle routing problem with time-dependent travel times. Transp. Sci. 52 (2018) 261–276. [CrossRef] [Google Scholar]
  • J. Sun and H.X. Liu, Stochastic eco-routing in a signalized traffic network. Transp. Res. Part C: Emerging Technol. 59 (2015) 32–47. [CrossRef] [Google Scholar]
  • Y. Sun, D. Wang, M. Lang and X. Zhou, Solving the time-dependent multi-trip vehicle routing problem with time windows and an improved travel speed model by a hybrid solution algorithm. Cluster Comput. 22 (2019) 15459–15470. [CrossRef] [Google Scholar]
  • C. Verbeeck, P. Vansteenwegen and E.H. Aghezzaf, Solving the stochastic time-dependent orienteering problem with time windows. Eur. J. Oper. Res. 255 (2016) 699–718. [CrossRef] [Google Scholar]
  • J.F. Victoria, H.M. Afsar and Ch Prins, Column generation-based heuristic for the vehicle routing problem with time-dependent demand. IFAC Conf. Manuf. Modell. Manage. Control 49 (2016) 526–531. [Google Scholar]
  • Z. Xu, A. Elomri, S. Pokharel and F. Mutlu, A model for capacitated green vehicle routing problem with the time-varying vehicle speed and soft time windows. Comput. Ind. Eng. 137 (2019) 106011. [CrossRef] [Google Scholar]
  • R. Zhang, J. Guo and J. Wang, A Time-dependent electric vehicle routing problem with congestion tolls. IEEE Trans. Eng. Manage. (2020). [Google Scholar]
  • J. Zheng, A vehicle routing problem model with multiple fuzzy windows based on time-varying traffic flow. IEEE Access 8 (2020) 39439–39444. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.