An efficient variable neighborhood search heuristic for very large scale vehicle routing problems

311 citations recorded by the source corpus.

How researchers see this paper

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

What you should know about the vehicle routing problem (2007, background): “[35] have developed a variable neighbourhood search heuristic capable of solving large scale instances.”
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis (2013, methodology): “Long-term memories for penalizing frequent solution elements can also be viewed as a basis of Guided Local Search (Voudouris and Tsang 1999), applied by Kilby et al. (1999), Tarantilis et al. (2007), Kytöjoki et al. (2007), and Zachariadis and Kiranoudis (2010a) to the CVRP.”
An artificial bee colony algorithm for the capacitated vehicle routing problem (2011, methodology): “After that, each onlooker finds a food source near its selected food source (using a neighborhood operator) and calculates the nectar amount of the neighbor food source.”
Collaborative vehicle routing: A survey (2017, background): “Li et al. (2015) do not allow the carriers to submit more than one request to the auction pool.”