Vehicle routing with time-dependent travel times: : Theory, practice, and benchmarks
Authors: 
Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens VygenAuthors Info & Claims
Jannis Blauth, Stephan Held, Dirk Müller, Niklas Schlomberg, Vera Traub, Thorben Tröbst, Jens VygenAuthors Info & ClaimsReferences
[1]
Ichoua S., Gendreau M., Potvin J.-Y., Vehicle dispatching with time-dependent travel times, European J. Oper. Res. 144 (2) (2003) 379–396.
[2]
Imai H., Iri M., An optimal algorithm for approximating a piecewise linear function, Inform. Process. Lett. 9 (3) (1986) 159–162.
[3]
Batz G.V., Geisberger R., Sanders P., Vetter C., Minimum time-dependent travel times with contraction hierarchies, ACM J. Exp. Algorithmics 18 (2013) Article 1.4.
[4]
Visser T.R., Spliet R., Efficient move evaluations for time-dependent vehicle routing problems, Transp. Sci. 54 (4) (2020) 1091–1112.
[5]
Hashimoto H., Yagiura M., Ibaraki T., An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, Discrete Optim. 5 (2) (2008) 434–456.
[6]
Geisberger R., Sanders P., Engineering time-dependent many-to-many shortest paths computation, in: 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS’10, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2010, pp. 74–87.
[7]
Foisy C., Potvin J.-Y., Implementing an insertion heuristic for vehicle routing on parallel hardware, Comput. Oper. Res. 20 (7) (1993) 737–745.
[8]
Blauth J., Traub V., Vygen J., Improving the approximation ratio for capacitated vehicle routing, Math. Program. 197 (2023) 451–497.
[9]
Friggstad Z., Mousavi R., Rahgoshay M., Salavatipour M.R., Improved approximations for CVRP with unsplittable demands, in: International Conference on Integer Programming and Combinatorial Optimization, IPCO, Springer, 2022.
[10]
N. Bansal, A. Blum, S. Chawla, A. Meyerson, Approximation Algorithms for Deadline-TSP and Vehicle Routing with Time-Windows, in: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, ISBN: 1581138520, 2004, pp. 166–174.
[11]
Chekuri C., Korula N., Pál M., Improved algorithms for orienteering and related problems, ACM Trans. Algorithms 8 (3) (2012) 1–27.
[12]
Nagarajan V., Ravi R., The directed orienteering problem, Algorithmica 60 (4) (2011) 1017–1030.
[13]
A.A. Pessoa, R. Sadykov, E. Uchoa, F. Vanderbeck, A Generic Exact Solver for Vehicle Routing and Related Problems, in: International Conference on Integer Programming and Combinatorial Optimization, IPCO, 2019, pp. 354–369.
[14]
Vidal T., Crainic T.G., Gendreau M., Prins C., A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows, Comput. Oper. Res. 40 (2013) 475–489.
[15]
Arnold F., Sörensen K., Knowledge-guided local search for the vehicle routing problem, Comput. Oper. Res. 105 (2019) 32–46.
[16]
Accorsi L., Vigo D., A fast and scalable heuristic for the solution of large-scale capacitated vehicle routing problems, Transp. Sci. 55 (4) (2021) 832–856.
[17]
Queiroga E., Sadykov R., Uchoa E., A POPMUSIC matheuristic for the capacitated vehicle routing problem, Comput. Oper. Res. 136 (2021).
[18]
Vidal T., Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood, Comput. Oper. Res. 140 (2022).
[19]
Toth P., Vigo D. (Eds.), Vehicle Routing: Problems, Methods, Applications, in: second ed., MOS-SIAM, 2014.
[20]
Malandraki C., Daskin M.S., Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms, Transp. Sci. 26 (1992) 161–260.
[21]
Donati A.V., Montemanni R., Casagrande N., Rizzoli A.E., Gambardella L.M., Time dependent vehicle routing problem with a multi ant colony system, European J. Oper. Res. 185 (3) (2008) 1174–1191.
[22]
Figliozzi M.A., The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics, Transp. Res. E Logist. Transp. Rev. 48 (3) (2012) 616–636.
[23]
Dabia S., Røpke S., Van Woensel T., De Kok T., Branch and price for the time-dependent vehicle routing problem with time windows, Transp. Sci. 47 (3) (2013) 380–396.
[24]
Pan B., Zhang Z., Lim A., A hybrid algorithm for time-dependent vehicle routing problem with time windows, Comput. Oper. Res. 128 (2021).
[25]
Pan B., Zhang Z., Lim A., Multi-trip time-dependent vehicle routing problem with time windows, European J. Oper. Res. 291 (1) (2021) 218–231.
[26]
Mancini S., Time dependent travel speed vehicle routing and scheduling on a real road network: the case of Torino, Transp. Res. Procedia 3 (2014) 433–441.
[27]
Huang Y., Zhao L., Van Woensel T., Gross J.-P., Time-dependent vehicle routing problem with path flexibility, Transp. Res. B 95 (2017) 169–195.
[28]
Ticha H.B., Vehicle Routing Problems with Road-Network information, (Ph.D. thesis) Université Clermont Auvergne, 2017.
[29]
Ticha H.B., Absi N., Feillet D., Quilliot A., Van Woensel T., A branch-and-price algorithm for the vehicle routing problem with time windows on a road network, Networks 73 (4) (2019) 401–417.
[30]
Gmira M., Gendreau M., Lodi A., Potvin J.-Y., Tabu search for the time-dependent vehicle routing problem with time windows on a road network, European J. Oper. Res. 288 (1) (2021) 129–140.
[31]
Gendreau M., Ghiani G., Guerriero E., Time-dependent routing problems: A review, Comput. Oper. Res. 64 (2015) 189–197.
[32]
Strasser B., Wagner D., Zeitz T., Space-efficient, fast and exact routing in time-dependent road networks, Algorithms 14 (3) (2021) 90.
[33]
A. Wiernik, Planar realizations of nonlinear Davenport–Schinzel sequences by segments, in: 27th Annual Symposium on Foundations of Computer Science, FOCS, 1986, pp. 97–106.
[34]
Hart S., Sharir M., Nonlinearity of Davenport–Schinzel sequences and of generalized path compression schemes, Combinatorica 6 (2) (1986) 151–177.
[35]
Fleischmann B., Gietz M., Gnutzmann S., Time-varying travel times in vehicle routing, Transp. Sci. 38 (2) (2004) 160–173.
[36]
Arigliano A., Ghiani G., Grieco A., Guerriero E., Plana I., Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm, Discrete Appl. Math. 261 (2019) 28–39.
[37]
Adamo T., Ghiani G., Guerriero E., An enhanced lower bound for the time-dependent travelling salesman problem, Comput. Oper. Res. 113 (2020).
[38]
Montero A., Méndez-Díaz I., Miranda-Bront J.J., An integer programming approach for the time-dependent traveling salesman problem with time windows, Comput. Oper. Res. 88 (2017) 280–289.
[39]
Lera-Romero G., Miranda-Bront J.J., Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints, Electron. Notes Discrete Math. 69 (2018) 53–60.
[40]
Hansknecht C., Joormann I., Stiller S., Dynamic shortest paths methods for the time-dependent TSP, Algorithms 14 (1) (2021).
[41]
Vu D.M., Hewitt M., Boland N., Savelsbergh M., Solving time dependent traveling salesman problems with time windows, Optimization Online 6640 (2018).
[42]
Malandraki C., Dial R.B., A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, European J. Oper. Res. 90 (1) (1996) 45–55.
[43]
Lera-Romero G., Miranda-Bront J.J., Soulignac F.J., Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows, Optimization Online, 2020.
[44]
Tilk C., Irnich S., Dynamic programming for the minimum tour duration problem, Transp. Sci. 51 (2) (2017) 549–565.
[45]
Uchoa E., Pecin D., Pessoa A., Poggi M., Vidal T., Subramanian A., New benchmark instances for the capacitated vehicle routing problem, European J. Oper. Res. 257 (3) (2017) 845–858.
[46]
Arnold F., Gendreau M., Sörensen K., Efficiently solving very large-scale routing problems, Comput. Oper. Res. 107 (2019) 32–42.
[47]
Solomon M.M., Algorithms for the vehicle routing and scheduling problems with time window constraints, Oper. Res. 35 (1987) 254–265.
[48]
Gehring H., Homberger J., A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows, in: Proceedings of EUROGEN 99, University of Jyvaäskyla, 1999, pp. 57–64.
[49]
Ticha H.B., Absi N., Feillet D., Quilliot A., Van Woensel T., The time-dependent vehicle routing problem with time windows and road-network information, Oper. Res. Forum 2 (2021).
[50]
Ticha H.B., Absi N., Feillet D., Quilliot A., Empirical analysis for the VRPTW with a multigraph representation for the road network, Comput. Oper. Res. 88 (2017) 103–116.
[51]
Foschini L., Hershberger J., Suri S., On the complexity of time-dependent shortest paths, Algorithmica 68 (4) (2014) 1075–1097.
[52]
Agarwal P.K., Sharir M., Davenport–Schinzel sequences and their geometric applications, in: Handbook of Computational Geometry, Elsevier, 2000, pp. 1–47.
[53]
Lin S., Kernighan B.W., An effective heuristic algorithm for the traveling-salesman problem, Oper. Res. 21 (2) (1973) 498–516.
[54]
Helsgaun K., An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems, Roskilde University, 2017.
[55]
Glover F., Ejection chains, reference structures and alternating path methods for traveling salesman problems, Discrete Appl. Math. 65 (1) (1996) 223–253.
[56]
Rego C., Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms, Parallel Comput. 27 (3) (2001) 201–222.
[57]
Sontrop H., van der Horn P., Uetz M., Fast ejection chain algorithms for vehicle routing with time windows, in: Hybrid Metaheuristics, 2005, pp. 78–89.
[58]
Soto M., Sevaux M., Rossi A., Reinholz A., Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem, Comput. Ind. Eng. 107 (2017) 211–222.
[59]
Applegate D., Cook W., Rohe A., Chained Lin-Kernighan for large traveling salesman problems, INFORMS J. Comput. 15 (1) (2003) 82–92.
[60]
Curtois T., Landa-Silva D., Qu Y., Laesanklang W., Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows, EURO J. Transp. Logist. 7 (2018) 151–192.
[61]
Sartori C.S., Buriol L.S., A matheuristic approach to the pickup and delivery problem with time windows, in: Computational Logistics, 2018, pp. 253–267.
[62]
Li H., Lim A., A metaheuristic for the pickup and delivery problem with time windows, Int. J. Artif. Intell. Tools 12 (02) (2003) 173–186.
[63]
Lera-Romero G., Bront J.J.M., Soulignac F.J., An Enhanced Branch and Price Algorithm for the Time-Dependent Vehicle Routing Problem with Time Window, Optimization Online, 2018.
[64]
Lera-Romero G., Miranda Bront J.J., Soulignac F.J., Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows, Networks 76 (1) (2020) 24–53.
Index Terms
- Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks
Index terms have been assigned to the content through auto-classification.
Recommendations
Time-Varying Travel Times in Vehicle Routing
Models and algorithms for vehicle routing are usually based on known constant travel times between all relevant locations, an assumption that is far from reality, particularly for urban areas. But the consideration of travel times that vary with the ...
Variable neighborhood search for the time-dependent vehicle routing problem with soft time windows
LION'05: Proceedings of the 5th international conference on Learning and Intelligent OptimizationIn this paper we present a variable neighborhood search for time-dependent vehicle routing problems with time windows. Unlike the well-studied routing problems with constant travel times, in the time-dependent case the travel time depends on the time of ...
Arc Routing with Time-Dependent Travel Times and Paths
Vehicle routing algorithms usually reformulate the road network into a complete graph in which each arc represents the shortest path between two locations. Studies on time-dependent routing followed this model and therefore defined the speed functions on ...
Comments
Information & Contributors
Information
Published In
The Author(s).
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Published: 01 August 2024
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 18 Feb 2025