= Vehicle Routing Problem =
The vehicle routing problem (VRP) is a class of problems that frequently occurs in the field of transportation logistics. The original formulation of the problem
has been defined in the late 1950ies and consists of a fleet of vehicles serving a set of customers with a certain demand from a single depot. The implementation in HeuristicLab covers the capacitated problem formulation with time windows (CVRPTW).

== Benchmark instances == 
The following benchmark instances can be imported:
* TSPLib format
  - http://www.branchandcut.org/VRP/data/ (12-261 customers, includes optimal solution files)
  - http://www.rhsmith.umd.edu/faculty/bgolden/Golden.zip (~200-500 customers)
  - http://www.rhsmith.umd.edu/faculty/bgolden/Christofides_benchmarks.zip (50-200 customers)

* Solomon format
  - http://neo.lcc.uma.es/radi-aeb/WebVRP/data/instances/solomon/solomon_100.zip (100 customers)
  - http://www.fernuni-hagen.de/WINF/touren/inhalte/probinst.htm (200-1000 customers)

* ORLib format
  - http://people.brunel.ac.uk/~mastjjb/jeb/orlib/files/