The solution is computed, improved, and displayed by methods previously presented for the PDP problem.

The solution improvement phase finds a solution using 5 vehicles with a cost of 1441.04 units:

/**
1619.09
Improving solution
Number of fails               : 0
Number of choice points       : 0
Number of variables           : 619
Number of constraints         : 232
Reversible stack (bytes)      : 76404
Solver heap (bytes)           : 402280
Solver global heap (bytes)    : 481592
And stack (bytes)             : 20124
Or stack (bytes)              : 44244
Search Stack (bytes)          : 4044
Constraint queue (bytes)      : 11160
Total memory used (bytes)     : 1039848
Elapsed time since creation   : 0
Number of nodes               : 21
Number of visits              : 30
Number of vehicles            : 5
Number of dimensions          : 2
Number of accepted moves      : 16
===============
Cost         : 1441.04
Number of vehicles used : 5