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 21230 iter. Relaxed solution 791.78865743 after 24320 iter is B&B base. Feasible solution 791.708566466 after 24895 iter, 74 nodes (gap 0.0%) Improved solution 791.708567369 after 24942 iter, 81 nodes (gap 0.0%) Improved solution 791.71057189 after 25033 iter, 94 nodes (gap 0.0%) Improved solution 791.712573701 after 25312 iter, 141 nodes (gap 0.0%) Improved solution 791.712576415 after 25339 iter, 148 nodes (gap 0.0%) Improved solution 791.712577317 after 25542 iter, 187 nodes (gap 0.0%) Improved solution 791.712580031 after 25568 iter, 194 nodes (gap 0.0%) Improved solution 791.712580931 after 25837 iter, 265 nodes (gap 0.0%) Improved solution 791.712583647 after 25912 iter, 276 nodes (gap 0.0%) Improved solution 791.712584545 after 26188 iter, 351 nodes (gap 0.0%) Improved solution 791.712587261 after 26279 iter, 364 nodes (gap 0.0%) Improved solution 791.712588159 after 26584 iter, 439 nodes (gap 0.0%) Improved solution 791.712590875 after 26678 iter, 452 nodes (gap 0.0%) Improved solution 791.714563753 after 27078 iter, 518 nodes (gap 0.0%) Improved solution 791.714564656 after 27130 iter, 525 nodes (gap 0.0%) Improved solution 791.716569177 after 27222 iter, 538 nodes (gap 0.0%) Improved solution 791.718570988 after 27499 iter, 585 nodes (gap 0.0%) Improved solution 791.718573702 after 27526 iter, 592 nodes (gap 0.0%) Improved solution 791.718574604 after 27736 iter, 631 nodes (gap 0.0%) Improved solution 791.718577318 after 27762 iter, 638 nodes (gap 0.0%) Improved solution 791.71857822 after 27970 iter, 677 nodes (gap 0.0%) Improved solution 791.718580934 after 27997 iter, 684 nodes (gap 0.0%) Improved solution 791.718580934 after 28033 iter, 694 nodes (gap 0.0%) Improved solution 791.718581834 after 28273 iter, 755 nodes (gap 0.0%) Improved solution 791.71858455 after 28346 iter, 766 nodes (gap 0.0%) Improved solution 791.718585448 after 28629 iter, 841 nodes (gap 0.0%) Improved solution 791.718588164 after 28715 iter, 854 nodes (gap 0.0%) Improved solution 791.718589066 after 29108 iter, 959 nodes (gap 0.0%) Improved solution 791.718590876 after 30175 iter, 1149 nodes (gap 0.0%) Improved solution 791.718591776 after 30783 iter, 1314 nodes (gap 0.0%) Improved solution 791.71859449 after 30887 iter, 1329 nodes (gap 0.0%) Improved solution 791.724562855 after 31173 iter, 1357 nodes (gap 0.0%) Improved solution 791.724566471 after 31235 iter, 1369 nodes (gap 0.0%) Improved solution 791.724570087 after 31315 iter, 1387 nodes (gap 0.0%) Improved solution 791.724573703 after 31396 iter, 1405 nodes (gap 0.0%) Improved solution 791.724576415 after 31981 iter, 1498 nodes (gap 0.0%) Improved solution 791.724580031 after 32108 iter, 1526 nodes (gap 0.0%) Improved solution 791.724582743 after 32875 iter, 1657 nodes (gap 0.0%) Improved solution 791.724583645 after 33132 iter, 1714 nodes (gap 0.0%) Improved solution 791.724585455 after 34123 iter, 1900 nodes (gap 0.0%) Improved solution 791.724586353 after 34613 iter, 2055 nodes (gap 0.0%) Improved solution 791.724589069 after 34702 iter, 2068 nodes (gap 0.0%) Improved solution 791.724589971 after 35152 iter, 2195 nodes (gap 0.0%) Improved solution 791.724591781 after 36264 iter, 2397 nodes (gap 0.0%) Improved solution 791.724592681 after 36967 iter, 2572 nodes (gap 0.0%) Improved solution 791.724595395 after 37097 iter, 2589 nodes (gap 0.0%) Improved solution 791.724595396 after 37308 iter, 2653 nodes (gap 0.0%) Improved solution 791.724596298 after 37457 iter, 2711 nodes (gap 0.0%) Improved solution 791.731597205 after 37510 iter, 2737 nodes (gap 0.0%) Improved solution 791.731598105 after 37561 iter, 2754 nodes (gap 0.0%) Improved solution 791.73257461 after 64677 iter, 9144 nodes (gap 0.0%) Improved solution 791.732578226 after 64784 iter, 9160 nodes (gap 0.0%) Improved solution 791.732581842 after 64898 iter, 9180 nodes (gap 0.0%) Improved solution 791.732585456 after 65011 iter, 9200 nodes (gap 0.0%) Improved solution 791.73258907 after 65124 iter, 9220 nodes (gap 0.0%) Improved solution 791.732592682 after 65252 iter, 9242 nodes (gap 0.0%) Improved solution 791.732595396 after 65497 iter, 9289 nodes (gap 0.0%) Improved solution 791.738571897 after 65740 iter, 9314 nodes (gap 0.0%) Improved solution 791.738575515 after 65834 iter, 9328 nodes (gap 0.0%) Improved solution 791.738579131 after 66025 iter, 9358 nodes (gap 0.0%) Improved solution 791.738582747 after 66242 iter, 9400 nodes (gap 0.0%) Improved solution 791.738586361 after 66457 iter, 9440 nodes (gap 0.0%) Improved solution 791.738589975 after 66672 iter, 9480 nodes (gap 0.0%) Improved solution 791.738593587 after 66805 iter, 9500 nodes (gap 0.0%) Improved solution 791.738596301 after 67092 iter, 9555 nodes (gap 0.0%) Improved solution 791.738597204 after 67198 iter, 9576 nodes (gap 0.0%) Improved solution 791.738597205 after 71892 iter, 10548 nodes (gap 0.0%) Improved solution 791.738598104 after 74317 iter, 11036 nodes (gap 0.0%) lp_solve optimization was stopped due to time-out. Optimal solution 791.738598104 after 295827 iter, 53023 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 295827, 20504 (6.9%) were bound flips. There were 26590 refactorizations, 0 triggered by time and 0 by density. ... on average 10.4 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 58602 NZ entries, 1.0x largest basis. The maximum B&B level was 92, 0.0x MIP order, 60 at the optimal solution. The constraint matrix inf-norm is 8, with a dynamic range of 8000. Time to load data was 0.294 seconds, presolve used 0.186 seconds, ... 7199.840 seconds in simplex solver, in total 7200.320 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. Relaxed solution 0 after 10600 iter is B&B base. Feasible solution 0 after 10600 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 10600 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 10600, 0 (0.0%) were bound flips. There were 45 refactorizations, 0 triggered by time and 0 by density. ... on average 235.6 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 45178 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.310 seconds, presolve used 0.193 seconds, ... 243.720 seconds in simplex solver, in total 244.223 seconds. Vehicle Type: 0 Num:118 Trip segments:445