Fetching the paper…
Reading the bibliography…
The vehicle routing problem is one of the most studied combinatorial optimization topics, due to its practical importance and methodological interest.
Route first-cluster second methods for vehicle routing
Beasley, J.E. 1983 · 1983
Earlier work this paper cites.
A study of permutation crossover operators on the traveling salesman problem
Oliver, I., D. Smith, J.R. Holland. 1987 · 1987
Earlier work this paper cites.
A simple and effective evolutionary algorithm for the vehicle routing problem
Prins, C. 2004 · 2002
Earlier work this paper cites.
TTT plots: A Perl program to create time-to-target plots
Aiex, R.M., M.G.C. Resende, C.C. Ribeiro. 2007 · 2007
Earlier work this paper cites.
Metaheuristics: From Design to Implementation
Talbi, El Ghazali. 2009 · 2009
Earlier work this paper cites.
A modern introduction to memetic algorithms
Moscato, P., C. Cotta. 2010 · 2010
Earlier work this paper cites.
The case for strategic oscillation
Glover, F., J.-K. Hao. 2011 · 2011
Earlier work this paper cites.
A hybrid genetic algorithm for multidepot and periodic vehicle routing problems
Vidal, T., T.G. Crainic, M. Gendreau, N. Lahrichi, W. Rei. 2012 · 2012
Earlier work this paper cites.
A hybrid algorithm for a class of vehicle routing problems
Subramanian, A., E. Uchoa, L.S. Ochi. 2013 · 2013
Earlier work this paper cites.
Heuristics for the vehicle routing problem
Laporte, G., S. Ropke, T. Vidal. 2014 · 2014
Cited alongside, same era.
Vehicle Routing: Problems, Methods, and Applications
Toth, P., D. Vigo, eds. 2014 · 2014
Cited alongside, same era.
A unified solution framework for multi-attribute vehicle routing problems
Vidal, T., T.G. Crainic, M. Gendreau, C. Prins. 2014 · 2014
Cited alongside, same era.
Time-window relaxations in vehicle routing heuristics
Vidal, T., T.G. Crainic, M. Gendreau, C. Prins. 2015 · 2015
Cited alongside, same era.
Good laboratory practice for optimization research
Kendall, G., R. Bai, J. Błazewicz, P. De Causmaecker, M. Gendreau, R. John, J. Li, B. McCollum, E. Pesch, R. Qu, N. Sabar, G. Vanden Berghe, A. Yee. 2016 · 2016
Cited alongside, same era.
Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem
Vidal, T. 2016 · 2016
Node, edge, arc routing and turn penalties: Multiple problems – One neighborhood extension
Vidal, T. 2017 · 2017
Later among the works it cites.
What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
Arnold, F., K. Sörensen. 2018 · 2018
Later among the works it cites.
Slack induction by string removals for vehicle routing problems
Christiaens, J., G. Vanden Berghe. 2020 · 2020
Closest in time.
A ruin & recreate ant colony system algorithm for the capacitated vehicle routing problem. Working Paper. CIRRELT
Guillen, F.O., M. Gendreau, J.-Y. Potvin, T. Vidal. 2020 · 2020
Closest in time.
A concise guide to existing and emerging vehicle routing problem variants
Vidal, T., G. Laporte, P. Matl. 2020 · 2020
Closest in time.
A fast and scalable heuristic for the solution of large-scale capacitated vehicle routing problems
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Large neighborhoods with implicit customer selection for vehicle routing problems with profits
Vidal, T., N. Maculan, L.S. Ochi, P.H.V. Penna. 2016 · 2016
Cited alongside, same era.
An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems
Helsgaun, K. 2017 · 2017
Cited alongside, same era.
New benchmark instances for the capacitated vehicle routing problem
Uchoa, E., D. Pecin, A. Pessoa, M. Poggi, A. Subramanian, T. Vidal. 2017 · 2017
Cited alongside, same era.
Accorsi, L., D. Vigo. 2021 · 2021
Closest in time.
Fine-grained complexity analysis of two classic TSP variants
De Berg, M., K. Buchin, B.M.P. Jansen, G. Woeginger. 2021 · 2021
Closest in time.
Arc routing with time-dependent travel times and paths
Vidal, T., R. Martinelli, T.A. Pham, M.H. Hà. 2021 · 2021
Closest in time.
A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem
Zachariadis, E.E., C.T. Kiranoudis. 2010 · 2089
Closest in time.