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 3762 iter. Relaxed solution 26.2359913314 after 4517 iter is B&B base. Feasible solution 26.202993559 after 5136 iter, 37 nodes (gap 0.1%) Improved solution 26.204019372 after 7041 iter, 276 nodes (gap 0.1%) Improved solution 26.204812862 after 10118 iter, 584 nodes (gap 0.1%) Improved solution 26.204838667 after 10716 iter, 639 nodes (gap 0.1%) Improved solution 26.204916108 after 10812 iter, 658 nodes (gap 0.1%) Improved solution 26.204916112 after 11453 iter, 729 nodes (gap 0.1%) Improved solution 26.204941925 after 11594 iter, 755 nodes (gap 0.1%) Improved solution 26.204993553 after 11779 iter, 781 nodes (gap 0.1%) Improved solution 26.205019364 after 13014 iter, 972 nodes (gap 0.1%) Improved solution 26.205019366 after 13315 iter, 1002 nodes (gap 0.1%) Improved solution 26.205045175 after 13678 iter, 1043 nodes (gap 0.1%) Improved solution 26.205941923 after 14629 iter, 1168 nodes (gap 0.1%) Improved solution 26.205941927 after 14863 iter, 1194 nodes (gap 0.1%) Improved solution 26.205993549 after 15157 iter, 1230 nodes (gap 0.1%) Improved solution 26.206019364 after 15335 iter, 1248 nodes (gap 0.1%) Improved solution 26.206045175 after 16353 iter, 1396 nodes (gap 0.1%) Improved solution 26.206045177 after 19050 iter, 1700 nodes (gap 0.1%) Improved solution 26.20607099 after 20501 iter, 1873 nodes (gap 0.1%) Improved solution 26.206967738 after 22796 iter, 2085 nodes (gap 0.1%) Improved solution 26.207019366 after 22837 iter, 2091 nodes (gap 0.1%) Improved solution 26.207045173 after 24613 iter, 2337 nodes (gap 0.1%) Improved solution 26.207045179 after 25965 iter, 2520 nodes (gap 0.1%) Improved solution 26.207967744 after 27662 iter, 2764 nodes (gap 0.1%) Improved solution 26.208019368 after 27899 iter, 2788 nodes (gap 0.1%) Improved solution 26.208045177 after 29240 iter, 2975 nodes (gap 0.1%) Improved solution 26.208045179 after 29457 iter, 2992 nodes (gap 0.1%) Improved solution 26.208070984 after 30988 iter, 3132 nodes (gap 0.1%) Improved solution 26.208096793 after 31198 iter, 3150 nodes (gap 0.1%) Improved solution 26.208096795 after 32566 iter, 3281 nodes (gap 0.1%) Improved solution 26.2081226 after 39104 iter, 3833 nodes (gap 0.1%) Improved solution 26.208148409 after 39376 iter, 3851 nodes (gap 0.1%) Improved solution 26.208148411 after 39576 iter, 3866 nodes (gap 0.1%) Improved solution 26.208993547 after 61574 iter, 5819 nodes (gap 0.1%) Improved solution 26.209045171 after 61608 iter, 5825 nodes (gap 0.1%) Improved solution 26.209070978 after 63793 iter, 6040 nodes (gap 0.1%) Improved solution 26.209096789 after 64385 iter, 6089 nodes (gap 0.1%) Improved solution 26.209122592 after 76322 iter, 7225 nodes (gap 0.1%) Improved solution 26.209993545 after 103998 iter, 10221 nodes (gap 0.1%) Improved solution 26.210045175 after 104236 iter, 10262 nodes (gap 0.1%) Improved solution 26.210070988 after 105039 iter, 10378 nodes (gap 0.1%) Improved solution 26.210096797 after 105617 iter, 10507 nodes (gap 0.1%) Improved solution 26.210096799 after 105640 iter, 10513 nodes (gap 0.1%) Improved solution 26.211045175 after 106278 iter, 10572 nodes (gap 0.1%) Improved solution 26.21107098 after 107985 iter, 10735 nodes (gap 0.1%) Improved solution 26.211096791 after 108200 iter, 10754 nodes (gap 0.1%) Improved solution 26.211096793 after 111765 iter, 11096 nodes (gap 0.1%) Improved solution 26.211122598 after 116378 iter, 11547 nodes (gap 0.1%) Improved solution 26.211148407 after 116627 iter, 11601 nodes (gap 0.1%) Improved solution 26.211148409 after 116738 iter, 11613 nodes (gap 0.1%) Improved solution 26.212070974 after 135772 iter, 13318 nodes (gap 0.1%) Improved solution 26.212096777 after 136375 iter, 13367 nodes (gap 0.1%) Improved solution 26.212122588 after 137626 iter, 13632 nodes (gap 0.1%) Improved solution 26.212122592 after 159155 iter, 15860 nodes (gap 0.1%) Improved solution 26.212122594 after 159213 iter, 15871 nodes (gap 0.1%) Improved solution 26.212148403 after 166898 iter, 16680 nodes (gap 0.1%) Improved solution 26.212174202 after 181065 iter, 18268 nodes (gap 0.1%) Improved solution 26.212174206 after 181139 iter, 18281 nodes (gap 0.1%) Improved solution 26.212200017 after 229608 iter, 23612 nodes (gap 0.1%) Improved solution 26.212225816 after 233675 iter, 24062 nodes (gap 0.1%) Improved solution 26.21222582 after 233766 iter, 24077 nodes (gap 0.1%) Improved solution 26.212225832 after 255493 iter, 26509 nodes (gap 0.1%) Improved solution 26.212225834 after 255516 iter, 26512 nodes (gap 0.1%) Improved solution 26.212251635 after 280048 iter, 29177 nodes (gap 0.1%) Improved solution 26.212251637 after 280174 iter, 29190 nodes (gap 0.1%) Improved solution 26.212251639 after 304524 iter, 31686 nodes (gap 0.1%) Improved solution 26.212251641 after 312506 iter, 32458 nodes (gap 0.1%) Improved solution 26.212277448 after 329742 iter, 34403 nodes (gap 0.1%) Improved solution 26.212303251 after 358882 iter, 38038 nodes (gap 0.1%) Improved solution 26.213096783 after 375565 iter, 40002 nodes (gap 0.1%) Improved solution 26.213096787 after 376428 iter, 40092 nodes (gap 0.1%) Improved solution 26.213122598 after 377035 iter, 40149 nodes (gap 0.1%) Improved solution 26.213148401 after 379335 iter, 40360 nodes (gap 0.1%) Improved solution 26.213148409 after 386187 iter, 40992 nodes (gap 0.1%) Improved solution 26.214096787 after 386640 iter, 41052 nodes (gap 0.1%) Improved solution 26.214122596 after 386719 iter, 41059 nodes (gap 0.1%) Improved solution 26.214122598 after 386750 iter, 41062 nodes (gap 0.1%) Improved solution 26.214148401 after 389974 iter, 41392 nodes (gap 0.1%) Improved solution 26.214174204 after 392977 iter, 41830 nodes (gap 0.1%) Improved solution 26.215096769 after 393655 iter, 41910 nodes (gap 0.1%) Improved solution 26.215122578 after 393788 iter, 41933 nodes (gap 0.1%) Improved solution 26.215148393 after 393820 iter, 41943 nodes (gap 0.1%) Improved solution 26.2151742 after 401712 iter, 42827 nodes (gap 0.1%) Improved solution 26.215200009 after 402033 iter, 42874 nodes (gap 0.1%) Improved solution 26.215200015 after 432644 iter, 45968 nodes (gap 0.1%) Improved solution 26.215225822 after 433890 iter, 46114 nodes (gap 0.1%) Improved solution 26.215225824 after 500767 iter, 52749 nodes (gap 0.1%) Improved solution 26.215251629 after 515563 iter, 54280 nodes (gap 0.1%) Improved solution 26.215277434 after 944119 iter, 93776 nodes (gap 0.1%) Improved solution 26.215277438 after 1126947 iter, 113612 nodes (gap 0.1%) Improved solution 26.215303243 after 1164170 iter, 117652 nodes (gap 0.1%) Improved solution 26.215303247 after 2342288 iter, 231849 nodes (gap 0.1%) lp_solve optimization was stopped due to time-out. Optimal solution 26.215303247 after 2829381 iter, 276758 nodes (gap 0.1%). 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 2829381, 245170 (8.7%) were bound flips. There were 138426 refactorizations, 0 triggered by time and 36 by density. ... on average 18.7 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 10131 NZ entries, 1.0x largest basis. The maximum B&B level was 61, 0.1x MIP order, 40 at the optimal solution. The constraint matrix inf-norm is 128, with a dynamic range of 128000. Time to load data was 0.060 seconds, presolve used 0.031 seconds, ... 7199.974 seconds in simplex solver, in total 7200.065 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 2 iter. Relaxed solution 0 after 1558 iter is B&B base. Feasible solution 0 after 1558 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1558 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 1558, 0 (0.0%) were bound flips. There were 8 refactorizations, 0 triggered by time and 0 by density. ... on average 194.8 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 6528 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.058 seconds, presolve used 0.033 seconds, ... 5.275 seconds in simplex solver, in total 5.366 seconds. Vehicle Type: 0 Num:17 Trip segments:54