Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:    20672 constraints,   24621 variables,        73163 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after         16098 iter.

Relaxed solution       22.3069887101 after      18504 iter is B&B base.
 
Feasible solution       22.305516208 after      18606 iter,        28 nodes (gap 0.0%)
Improved solution       22.305580725 after      18625 iter,        36 nodes (gap 0.0%)
Improved solution       22.305593624 after      18652 iter,        49 nodes (gap 0.0%)
Improved solution       22.305619431 after      18756 iter,        89 nodes (gap 0.0%)
Improved solution       22.305632331 after      18782 iter,       102 nodes (gap 0.0%)
Improved solution        22.30564523 after      18886 iter,       147 nodes (gap 0.0%)
Improved solution       22.305748451 after      18908 iter,       160 nodes (gap 0.0%)
Improved solution       22.305787156 after      19001 iter,       215 nodes (gap 0.0%)
Improved solution       22.305800053 after      19012 iter,       222 nodes (gap 0.0%)
Improved solution       22.305825863 after      19121 iter,       289 nodes (gap 0.0%)
Improved solution        22.30583876 after      19132 iter,       296 nodes (gap 0.0%)
Improved solution       22.305864569 after      19628 iter,       585 nodes (gap 0.0%)
Improved solution       22.305877466 after      19640 iter,       593 nodes (gap 0.0%)
 
Optimal solution        22.305877466 after      21105 iter,      1374 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 0

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 21105, 544 (2.6%) were bound flips.
      There were 764 refactorizations, 0 triggered by time and 0 by density.
       ... on average 26.9 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57687 NZ entries, 1.0x largest basis.
      The maximum B&B level was 33, 0.0x MIP order, 25 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.376 seconds, presolve used 0.252 seconds,
       ... 619.648 seconds in simplex solver, in total 620.276 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:    20672 constraints,   24621 variables,        73163 non-zeros.
Sets:                                   0 GUB,                  0 SOS.
 
Using DUAL simplex for phase 1 and PRIMAL simplex for phase 2.
The primal and dual simplex pricing strategy set to 'Devex'.
 
Found feasibility by dual simplex after             2 iter.

Relaxed solution                   0 after       9294 iter is B&B base.
 
Feasible solution                  0 after       9294 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       9294 iter,         0 nodes (gap 0.0%).

Excellent numeric accuracy ||*|| = 3.55271e-15

 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables.
      In the total iteration count 9294, 0 (0.0%) were bound flips.
      There were 39 refactorizations, 0 triggered by time and 0 by density.
       ... on average 238.3 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 39176 NZ entries, 1.0x largest basis.
      The maximum B&B level was 1, 0.0x MIP order, 1 at the optimal solution.
      The constraint matrix inf-norm is 128, with a dynamic range of 128000.
      Time to load data was 0.350 seconds, presolve used 0.205 seconds,
       ... 297.415 seconds in simplex solver, in total 297.970 seconds.
Vehicle Type: 0 Num:23 Trip segments:87