An Overview of Vehicle Routing Problems

By Paolo Toth, Daniele Vigo. The Vehicle Routing Problem, 2002

388 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.

An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints (2007, methodology): “State-of-the-art exact approaches for the CVRP have solved instances with up to 135 customers, but within a reasonable computing time (i.e., some hours on a common PC) they can generally solve instances with up to 100 customers (see, e.g., Toth and Vigo (2002b), and Fukasawa et al. (2004)).”
Energy Minimizing Vehicle Routing Problem (2007, background): “It is therefore necessary to develop efficient solution procedures for the EMVRP like heuristics proposed for CVRP (Gendreau, et al. [7], Toth and Vigo [18]).”
A comprehensive taxonomy for multi-robot task allocation (2013, background): “Solving a VRP involves determining a set of routes, each performed by a single vehicle that starts and ends at its own depot, such that all customer requirements are met, all operational constraints are satisfied, and the global transportation cost is minimized.”
Large Neighborhood Search (2018, methodology): “We recommend [55] for further information about the CVRP and vehicle routing problems in general.”
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows (2006, background): “The problem is NP-hard as it for example contains the vehicle routing problem with time windows (VRPTW) [ 26 ] as a special case.”