Classical and modern heuristics for the vehicle routing problem
By Gilbert Laporte, Michel Gendreau, Jean-Yves Potvin, Frédéric Semet. 2000
827 citations recorded by the source corpus.
Subfields: Building and Construction, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/2ac4cc7baf80c6d5cdec2614bae9a2f7e53d8b08
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Building and Construction
- Roberto Baldacci
- Aristide Mingozzi
- Christian Prins
- Lawrence V. Snyder
- Michael Schneider
- Michael Drexl
- Xinyun Chen
- Medhat A. Moussa
In Industrial and Manufacturing Engineering
- Roberto Baldacci
- Aristide Mingozzi
- Christian Prins
- Martin Takác
- Caroline Prodhon
- Lawrence V. Snyder
- Gilbert Laporte
- Michael Schneider
Citations in the corpus
- Location-routing: Issues, models and methods (2007, neutral): “Keywords: combinatorial optimisation, heuristics, location, logistics, routing”
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (2006, methodology): “A capacity Wi and an opening cost Oi are associated with each depot site i ∈ I.”
- Reinforcement Learning for Solving the Vehicle Routing Problem (2018, background): “[24], or the book by Toth and Vigo [33] for different variants of the problem.”
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation (2004, background): “In particular, Laporte et al. (2000) report a computational comparison of some of the most important families of heuristics.”