A guide to vehicle routing heuristics

By Jean-François Cordeau, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Frédéric Semet. Journal of the Operational Research Society, 2002

681 citations recorded by the source corpus.

Subfields: Automotive Engineering, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/eeba41bac9e916b034364ed7405a8f8242f5f544

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Automotive Engineering

In Industrial and Manufacturing Engineering

Citations in the corpus

An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (2007, methodology): “, they use the so-called local search principle [20].”
Cooperative Minimum Time Surveillance With Multiple Ground Vehicles (2010, methodology): “Since it has been noted in [9], [49], [50] that Tabu search is an efficient heuristic for a wide range of routing problems, it is reasonable to assume that Tabu search is a good choice for the MTUSP as well and consequently, will be a part of our solution method.”
The multi-depot vehicle routing problem with inter-depot routes (2007, background): “This choice is motivated by the success of TS for the classical VRP and the MDVRP (see, for example, Cordeau et al. [8]).”
Fifty Years of Vehicle Routing (2009, background): “Classical Heuristics The seminal Dantzig and Ramser (1959) paper introduced the VRP to the research community and presented the first heuristic for the problem.”
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms (2005, background): “Examples of such criteria are running time, quality of solution, ease of implementation, robustness and flexibility (Barr et al., 1995; Cordeau et al., 2002).”
New Heuristics for the Vehicle Routing Problem (2005, background): “Two additional performance criteria stated by Cordeau et al. (2002b) are simplicity and flexibility.”
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics (2005, methodology): “The basic concepts were developed by Holland (1975), while the practicality of using the GA to solve complex problems was demonstrated in De Jong (1975) and Goldberg (1989).”
Metaheuristics in Combinatorial Optimization (2005, background): “At the other end of the spectrum, many researchers are now looking for more straightforward metaheuristic implementations with relatively simple neighborhood structures and only a few parameters (Cordeau et al., 2002).”
The multiple traveling salesman problem: an overview of formulations and solution procedures (2006, methodology): “We offer for further research the application of heuristics to the mTSP that are known to be very successful for the solution of VRPs, such as tabu search (see [67]).”
A survey of variants and extensions of the location-routing problem (2015, methodology): “(see Cordeau et al. 2002, Bräysy and Gendreau 2005).”