Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3242 constraints, 5231 variables, 13493 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 4203 iter. Relaxed solution 396.895770736 after 4513 iter is B&B base. Feasible solution 373.064122224 after 6189 iter, 286 nodes (gap 6.0%) Improved solution 373.06414828 after 6226 iter, 294 nodes (gap 6.0%) Improved solution 373.064174336 after 6267 iter, 302 nodes (gap 6.0%) Improved solution 373.06420039 after 6315 iter, 312 nodes (gap 6.0%) Improved solution 373.064226444 after 6363 iter, 322 nodes (gap 6.0%) Improved solution 373.064252496 after 6448 iter, 340 nodes (gap 6.0%) Improved solution 373.064278548 after 6546 iter, 360 nodes (gap 6.0%) Improved solution 373.064304598 after 6634 iter, 380 nodes (gap 6.0%) Improved solution 373.064330648 after 6737 iter, 402 nodes (gap 6.0%) Improved solution 373.064356694 after 7001 iter, 464 nodes (gap 6.0%) Improved solution 373.06438274 after 7265 iter, 526 nodes (gap 6.0%) Improved solution 373.064382742 after 7622 iter, 634 nodes (gap 6.0%) Improved solution 373.064408788 after 7728 iter, 686 nodes (gap 6.0%) Improved solution 373.064434834 after 8326 iter, 902 nodes (gap 6.0%) Improved solution 373.06446088 after 8932 iter, 1118 nodes (gap 6.0%) Improved solution 373.064486926 after 9529 iter, 1334 nodes (gap 6.0%) Improved solution 373.064512968 after 11193 iter, 1874 nodes (gap 6.0%) Improved solution 373.06451297 after 18074 iter, 4042 nodes (gap 6.0%) Improved solution 373.064539012 after 18524 iter, 4242 nodes (gap 6.0%) Improved solution 373.064565054 after 28403 iter, 7574 nodes (gap 6.0%) Improved solution 373.064591096 after 38361 iter, 10938 nodes (gap 6.0%) Improved solution 373.064617136 after 62456 iter, 19294 nodes (gap 6.0%) Improved solution 373.064643174 after 86427 iter, 27770 nodes (gap 6.0%) Improved solution 373.064643178 after 97135 iter, 31668 nodes (gap 6.0%) Improved solution 373.064669216 after 121106 iter, 40144 nodes (gap 6.0%) Improved solution 373.06466922 after 131814 iter, 44042 nodes (gap 6.0%) Improved solution 373.064695258 after 155785 iter, 52518 nodes (gap 6.0%) Improved solution 373.064695262 after 166491 iter, 56416 nodes (gap 6.0%) Improved solution 373.0647213 after 190462 iter, 64892 nodes (gap 6.0%) Improved solution 373.064721304 after 201170 iter, 68790 nodes (gap 6.0%) Improved solution 373.064747342 after 225141 iter, 77266 nodes (gap 6.0%) Improved solution 373.064747346 after 234888 iter, 80876 nodes (gap 6.0%) Improved solution 373.064773384 after 241346 iter, 83456 nodes (gap 6.0%) Improved solution 373.064799422 after 280217 iter, 99426 nodes (gap 6.0%) Improved solution 373.06482546 after 319724 iter, 115714 nodes (gap 6.0%) Improved solution 387.10507009 after 362428 iter, 132842 nodes (gap 2.5%) Improved solution 387.10509615 after 362453 iter, 132848 nodes (gap 2.5%) Improved solution 387.105122206 after 362526 iter, 132866 nodes (gap 2.5%) Improved solution 387.10514826 after 362625 iter, 132894 nodes (gap 2.5%) Improved solution 387.105174314 after 362856 iter, 132962 nodes (gap 2.5%) Improved solution 387.105200368 after 363096 iter, 133030 nodes (gap 2.5%) Improved solution 387.105226422 after 363333 iter, 133098 nodes (gap 2.5%) Improved solution 387.105252476 after 363555 iter, 133166 nodes (gap 2.5%) Improved solution 387.105278528 after 363790 iter, 133236 nodes (gap 2.5%) Improved solution 387.10527853 after 363980 iter, 133292 nodes (gap 2.5%) Improved solution 387.105304578 after 364223 iter, 133374 nodes (gap 2.5%) Improved solution 387.105304582 after 364413 iter, 133430 nodes (gap 2.5%) Improved solution 387.105330628 after 364655 iter, 133512 nodes (gap 2.5%) Improved solution 387.105330632 after 364845 iter, 133568 nodes (gap 2.5%) Improved solution 387.105356678 after 365115 iter, 133662 nodes (gap 2.5%) Improved solution 387.10535668 after 365581 iter, 133794 nodes (gap 2.5%) Improved solution 387.105382726 after 365864 iter, 133894 nodes (gap 2.5%) Improved solution 387.105408772 after 366558 iter, 134116 nodes (gap 2.5%) Improved solution 387.105434818 after 367252 iter, 134338 nodes (gap 2.5%) Improved solution 387.105460864 after 367995 iter, 134566 nodes (gap 2.5%) Improved solution 387.105460866 after 370544 iter, 135400 nodes (gap 2.5%) Improved solution 387.105486912 after 371303 iter, 135656 nodes (gap 2.5%) Improved solution 387.105486914 after 374283 iter, 136696 nodes (gap 2.5%) Improved solution 387.105512958 after 375354 iter, 137080 nodes (gap 2.5%) Improved solution 387.105539002 after 410261 iter, 150506 nodes (gap 2.5%) Improved solution 387.105565044 after 462359 iter, 171028 nodes (gap 2.5%) Improved solution 387.105591086 after 515625 iter, 192036 nodes (gap 2.5%) Improved solution 387.105617126 after 632897 iter, 238348 nodes (gap 2.5%) Improved solution 387.105643164 after 751938 iter, 285618 nodes (gap 2.5%) Improved solution 387.10564317 after 804700 iter, 308162 nodes (gap 2.5%) Improved solution 387.105669208 after 936646 iter, 363306 nodes (gap 2.5%) Improved solution 387.105669212 after 992032 iter, 387160 nodes (gap 2.5%) Improved solution 387.10569525 after 1125082 iter, 442934 nodes (gap 2.5%) Improved solution 387.105695254 after 1180621 iter, 466848 nodes (gap 2.5%) Improved solution 387.105721292 after 1313681 iter, 522630 nodes (gap 2.5%) Improved solution 387.105721296 after 1369342 iter, 546694 nodes (gap 2.5%) Improved solution 387.105747334 after 1502734 iter, 603002 nodes (gap 2.5%) Improved solution 387.105747338 after 1563979 iter, 629640 nodes (gap 2.5%) Improved solution 387.105773376 after 1626211 iter, 658266 nodes (gap 2.5%) lp_solve optimization was stopped due to time-out. Optimal solution 387.105773376 after 1743530 iter, 709104 nodes (gap 2.5%). Excellent numeric accuracy ||*|| = 7.10543e-15 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 1743530, 131387 (7.5%) were bound flips. There were 354463 refactorizations, 0 triggered by time and 5 by density. ... on average 4.5 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 9454 NZ entries, 1.0x largest basis. The maximum B&B level was 294, 0.3x MIP order, 253 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.167 seconds, presolve used 0.036 seconds, ... 7199.969 seconds in simplex solver, in total 7200.172 seconds. Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3242 constraints, 5231 variables, 13493 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 1468 iter is B&B base. Feasible solution 0 after 1468 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1468 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 1468, 0 (0.0%) were bound flips. There were 7 refactorizations, 0 triggered by time and 0 by density. ... on average 209.7 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 5745 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 64, with a dynamic range of 64000. Time to load data was 0.050 seconds, presolve used 0.030 seconds, ... 4.246 seconds in simplex solver, in total 4.326 seconds. Vehicle Type: 0 Num:105 Trip segments:496