/**
First Solution with cost: 735.716
Improving solution
***Improved Solution***
Number of fails               : 0
Number of choice points       : 1049
Number of variables           : 479
Number of constraints         : 108
Reversible stack (bytes)      : 68364
Solver heap (bytes)           : 333940
Solver global heap (bytes)    : 70960
And stack (bytes)             : 20124
Or stack (bytes)              : 44244
Search Stack (bytes)          : 4044
Constraint queue (bytes)      : 11160
Total memory used (bytes)     : 552836
Elapsed time since creation   : 0
Number of nodes               : 21
Number of visits              : 30
Number of vehicles            : 5
Number of dimensions          : 1
Number of accepted moves      : 13
===============
Cost         : 619.143
Number of vehicles used : 4
Solution     :
Unperformed visits : None
tech1 :
 -> start_tech1 Time[0..59.6393] -> visit3 Time[22.3607..82] -> visit9 Time[97..107] -> visit20 Time[118.18..188] -> end_tech1 Time[159.803..230]
tech2 :
 -> start_tech2 Time[0..16.6953] -> visit14 Time[32.0156..48.7109] -> visit17 Time[64.3763..81.0716] -> visit8 Time[95..105] -> visit19 Time[122.72..162.82] -> visit7 Time[143.9..184] -> visit18 Time[163.9..204] -> end_tech2 Time[189.712..230]
tech3 :
 -> start_tech3 Time[0..30] -> visit2 Time[18..48] -> visit15 Time[61..71] -> visit16 Time[96..110.749] -> visit5 Time[117.18..131.929] -> visit6 Time[137.18..151.929] -> visit13 Time[159..169] -> end_tech3 Time[180.18..230]
tech4 :
 -> start_tech4 Time[0..23.4691] -> visit10 Time[25.4951..48.9642] -> visit11 Time[67..70.1445] -> visit1 Time[103.401..106.545] -> visit12 Time[130.044..133.189] -> visit4 Time[155.855..159] -> end_tech4 Time[190.855..230]
tech5 : Unused
 
*/