Problem variant

Acronym	CVRP
Title	Capacitated Vehicle Routing Problem
Criterion	MIN
Description	The Capacitated Vehicle Routing Problem (CVRP) is a vehicle routing problem in which a fleet of identical vehicles of finite capacity and located at a central depot must service a set of customers with known demands. The objective is to determine a set of vehicle trips of minimum total cost (sum of travel distance or time), such that each vehicle starts and ends at the depot, each client is visited exactly once, and the total demand handled by any vehicle does not exceed its capacity.

Datasets

Augerat 1995 - Set A Augerat 1995 - Set B Christofides et al. 1979 - CMT Christofides et al. 1979 - Set M Golden et al. 1998 — Set 1 Li et al. 2005 Augerat 1995 - Set P Christofides and Eilon 1969 - Set E Fisher 1994 - Set F Geoffrey De Smet 2014 - Belgium CVRP VeRoLog Members VRP VeRoLog Members VRP 2016 Uchoa et al. 2014 De Smet 2017 - Belgium road-km/road-time/air - 50-2750 visits Letchford and Salazar-Gonzalez 2018

References

Christofides and Eilon 1969 | An algorithm for the vehicle routing dispatching problem Christofides et al. 1979 | The vehicle routing problem Cordeau et al. 2001 | A unified tabu search for vehicle routing problems with time windows De Smet 2014-2020 | Multithreaded incremental solving for local search based metaheuristics with step chasing Fisher 1994 | Optimal solution of vehicle routing problems using minimum K-trees Golden et al. 1998 | Metaheuristics in Vehicle Routing Letchford and Salazar-Gonzalez 2018 | The Capacitated Vehicle Routing Problem: Stronger Bounds in Pseudo-Polynomial Time Li et al. 2005 | Very large-scale vehicle routing: New test problems, algorithms and results Lysgaard et al. 2004 | A new branch-and-cut algorithm for the capacitated vehicle routing problem Mester and Bräysy 2007 | Active-guided evolution strategies for large-scale capacitated vehicle routing problems Nagata and Bräysy 2009 | Edge assembly-based memetic algorithm for the capacitated vehicle routing problem Pisinger and Røpke 2007 | A general heuristic for vehicle routing problems Prins 2004 | A simple and effective evolutionary algorithm for the vehicle routing problem Prins 2009 | A GRASP × Evolutionary local search hybrid for the vehicle routing problem Ralphs et al. 2003 | On the capacitated vehicle routing problem Reimann et al. 2004 | D-ants: savings based ants divide and conquer the vehicle routing problem Rochat and Taillard 1995 | Probabilistic diversification and intensification in local search for vehicle routing Thomopulos and Vigo 2015 | VeRoLog Members VRP Uchoa et al. 2017 | New Benchmark Instances for the Capacitated Vehicle Routing Problem Vidal et al. 2012 | A hybrid genetic algorithm for multidepot and periodic vehicle routing problems