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         17138 iter.

Relaxed solution       23.3259880408 after      18843 iter is B&B base.
 
Feasible solution       23.325872732 after      19047 iter,        40 nodes (gap 0.0%)
Improved solution       23.325873646 after      21401 iter,       540 nodes (gap 0.0%)
Improved solution       23.325874546 after      21498 iter,       557 nodes (gap 0.0%)
Improved solution       23.325875445 after      22078 iter,       662 nodes (gap 0.0%)
Improved solution       23.325875446 after      23998 iter,      1088 nodes (gap 0.0%)
Improved solution       23.325876343 after      24560 iter,      1193 nodes (gap 0.0%)
Improved solution       23.325877252 after      26943 iter,      1700 nodes (gap 0.0%)
Improved solution       23.325878152 after      27040 iter,      1717 nodes (gap 0.0%)
Improved solution       23.325879051 after      27619 iter,      1822 nodes (gap 0.0%)
Improved solution       23.325879052 after      29543 iter,      2248 nodes (gap 0.0%)
Improved solution       23.325879949 after      30108 iter,      2353 nodes (gap 0.0%)
Improved solution       23.325879959 after      37908 iter,      4155 nodes (gap 0.0%)
Improved solution       23.325880859 after      38005 iter,      4172 nodes (gap 0.0%)
Improved solution       23.325881758 after      38581 iter,      4277 nodes (gap 0.0%)
Improved solution       23.325882665 after      47899 iter,      6627 nodes (gap 0.0%)
Improved solution       23.325883565 after      48000 iter,      6644 nodes (gap 0.0%)
Improved solution       23.325886271 after      48117 iter,      6666 nodes (gap 0.0%)
Improved solution        23.32588628 after     110607 iter,     24778 nodes (gap 0.0%)
Improved solution       23.325887189 after     120678 iter,     27226 nodes (gap 0.0%)
Improved solution       23.325888088 after     120916 iter,     27273 nodes (gap 0.0%)
Improved solution       23.325888089 after     121927 iter,     27471 nodes (gap 0.0%)
Improved solution       23.325888986 after     122175 iter,     27518 nodes (gap 0.0%)

lp_solve optimization was stopped by the user.
 
Subopt. solution        23.325888986 after     142142 iter,     34285 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 142142, 11172 (7.9%) were bound flips.
      There were 17204 refactorizations, 0 triggered by time and 0 by density.
       ... on average 7.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57727 NZ entries, 1.0x largest basis.
      The maximum B&B level was 53, 0.0x MIP order, 43 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.405 seconds, presolve used 0.249 seconds,
       ... 5062.243 seconds in simplex solver, in total 5062.897 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          1308 iter.

lp_solve optimization was stopped by the user.
 
Optimal solution                   0 after       5701 iter,         0 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 5701, 0 (0.0%) were bound flips.
      There were 25 refactorizations, 0 triggered by time and 0 by density.
       ... on average 228.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 35175 NZ entries, 1.0x largest basis.
      The maximum B&B level was 1, 0.0x MIP order, with 0 nodes explored.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.550 seconds, presolve used 0.478 seconds,
       ... 394.708 seconds in simplex solver, in total 395.736 seconds.
Vehicle Type: 0 Num:37 Trip segments:123