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 4847 iter. Relaxed solution 369.275379311 after 5958 iter is B&B base. Feasible solution 369.160774333 after 6703 iter, 89 nodes (gap 0.0%) Improved solution 369.160776144 after 6725 iter, 92 nodes (gap 0.0%) Improved solution 369.161774333 after 8123 iter, 279 nodes (gap 0.0%) Improved solution 369.161776138 after 11860 iter, 925 nodes (gap 0.0%) Improved solution 369.162772518 after 19499 iter, 2077 nodes (gap 0.0%) Improved solution 369.162774325 after 21601 iter, 2381 nodes (gap 0.0%) Improved solution 369.162776136 after 21657 iter, 2386 nodes (gap 0.0%) Improved solution 369.162777941 after 28655 iter, 3641 nodes (gap 0.0%) Improved solution 369.162779746 after 39941 iter, 5605 nodes (gap 0.0%) Improved solution 369.166774329 after 42625 iter, 6037 nodes (gap 0.0%) Improved solution 369.16677614 after 42642 iter, 6040 nodes (gap 0.0%) Improved solution 369.167774325 after 43668 iter, 6191 nodes (gap 0.0%) Improved solution 369.167776136 after 43939 iter, 6228 nodes (gap 0.0%) Improved solution 369.167777945 after 44684 iter, 6337 nodes (gap 0.0%) Improved solution 369.16777975 after 47349 iter, 6855 nodes (gap 0.0%) Improved solution 369.168774317 after 48408 iter, 7048 nodes (gap 0.0%) Improved solution 369.168776128 after 48777 iter, 7089 nodes (gap 0.0%) Improved solution 369.168777937 after 49951 iter, 7257 nodes (gap 0.0%) Improved solution 369.168779748 after 51888 iter, 7576 nodes (gap 0.0%) Improved solution 369.168781553 after 58872 iter, 8847 nodes (gap 0.0%) Improved solution 369.169774313 after 78380 iter, 12266 nodes (gap 0.0%) Improved solution 369.169776118 after 79298 iter, 12419 nodes (gap 0.0%) Improved solution 369.169777927 after 79888 iter, 12520 nodes (gap 0.0%) Improved solution 369.169779738 after 82801 iter, 13053 nodes (gap 0.0%) Improved solution 369.169781543 after 89557 iter, 14372 nodes (gap 0.0%) Improved solution 369.169781549 after 93130 iter, 15052 nodes (gap 0.0%) Improved solution 369.169783352 after 95251 iter, 15475 nodes (gap 0.0%) Improved solution 369.169785159 after 106592 iter, 17604 nodes (gap 0.0%) Improved solution 369.169785161 after 149175 iter, 25567 nodes (gap 0.0%) Improved solution 369.169786968 after 150632 iter, 25833 nodes (gap 0.0%) Improved solution 369.16978697 after 173215 iter, 30012 nodes (gap 0.0%) Improved solution 369.169788777 after 174796 iter, 30270 nodes (gap 0.0%) Improved solution 369.170772518 after 205920 iter, 36390 nodes (gap 0.0%) Improved solution 369.170774329 after 206200 iter, 36418 nodes (gap 0.0%) Improved solution 369.17077614 after 207334 iter, 36556 nodes (gap 0.0%) Improved solution 369.170777947 after 207666 iter, 36597 nodes (gap 0.0%) Improved solution 369.170779758 after 208207 iter, 36649 nodes (gap 0.0%) Improved solution 369.170781563 after 215290 iter, 37624 nodes (gap 0.0%) Improved solution 369.171772506 after 231720 iter, 40089 nodes (gap 0.0%) Improved solution 369.171774317 after 231732 iter, 40092 nodes (gap 0.0%) Improved solution 369.171776128 after 232166 iter, 40158 nodes (gap 0.0%) Improved solution 369.171777937 after 233358 iter, 40329 nodes (gap 0.0%) Improved solution 369.171779748 after 237545 iter, 41008 nodes (gap 0.0%) Improved solution 369.171781553 after 250491 iter, 43079 nodes (gap 0.0%) Improved solution 369.171783358 after 269445 iter, 46235 nodes (gap 0.0%) Improved solution 369.171783362 after 279189 iter, 47736 nodes (gap 0.0%) Improved solution 369.171785167 after 295488 iter, 50387 nodes (gap 0.0%) Improved solution 369.171785169 after 304623 iter, 51855 nodes (gap 0.0%) Improved solution 369.171786974 after 401273 iter, 67627 nodes (gap 0.0%) Improved solution 369.171788779 after 441701 iter, 74213 nodes (gap 0.0%) Improved solution 369.171788781 after 535982 iter, 92214 nodes (gap 0.0%) Improved solution 369.171790588 after 537652 iter, 92511 nodes (gap 0.0%) Improved solution 369.171792389 after 1601250 iter, 307657 nodes (gap 0.0%) Improved solution 369.171792393 after 1762694 iter, 340784 nodes (gap 0.0%) Improved solution 369.171794198 after 1769071 iter, 341929 nodes (gap 0.0%) lp_solve optimization was stopped due to time-out. Optimal solution 369.171794198 after 1914801 iter, 371264 nodes (gap 0.0%). Excellent numeric accuracy ||*|| = 1.06581e-14 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 1914801, 165846 (8.7%) were bound flips. There were 185622 refactorizations, 0 triggered by time and 3 by density. ... on average 9.4 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 10571 NZ entries, 1.0x largest basis. The maximum B&B level was 109, 0.1x MIP order, 96 at the optimal solution. The constraint matrix inf-norm is 8, with a dynamic range of 8000. Time to load data was 0.061 seconds, presolve used 0.033 seconds, ... 7199.973 seconds in simplex solver, in total 7200.067 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.087 seconds, presolve used 0.053 seconds, ... 8.499 seconds in simplex solver, in total 8.639 seconds. Vehicle Type: 0 Num:83 Trip segments:228