Fetching the paper…
Reading the bibliography…
Neighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics.
Distance between sets
Levandowsky, M., D. Winter. 1971 · 1971
Earlier work this paper cites.
An effective heuristic algorithm for the traveling-salesman problem
Lin, S., B.W. Kernighan. 1973 · 1973
Earlier work this paper cites.
Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking
Or, I. 1976 · 1976
Earlier work this paper cites.
k-Interchange procedures for local search in a precedence-constrained routing problem
Psaraftis, H.N. 1983 · 1983
Earlier work this paper cites.
An efficient implementation of local search algorithms for constrained routing problems
Savelsbergh, M.W.P. 1990 · 1990
Earlier work this paper cites.
A genetic algorithm for job shop
Falkenauer, E., S. Bouffoix. 1991 · 1991
Earlier work this paper cites.
TSPLIB — A traveling salesman problem library
Reinelt, G. 1991 · 1991
Earlier work this paper cites.
Fast algorithms for geometric traveling salesman problems
Bentley, J.J. 1992 · 1992
Earlier work this paper cites.
Polyhedral solution to the pickup and delivery problem
Ruland, K.S. 1994 · 1994
Earlier work this paper cites.
A new extension of local search applied to the dial-a-ride Problem
Healy, P., R. Moll. 1995 · 1995
Earlier work this paper cites.
Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
Glover, F. 1996 · 1996
Earlier work this paper cites.
The traveling salesman problem: A case study in local optimization
Johnson, D., L. Mcgeoch. 1997 · 1997
Earlier work this paper cites.
The pickup and delivery problem: Faces and branch-and-cut algorithm
Ruland, K.S., E.Y. Rodin. 1997 · 1997
Earlier work this paper cites.
A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem
Deineko, V.G., G.J. Woeginger. 2000 · 2000
Earlier work this paper cites.
An effective implementation of the Lin-Kernighan traveling salesman heuristic
Helsgaun, K. 2000 · 2000
Earlier work this paper cites.
A heuristic for the pickup and delivery traveling salesman problem
Renaud, J., F.F. Boctor, J. Ouenniche. 2000 · 2000
Earlier work this paper cites.
Provably high-quality solutions for the meal delivery routing problem
Yildiz, B., M. Savelsbergh. 2019 · 2000
Earlier work this paper cites.
Linear time dynamic-programming algorithms for new classes of restricted TSPs: A computational study
Balas, E., N. Simonetti. 2001 · 2001
Earlier work this paper cites.
A survey of very large-scale neighborhood search techniques
Ahuja, R.K., Ö. Ergun, J.B. Orlin, A.P. Punnen. 2002 · 2002
Earlier work this paper cites.
An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
Congram, R.K., C.N. Potts, S.L. van de Velde. 2002 · 2002
Earlier work this paper cites.
Perturbation heuristics for the pickup and delivery traveling salesman problem
Renaud, J., F.F. Boctor, G. Laporte. 2002 · 2002
Cited alongside, same era.
The granular tabu search and its application to the vehicle-routing problem
Toth, P., D. Vigo. 2003 · 2003
Cited alongside, same era.
The Traveling Salesman Problem: A Computational Study
Applegate, D.L., R.E. Bixby, V. Chvátal, W.J. Cook. 2006 · 2006
Cited alongside, same era.
A new ILP-based refinement heuristic for vehicle routing problems
De Franceschi, R., M. Fischetti, P. Toth. 2006 · 2006
Cited alongside, same era.
Ejection chain and filter-and-fan methods in combinatorial optimization
Glover, F., C. Rego. 2006 · 2006
Cited alongside, same era.
An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
Ropke, S., D. Pisinger. 2006 · 2006
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
Later among the works it cites.
New benchmark instances for the capacitated vehicle routing problem
Uchoa, E., D. Pecin, A. Pessoa, M. Poggi, A. Subramanian, T. Vidal. 2017 · 2017
Later among the works it cites.
The pickup and delivery traveling salesman problem with handling costs
Veenstra, M., K.J. Roodbergen, I.F.A. Vis, L.C. Coelho. 2017 · 2017
Later among the works it cites.
Node, edge, arc routing and turn penalties: Multiple problems – One neighborhood extension
Vidal, T. 2017 · 2017
Later among the works it cites.
A study on exponential-size neighborhoods for the bin packing problem with conflicts
Capua, R., Y. Frota, L.S. Ochi, T. Vidal. 2018 · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
Carrabs, F., J.-F. Cordeau, G. Laporte. 2007 · 2007
Cited alongside, same era.
Solution of real-world postman problems
Irnich, S. 2008 · 2008
Cited alongside, same era.
Certification of an optimal TSP tour through 85,900 cities
Applegate, D.L., R.E. Bixby, V. Chvatal, W.J. Cook, D. Espinoza, M. Goycoolea, K. Helsgaun. 2009 · 2009
Cited alongside, same era.
The pickup and delivery traveling salesman problem with first-in-first-out loading
Erdogan, G., J.-F. Cordeau, G. Laporte. 2009 · 2009
Cited alongside, same era.
General k-opt submoves for the Lin-Kernighan TSP heuristic
Helsgaun, K. 2009 · 2009
Cited alongside, same era.
The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
Dumitrescu, I., S. Ropke, J.-F. Cordeau, G. Laporte. 2010 · 2010
Cited alongside, same era.
Hintsch, T., S. Irnich. 2018 · 2018
Later among the works it cites.
Exact method for solving single-vehicle pickup and delivery problems in real Time
O’Neil, R.J. 2018 · 2018
Later among the works it cites.
Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem
Gschwind, T., M. Drexl. 2019 · 2019
Later among the works it cites.
Variable Neighborhood Search
Hansen, P., N. Mladenović, J. Brimberg, J.A.M. Pérez. 2019 · 2019
Later among the works it cites.
Algorithmic Strategies for a Fast Exploration of the TSP 4-OPT Neighborhood
Lancia, G., M. Dalpasso. 2019 · 2019
Later among the works it cites.
Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
O’Neil, Ryan J., Karla Hoffman. 2019 · 2019
Later among the works it cites.
Large Neighborhood Search
Pisinger, D., S. Ropke. 2019 · 2019
Later among the works it cites.
POPMUSIC for the travelling salesman problem
Taillard, Éric D., Keld Helsgaun. 2019 · 2019
Later among the works it cites.
Heuristics for vehicle routing problems: Sequence or set optimization?
Toffolo, T.A.M., T. Vidal, T. Wauters. 2019 · 2019
Later among the works it cites.
Slack induction by string removals for vehicle routing problems
Christiaens, J., G. Vanden Berghe. 2020 · 2020
Later among the works it cites.
Fine-grained complexity analysis of two classic TSP variants
De Berg, M., K. Buchin, B.M.P. Jansen, G. Woeginger. 2020 · 2020
Later among the works it cites.
A concise guide to existing and emerging vehicle routing problem variants
Vidal, T., G. Laporte, P. Matl. 2020 · 2020
Later among the works it cites.
PILS: Exploring high-order neighborhoods by pattern mining and injection
Arnold, F., Í.G. Santana, K. Sörensen, T. Vidal. 2021 · 2021
Closest in time.
Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art
Karimi-Mamaghan, M., M. Mohammadi, P. Meyer, A.M. Karimi-Mamaghan, E.-G. Talbi. 2022 · 2022
Closest in time.
Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood
Vidal, T. 2022 · 2022
Closest in time.