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

The solution improvement phase finds a solution using 13 vehicles with a cost of 1900.16 units:

  2583.49
Improving solution
Number of fails               : 0
Number of choice points       : 0
Number of variables           : 2359
Number of constraints         : 440
Reversible stack (bytes)      : 201024
Solver heap (bytes)           : 1025380
Solver global heap (bytes)    : 269064
And stack (bytes)             : 20124
Or stack (bytes)              : 44244
Search Stack (bytes)          : 4044
Constraint queue (bytes)      : 11160
Total memory used (bytes)     : 1575040
Elapsed time since creation   : 0.01
Number of nodes               : 51
Number of visits              : 80
Number of vehicles            : 15
Number of dimensions          : 3
Number of accepted moves      : 28
===============
Cost         : 1900.16
Number of vehicles used : 13