Version 3 (modified by abeham, 12 years ago) (diff)

Added info on the number of customers, as well as the extended solomon instances

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:

Attachments (2)

Download all attachments as: .zip