CVRP instances

Published: 16 Jun 2018 | Version 1 | DOI: 10.17632/kcc52cw4zs.1

Description of this data

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

Experiment data files

Related links

This data is associated with the following publication:

The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time

Published in: European Journal of Operational Research

Latest version

  • Version 1


    Published: 2018-06-16

    DOI: 10.17632/kcc52cw4zs.1

    Cite this dataset

    Letchford, Adam; Salazar-Gonzalez, Juan-Jose (2018), “CVRP instances”, Mendeley Data, v1


Views: 3606
Downloads: 2327


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


Combinatorial Optimization, Vehicle Routing Problem, Integer Programming


CC BY 4.0 Learn more

The files associated with this dataset are licensed under a Creative Commons Attribution 4.0 International licence.

What does this mean?
You can share, copy and modify this dataset so long as you give appropriate credit, provide a link to the CC BY license, and indicate if changes were made, but you may not do so in a way that suggests the rights holder has endorsed you or your use of the dataset. Note that further permission may be required for any content within the dataset that is identified as belonging to a third party.