Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 7646 constraints, 11381 variables, 32033 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 7756 iter. Relaxed solution 387.666900112 after 8653 iter is B&B base. Feasible solution 387.088851618 after 9396 iter, 38 nodes (gap 0.1%) Improved solution 387.097825807 after 9442 iter, 43 nodes (gap 0.1%) Improved solution 387.097838713 after 9509 iter, 51 nodes (gap 0.1%) Improved solution 387.107787087 after 10072 iter, 125 nodes (gap 0.1%) Improved solution 387.108774181 after 11137 iter, 239 nodes (gap 0.1%) Improved solution 387.108799994 after 11203 iter, 244 nodes (gap 0.1%) Improved solution 387.108825807 after 11377 iter, 255 nodes (gap 0.1%) Improved solution 387.108838713 after 11823 iter, 302 nodes (gap 0.1%) Improved solution 387.118787089 after 14258 iter, 540 nodes (gap 0.1%) Improved solution 387.125774181 after 16194 iter, 761 nodes (gap 0.1%) Improved solution 387.125799994 after 16242 iter, 766 nodes (gap 0.1%) Improved solution 387.125825807 after 16305 iter, 773 nodes (gap 0.1%) Improved solution 387.128812902 after 17496 iter, 904 nodes (gap 0.1%) Improved solution 387.129787088 after 18471 iter, 1016 nodes (gap 0.1%) Improved solution 387.129812901 after 18577 iter, 1035 nodes (gap 0.1%) Improved solution 387.129838712 after 18803 iter, 1066 nodes (gap 0.1%) Improved solution 387.129851619 after 18921 iter, 1083 nodes (gap 0.1%) Improved solution 387.12985162 after 19089 iter, 1106 nodes (gap 0.1%) Improved solution 387.134838713 after 19658 iter, 1190 nodes (gap 0.1%) Improved solution 387.13485162 after 19832 iter, 1214 nodes (gap 0.1%) Improved solution 387.134851621 after 20321 iter, 1273 nodes (gap 0.1%) Improved solution 387.141851621 after 21490 iter, 1450 nodes (gap 0.1%) Improved solution 387.142825811 after 23506 iter, 1629 nodes (gap 0.1%) Improved solution 387.144838716 after 29511 iter, 2625 nodes (gap 0.1%) Improved solution 387.154838716 after 29765 iter, 2653 nodes (gap 0.1%) Improved solution 387.160787092 after 29912 iter, 2673 nodes (gap 0.1%) Improved solution 387.160799998 after 30497 iter, 2746 nodes (gap 0.1%) Improved solution 387.163812905 after 31289 iter, 2843 nodes (gap 0.1%) Improved solution 387.164787088 after 31869 iter, 2889 nodes (gap 0.1%) Improved solution 387.164812908 after 33955 iter, 3020 nodes (gap 0.1%) Improved solution 387.16577419 after 37553 iter, 3441 nodes (gap 0.1%) Improved solution 387.166825808 after 44027 iter, 4092 nodes (gap 0.1%) Improved solution 387.167787091 after 44275 iter, 4120 nodes (gap 0.1%) Improved solution 387.172825808 after 44620 iter, 4147 nodes (gap 0.1%) Improved solution 387.172838716 after 44921 iter, 4180 nodes (gap 0.1%) Improved solution 387.173799999 after 45262 iter, 4215 nodes (gap 0.1%) Improved solution 387.175812905 after 45785 iter, 4256 nodes (gap 0.1%) Improved solution 387.176800003 after 48820 iter, 4434 nodes (gap 0.1%) Improved solution 387.181838717 after 52439 iter, 4885 nodes (gap 0.1%) Improved solution 387.187825814 after 52531 iter, 4893 nodes (gap 0.1%) Improved solution 387.188787095 after 53294 iter, 4961 nodes (gap 0.1%) Improved solution 387.188825817 after 56362 iter, 5209 nodes (gap 0.1%) Improved solution 387.189787099 after 59047 iter, 5443 nodes (gap 0.1%) Improved solution 387.193787095 after 69572 iter, 6293 nodes (gap 0.1%) Improved solution 387.194787093 after 69975 iter, 6334 nodes (gap 0.1%) Improved solution 387.200812906 after 71096 iter, 6506 nodes (gap 0.1%) Improved solution 387.201825815 after 72151 iter, 6603 nodes (gap 0.1%) Improved solution 387.20377419 after 73425 iter, 6820 nodes (gap 0.1%) Improved solution 387.208851625 after 73732 iter, 6853 nodes (gap 0.1%) Improved solution 387.208851626 after 73878 iter, 6870 nodes (gap 0.1%) Improved solution 387.209787097 after 82667 iter, 7686 nodes (gap 0.1%) Improved solution 387.214787101 after 89309 iter, 8334 nodes (gap 0.1%) Improved solution 387.214800009 after 89602 iter, 8377 nodes (gap 0.1%) Improved solution 387.215800009 after 95620 iter, 9116 nodes (gap 0.1%) Improved solution 387.217812912 after 99174 iter, 9521 nodes (gap 0.1%) Improved solution 387.217851631 after 99276 iter, 9536 nodes (gap 0.1%) Improved solution 387.217890342 after 108294 iter, 10359 nodes (gap 0.1%) Improved solution 387.219761288 after 140236 iter, 13244 nodes (gap 0.1%) Improved solution 387.220761288 after 140642 iter, 13285 nodes (gap 0.1%) Improved solution 387.22281291 after 141379 iter, 13358 nodes (gap 0.1%) Improved solution 387.222851621 after 143752 iter, 13601 nodes (gap 0.1%) Improved solution 387.223838723 after 163851 iter, 15257 nodes (gap 0.1%) Improved solution 387.224748384 after 204803 iter, 18423 nodes (gap 0.1%) Improved solution 387.224748384 after 205530 iter, 18539 nodes (gap 0.1%) Improved solution 387.227787097 after 209365 iter, 18958 nodes (gap 0.1%) Improved solution 387.227787098 after 209427 iter, 18966 nodes (gap 0.1%) Improved solution 387.228851626 after 221317 iter, 19934 nodes (gap 0.1%) Improved solution 387.23280001 after 278822 iter, 24146 nodes (gap 0.1%) Improved solution 387.232812915 after 458186 iter, 37071 nodes (gap 0.1%) Improved solution 387.232812919 after 466008 iter, 37704 nodes (gap 0.1%) Improved solution 387.234800013 after 492434 iter, 39636 nodes (gap 0.1%) Improved solution 387.236761295 after 492810 iter, 39666 nodes (gap 0.1%) Improved solution 387.236774201 after 493719 iter, 39743 nodes (gap 0.1%) Improved solution 387.236800017 after 494047 iter, 39775 nodes (gap 0.1%) Improved solution 387.237800013 after 494100 iter, 39781 nodes (gap 0.1%) Improved solution 387.237812916 after 494770 iter, 39839 nodes (gap 0.1%) Improved solution 387.237812917 after 726296 iter, 56730 nodes (gap 0.1%) Improved solution 387.238761296 after 727063 iter, 56797 nodes (gap 0.1%) Improved solution 387.238787107 after 727076 iter, 56800 nodes (gap 0.1%) Improved solution 387.238800007 after 728469 iter, 56898 nodes (gap 0.1%) Improved solution 387.238825818 after 728494 iter, 56901 nodes (gap 0.1%) Improved solution 387.239761287 after 776749 iter, 60577 nodes (gap 0.1%) Improved solution 387.240800009 after 870187 iter, 67722 nodes (gap 0.1%) Improved solution 387.241812915 after 870370 iter, 67735 nodes (gap 0.1%) Improved solution 387.24382582 after 870606 iter, 67755 nodes (gap 0.1%) Improved solution 387.244851634 after 870738 iter, 67766 nodes (gap 0.1%) Improved solution 387.245774199 after 871099 iter, 67800 nodes (gap 0.1%) Improved solution 387.245774199 after 871470 iter, 67878 nodes (gap 0.1%) Improved solution 387.250787104 after 871878 iter, 67936 nodes (gap 0.1%) Improved solution 387.250800012 after 871965 iter, 67948 nodes (gap 0.1%) Improved solution 387.252825819 after 887492 iter, 69075 nodes (gap 0.1%) Improved solution 387.257761292 after 887873 iter, 69102 nodes (gap 0.1%) Improved solution 387.260787103 after 887982 iter, 69113 nodes (gap 0.1%) lp_solve optimization was stopped due to time-out. Optimal solution 387.260787103 after 1136629 iter, 88344 nodes (gap 0.1%). Excellent numeric accuracy ||*|| = 4.44089e-15 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 1136629, 126135 (11.1%) were bound flips. There were 44200 refactorizations, 0 triggered by time and 2 by density. ... on average 22.9 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 21980 NZ entries, 1.0x largest basis. The maximum B&B level was 66, 0.0x MIP order, 48 at the optimal solution. The constraint matrix inf-norm is 128, with a dynamic range of 128000. Time to load data was 0.355 seconds, presolve used 0.074 seconds, ... 7199.938 seconds in simplex solver, in total 7200.367 seconds. Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 7646 constraints, 11381 variables, 32033 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 3376 iter is B&B base. Feasible solution 0 after 3376 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 3376 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 3376, 0 (0.0%) were bound flips. There were 15 refactorizations, 0 triggered by time and 0 by density. ... on average 225.1 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 14150 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.184 seconds, presolve used 0.076 seconds, ... 31.515 seconds in simplex solver, in total 31.775 seconds. Vehicle Type: 0 Num:28 Trip segments:94