| 1 | | VRP |
| | 1 | = Vehicle Routing Problem = |
| | 2 | 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 |
| | 3 | 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). |
| | 4 | |
| | 5 | == Benchmark instances == |
| | 6 | The following benchmark instances can be imported: |
| | 7 | * TSPLib format |
| | 8 | - http://www.branchandcut.org/VRP/data/ (includes optimal solution files) |
| | 9 | - http://www.rhsmith.umd.edu/faculty/bgolden/Golden.zip |
| | 10 | - http://www.rhsmith.umd.edu/faculty/bgolden/Christofides_benchmarks.zip |
| | 11 | |
| | 12 | * Solomon format |
| | 13 | - http://neo.lcc.uma.es/radi-aeb/WebVRP/data/instances/solomon/solomon_100.zip |
| | 14 | |
| | 15 | * ORLib format |
| | 16 | - http://people.brunel.ac.uk/~mastjjb/jeb/orlib/files/ |
