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 21273 iter. Relaxed solution 384.259830583 after 23931 iter is B&B base. Feasible solution 384.182754287 after 24399 iter, 62 nodes (gap 0.0%) Improved solution 384.182755196 after 24430 iter, 65 nodes (gap 0.0%) Improved solution 384.182756094 after 25107 iter, 182 nodes (gap 0.0%) Improved solution 384.18275972 after 25574 iter, 260 nodes (gap 0.0%) Improved solution 384.18276062 after 25813 iter, 307 nodes (gap 0.0%) Improved solution 384.183767856 after 26245 iter, 382 nodes (gap 0.0%) Improved solution 384.183774184 after 26253 iter, 385 nodes (gap 0.0%) Improved solution 384.183776896 after 26279 iter, 388 nodes (gap 0.0%) Improved solution 384.188764235 after 26420 iter, 395 nodes (gap 0.0%) Improved solution 384.188765144 after 26454 iter, 401 nodes (gap 0.0%) Improved solution 384.188769659 after 26633 iter, 444 nodes (gap 0.0%) Improved solution 384.188770568 after 26670 iter, 449 nodes (gap 0.0%) Improved solution 384.188771466 after 27112 iter, 509 nodes (gap 0.0%) Improved solution 384.188774178 after 27126 iter, 511 nodes (gap 0.0%) Improved solution 384.18975701 after 27428 iter, 537 nodes (gap 0.0%) Improved solution 384.189762434 after 27448 iter, 542 nodes (gap 0.0%) Improved solution 384.189766043 after 27553 iter, 553 nodes (gap 0.0%) Improved solution 384.190754296 after 27788 iter, 570 nodes (gap 0.0%) Improved solution 384.19075972 after 28360 iter, 673 nodes (gap 0.0%) Improved solution 384.191763339 after 28685 iter, 714 nodes (gap 0.0%) Improved solution 384.191768763 after 28754 iter, 727 nodes (gap 0.0%) Improved solution 384.191771471 after 28925 iter, 749 nodes (gap 0.0%) Improved solution 384.191774187 after 29343 iter, 789 nodes (gap 0.0%) Improved solution 384.192757008 after 29708 iter, 813 nodes (gap 0.0%) Improved solution 384.196757008 after 29781 iter, 833 nodes (gap 0.0%) Improved solution 384.196762432 after 30039 iter, 874 nodes (gap 0.0%) Improved solution 384.197766051 after 30253 iter, 897 nodes (gap 0.0%) Improved solution 384.197771475 after 30467 iter, 924 nodes (gap 0.0%) Improved solution 384.197772383 after 30884 iter, 958 nodes (gap 0.0%) Improved solution 384.197774187 after 31229 iter, 987 nodes (gap 0.0%) Improved solution 384.197777807 after 31291 iter, 997 nodes (gap 0.0%) Improved solution 384.198764242 after 31657 iter, 1018 nodes (gap 0.0%) Improved solution 384.198769666 after 31851 iter, 1051 nodes (gap 0.0%) Improved solution 384.198772376 after 31999 iter, 1067 nodes (gap 0.0%) Improved solution 384.19877509 after 32419 iter, 1105 nodes (gap 0.0%) Improved solution 384.19877871 after 33125 iter, 1185 nodes (gap 0.0%) Improved solution 384.199762429 after 42161 iter, 2517 nodes (gap 0.0%) Improved solution 384.199766053 after 42236 iter, 2524 nodes (gap 0.0%) Improved solution 384.199766958 after 42575 iter, 2572 nodes (gap 0.0%) Improved solution 384.199768761 after 43209 iter, 2656 nodes (gap 0.0%) Improved solution 384.199771473 after 43658 iter, 2734 nodes (gap 0.0%) Improved solution 384.199774194 after 43922 iter, 2775 nodes (gap 0.0%) Improved solution 384.199775096 after 44070 iter, 2797 nodes (gap 0.0%) Improved solution 384.200759703 after 44407 iter, 2821 nodes (gap 0.0%) Improved solution 384.20076242 after 44483 iter, 2836 nodes (gap 0.0%) Improved solution 384.200766044 after 44595 iter, 2847 nodes (gap 0.0%) Improved solution 384.200768762 after 44716 iter, 2860 nodes (gap 0.0%) Improved solution 384.201766047 after 44755 iter, 2863 nodes (gap 0.0%) Improved solution 384.201768759 after 45134 iter, 2912 nodes (gap 0.0%) Improved solution 384.201771474 after 45228 iter, 2925 nodes (gap 0.0%) Improved solution 384.201775088 after 45445 iter, 2957 nodes (gap 0.0%) Improved solution 384.20276333 after 45834 iter, 2989 nodes (gap 0.0%) Improved solution 384.20276695 after 46211 iter, 3033 nodes (gap 0.0%) Improved solution 384.202768757 after 46580 iter, 3089 nodes (gap 0.0%) Improved solution 384.202769662 after 47005 iter, 3146 nodes (gap 0.0%) Improved solution 384.202772377 after 47092 iter, 3159 nodes (gap 0.0%) Improved solution 384.202775089 after 47516 iter, 3231 nodes (gap 0.0%) Improved solution 384.202775989 after 54693 iter, 4177 nodes (gap 0.0%) Improved solution 384.202778703 after 64703 iter, 5364 nodes (gap 0.0%) Improved solution 384.203761527 after 119671 iter, 13150 nodes (gap 0.0%) Improved solution 384.203764239 after 119889 iter, 13171 nodes (gap 0.0%) Improved solution 384.203765147 after 120141 iter, 13198 nodes (gap 0.0%) Improved solution 384.203767859 after 120474 iter, 13235 nodes (gap 0.0%) Improved solution 384.203771473 after 120921 iter, 13314 nodes (gap 0.0%) Improved solution 384.204756094 after 121297 iter, 13361 nodes (gap 0.0%) Improved solution 384.204761521 after 121444 iter, 13383 nodes (gap 0.0%) Improved solution 384.204764228 after 122045 iter, 13466 nodes (gap 0.0%) Improved solution 384.204765135 after 122135 iter, 13477 nodes (gap 0.0%) Improved solution 384.205753377 after 122652 iter, 13543 nodes (gap 0.0%) Improved solution 384.205756997 after 122938 iter, 13583 nodes (gap 0.0%) Improved solution 384.205758804 after 123131 iter, 13611 nodes (gap 0.0%) Improved solution 384.205762424 after 123416 iter, 13655 nodes (gap 0.0%) Improved solution 384.205764231 after 123786 iter, 13715 nodes (gap 0.0%) Improved solution 384.205765136 after 124223 iter, 13772 nodes (gap 0.0%) Improved solution 384.205767851 after 124313 iter, 13785 nodes (gap 0.0%) Improved solution 384.205771465 after 124817 iter, 13875 nodes (gap 0.0%) Improved solution 384.205772362 after 131112 iter, 14701 nodes (gap 0.0%) Improved solution 384.205775976 after 131425 iter, 14765 nodes (gap 0.0%) Improved solution 384.205777789 after 155312 iter, 17676 nodes (gap 0.0%) Improved solution 384.205778688 after 177303 iter, 20271 nodes (gap 0.0%) lp_solve optimization was stopped due to time-out. Optimal solution 384.205778688 after 250787 iter, 29623 nodes (gap 0.0%). Excellent numeric accuracy ||*|| = 8.88178e-16 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 250787, 17796 (7.1%) were bound flips. There were 14888 refactorizations, 0 triggered by time and 0 by density. ... on average 15.6 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 58447 NZ entries, 1.0x largest basis. The maximum B&B level was 76, 0.0x MIP order, 63 at the optimal solution. The constraint matrix inf-norm is 8, with a dynamic range of 8000. Time to load data was 0.317 seconds, presolve used 0.185 seconds, ... 7199.851 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 2111 iter. Relaxed solution 0 after 11416 iter is B&B base. Feasible solution 0 after 11416 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 11416 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 11416, 0 (0.0%) were bound flips. There were 48 refactorizations, 0 triggered by time and 0 by density. ... on average 237.8 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 48380 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.314 seconds, presolve used 0.189 seconds, ... 266.034 seconds in simplex solver, in total 266.537 seconds. Vehicle Type: 0 Num:63 Trip segments:245