Very large-scale vehicle routing: new test problems, algorithms, and results
By Feiyue Li, Bruce L. Golden, Edward A. Wasil. Computers & Operations Research, 2005
298 citations recorded by the source corpus.
Subfields: Automotive Engineering, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/e165314c295194032f66a3a85312f965ddab815d
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
- Gilbert Laporte
- Teodor Gabriel Crainic
- Thibaut Vidal
- Michel Gendreau
- Jean-François Cordeau
- Christian Prins
- Stefan Røpke
- David Pisinger
In Industrial and Manufacturing Engineering
- Gilbert Laporte
- Thibaut Vidal
- Teodor Gabriel Crainic
- Michel Gendreau
- Jean-François Cordeau
- Christian Prins
- Stefan Røpke
- David Pisinger
Citations in the corpus
- Heuristics for multi-attribute vehicle routing problems: A survey and synthesis (2013, methodology): “For the CVRP, efficient deterministic " Record-to-Record " (R-to-R) variants (Dueck 1993, Li et al. 2005) accept any neighbor solution which is not much worse than the incumbent solution, and prevent degradations that are too significant relatively to the best-found solution * , subject to…”
- An artificial bee colony algorithm for the capacitated vehicle routing problem (2011, background): “…Pisinger and Ropke, 2007), variable neighborhood search (Kytöjoki et al., 2007; Chen et al., 2010), deterministic annealing (Golden et al., 1998; Li et al., 2005), honey-bees mating optimization (Marinakis et al., 2010), particle swarm optimization (Ai and Kachitvichyanukul, 2009) and hybrid…”
- New Heuristics for the Vehicle Routing Problem (2005, methodology): “According to this criterion the Li et al. (2004) heuristic is probably the best: it is based on a rather simple mechanism and requires a relatively small amount of coding.”
- A general heuristic for vehicle routing problems (2007, background): “[40] and contains instances with up to 12 00 customers.”
- Industrial aspects and literature survey: Fleet composition and routing (2010, background): “[91] adapted their record-to-record travel algorithm for the VRP [90] to handle the HFFVRP.”
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (2007, unknown): “[31] investigate variants of simulated annealing.”
- New benchmark instances for the Capacitated Vehicle Routing Problem (2017, methodology): “[19](1) Instance n Q MD BKS KBKS 21 560 1200 1800 16212.”