The solution is computed, improved, and displayed by methods previously presented for the VRP problem. One thing to note is that the program pdp.cpp, as written, can also be used to resolve a problem where some or all of the parcels are initially in the depot.

The solution improvement phase finds a solution using 9 vehicles with a cost of 1078.88 units:

1291.75
Improving solution
Number of fails               : 0
Number of choice points       : 0
Number of variables           : 2329
Number of constraints         : 410
Reversible stack (bytes)      : 197004
Solver heap (bytes)           : 1009300
Solver global heap (bytes)    : 144384
And stack (bytes)             : 20124
Or stack (bytes)              : 44244
Search Stack (bytes)          : 4044
Constraint queue (bytes)      : 11160
Total memory used (bytes)     : 1430260
Elapsed time since creation   : 0.02
Number of nodes               : 51
Number of visits              : 80
Number of vehicles            : 15
Number of dimensions          : 3
Number of accepted moves      : 23
===============
Cost         : 1078.88
Number of vehicles used : 9