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

Relaxed solution       23.3339900431 after      18572 iter is B&B base.
 
Feasible solution       23.328875001 after      19171 iter,        57 nodes (gap 0.0%)
Improved solution       23.328894516 after      19208 iter,        64 nodes (gap 0.0%)
Improved solution       23.328914026 after      19313 iter,        87 nodes (gap 0.0%)
Improved solution       23.328940046 after      19534 iter,       117 nodes (gap 0.0%)
Improved solution        23.32896606 after      20005 iter,       185 nodes (gap 0.0%)
Improved solution       23.328972563 after      27024 iter,      2126 nodes (gap 0.0%)
Improved solution       23.328998579 after      27291 iter,      2174 nodes (gap 0.0%)
Improved solution       23.329005081 after      27644 iter,      2281 nodes (gap 0.0%)
Improved solution       23.329011585 after      36045 iter,      4826 nodes (gap 0.0%)
Improved solution       23.329037597 after      36460 iter,      4896 nodes (gap 0.0%)
Improved solution       23.329044099 after      36820 iter,      5005 nodes (gap 0.0%)
Improved solution       23.329057111 after      45107 iter,      7583 nodes (gap 0.0%)
Improved solution       23.329083123 after      45537 iter,      7677 nodes (gap 0.0%)
Improved solution       23.329102632 after      46255 iter,      7884 nodes (gap 0.0%)
Improved solution       23.329109133 after      47000 iter,      8131 nodes (gap 0.0%)
Improved solution       23.329115633 after      49077 iter,      8842 nodes (gap 0.0%)
Improved solution       23.329122142 after      62251 iter,     13533 nodes (gap 0.0%)
Improved solution       23.329141651 after      62985 iter,     13740 nodes (gap 0.0%)
Improved solution       23.329148152 after      63798 iter,     14037 nodes (gap 0.0%)
Improved solution       23.329167661 after      64575 iter,     14282 nodes (gap 0.0%)
Improved solution       23.329174162 after      65412 iter,     14581 nodes (gap 0.0%)
Improved solution       23.329180669 after      82885 iter,     20408 nodes (gap 0.0%)
Improved solution        23.32918717 after      83737 iter,     20721 nodes (gap 0.0%)
Improved solution       23.329206679 after      84506 iter,     20966 nodes (gap 0.0%)
Improved solution        23.32921318 after      85378 iter,     21283 nodes (gap 0.0%)
Improved solution       23.329219687 after     103165 iter,     27170 nodes (gap 0.0%)
Improved solution       23.329226188 after     104052 iter,     27501 nodes (gap 0.0%)
Improved solution       23.329245697 after     104882 iter,     27760 nodes (gap 0.0%)
Improved solution       23.329252198 after     105772 iter,     28093 nodes (gap 0.0%)
Improved solution       23.329258701 after     127096 iter,     36510 nodes (gap 0.0%)
Improved solution       23.329284709 after     127790 iter,     36678 nodes (gap 0.0%)
Improved solution        23.32928471 after     130728 iter,     37502 nodes (gap 0.0%)
Improved solution       23.329310718 after     152828 iter,     47440 nodes (gap 0.0%)
Improved solution       23.329317219 after     155193 iter,     48183 nodes (gap 0.0%)
Improved solution        23.32933023 after     183134 iter,     57985 nodes (gap 0.0%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution         23.32933023 after     202119 iter,     63493 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 202119, 18955 (9.4%) were bound flips.
      There were 31811 refactorizations, 0 triggered by time and 0 by density.
       ... on average 5.8 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 57703 NZ entries, 1.0x largest basis.
      The maximum B&B level was 77, 0.0x MIP order, 41 at the optimal solution.
      The constraint matrix inf-norm is 64, with a dynamic range of 64000.
      Time to load data was 0.318 seconds, presolve used 0.186 seconds,
       ... 7199.849 seconds in simplex solver, in total 7200.353 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 ||*|| = 0

 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 64, with a dynamic range of 64000.
      Time to load data was 0.343 seconds, presolve used 0.206 seconds,
       ... 330.380 seconds in simplex solver, in total 330.929 seconds.
Vehicle Type: 0 Num:31 Trip segments:103