Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     3524 constraints,    5927 variables,        15923 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          5869 iter.

Relaxed solution       394.424863482 after       7685 iter is B&B base.
 
Feasible solution      373.050862322 after      11476 iter,        57 nodes (gap 5.4%)
Improved solution      377.060862322 after      11479 iter,        58 nodes (gap 4.4%)
Improved solution       377.06486232 after      11490 iter,        63 nodes (gap 4.4%)
Improved solution      377.068862322 after      11710 iter,        81 nodes (gap 4.4%)
Improved solution       377.07286232 after      11892 iter,        90 nodes (gap 4.4%)
Improved solution      377.077862322 after      20409 iter,       520 nodes (gap 4.4%)
Improved solution      381.089862322 after      21150 iter,       554 nodes (gap 3.4%)
Improved solution      382.022860493 after      40572 iter,      1531 nodes (gap 3.1%)
Improved solution      382.027860493 after      40743 iter,      1550 nodes (gap 3.1%)
Improved solution      383.023858678 after      66978 iter,      2803 nodes (gap 2.9%)
Improved solution      383.027858678 after      67476 iter,      2832 nodes (gap 2.9%)
Improved solution      386.000858678 after      69212 iter,      2905 nodes (gap 2.1%)
Improved solution      386.039860499 after      79952 iter,      3370 nodes (gap 2.1%)
Improved solution       386.99385867 after     117683 iter,      4901 nodes (gap 1.9%)
Improved solution       387.01885867 after     150578 iter,      6426 nodes (gap 1.9%)
Improved solution      388.978858678 after     156325 iter,      6683 nodes (gap 1.4%)
Improved solution      389.001856853 after     189883 iter,      8546 nodes (gap 1.4%)
Improved solution      389.014856853 after     194308 iter,      8781 nodes (gap 1.4%)
Improved solution      389.037856859 after     492742 iter,     21856 nodes (gap 1.4%)
Improved solution      389.948856859 after     725913 iter,     32480 nodes (gap 1.1%)
Improved solution      389.954858668 after    2177215 iter,     92342 nodes (gap 1.1%)
Improved solution      390.507358668 after    2182997 iter,     92526 nodes (gap 1.0%)
Improved solution      390.516358672 after    2201073 iter,     93215 nodes (gap 1.0%)
Improved solution      390.523358672 after    2202259 iter,     93257 nodes (gap 1.0%)
Improved solution      391.035856853 after    2317187 iter,     98600 nodes (gap 0.9%)
Improved solution      391.042856853 after    2322424 iter,     98818 nodes (gap 0.9%)
Improved solution      391.046856853 after    2462589 iter,    105138 nodes (gap 0.9%)
Improved solution      391.051856853 after    2464745 iter,    105226 nodes (gap 0.9%)
Improved solution      391.051856853 after    2487723 iter,    106057 nodes (gap 0.9%)

lp_solve optimization was stopped due to time-out.
 
Optimal solution       391.051856853 after    2909108 iter,    125623 nodes (gap 0.7%).

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 2909108, 177032 (6.1%) were bound flips.
      There were 63487 refactorizations, 0 triggered by time and 58 by density.
       ... on average 43.0 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 11845 NZ entries, 1.2x largest basis.
      The maximum B&B level was 90, 0.1x MIP order, 79 at the optimal solution.
      The constraint matrix inf-norm is 8, with a dynamic range of 8000.
      Time to load data was 0.058 seconds, presolve used 0.034 seconds,
       ... 7199.971 seconds in simplex solver, in total 7200.063 seconds.

Model name:  '' - run #1    
Objective:   Maximize(R0)
 
SUBMITTED
Model size:     3524 constraints,    5927 variables,        15923 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           105 iter.

Relaxed solution                   0 after       1661 iter is B&B base.
 
Feasible solution                  0 after       1661 iter,         0 nodes (gap 0.0%)
 
Optimal solution                   0 after       1661 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 1661, 0 (0.0%) were bound flips.
      There were 9 refactorizations, 0 triggered by time and 0 by density.
       ... on average 184.6 major pivots per refactorization.
      The largest [LUSOL v2.2.1.0] fact(B) had 6954 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 8, with a dynamic range of 8000.
      Time to load data was 0.066 seconds, presolve used 0.035 seconds,
       ... 5.634 seconds in simplex solver, in total 5.735 seconds.
Vehicle Type: 0 Num:29 Trip segments:158