CVRP instances

Published: 16 June 2018| Version 1 | DOI: 10.17632/kcc52cw4zs.1
, Juan-Jose Salazar-Gonzalez


Here are the 240 instances for the "Capacitated Vehicle Routing Problem" used in the article "The Capacitated Vehicle Routing Problem: Stronger Bounds in Pseudo-Polynomial Time", written by Adam Letchord and Juan-Jose Salazar-Gonzalez, and published in "European Journal of Operational Research" 2018. Each instance has 15 customers and 1 depot, and is in a text file following the TSPLIB95 format for CVRP instances. There are instances with asymmetric (A) and with symmetric (S) distances, with unit demands (U) and with general demands (G). The U instances have vehicle capacity in {4,6,8} and the G instances have vehicle capacity in {100,150,200}.



Lancaster University Management School, Universidad de La Laguna - Campus Anchieta


Combinatorial Optimization, Vehicle Routing Problem, Integer Programming