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

The solution improvement phase finds a solution using 10 vehicles with a cost of 1203.79 units:

  2286.23
Improving solution
Number of fails               : 0
Number of choice points       : 0
Number of variables           : 2344
Number of constraints         : 440
Reversible stack (bytes)      : 201024
Solver heap (bytes)           : 1017340
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)     : 1442320
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      : 24
===============
Cost         : 1203.79
Number of vehicles used : 10