Free cookie consent management tool by TermsFeed Policy Generator
wiki:Documentation/Reference/VehicleRoutingProblem

Version 6 (modified by svonolfe, 13 years ago) (diff)

--

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). Additionally, in version 3.4 pickup and delivery formulations are also supported (CVRPTW with pickups and deliveries).

Benchmark instances

The following benchmark instances can be imported:

File formats

  • Optimal solution
    Route #1: 22 13 10 6 5 33 4 7
    Route #2: 1 12 2 19 20 23 14 17
    Route #3: 36 29 32 28 31 30 15
    Route #4: 3 24 9 11 27 8 25 35 18 26 34
    Route #5: 21 16
    cost 669
    

Attachments (2)

Download all attachments as: .zip