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 3638 iter. Relaxed solution 24.281978313 after 4151 iter is B&B base. Feasible solution 23.22374987 after 5183 iter, 131 nodes (gap 4.2%) Improved solution 23.223753524 after 5273 iter, 143 nodes (gap 4.2%) Improved solution 23.223757178 after 5368 iter, 157 nodes (gap 4.2%) Improved solution 23.223760826 after 5649 iter, 208 nodes (gap 4.2%) Improved solution 23.223760828 after 5750 iter, 230 nodes (gap 4.2%) Improved solution 23.223764476 after 5955 iter, 272 nodes (gap 4.2%) Improved solution 23.223764478 after 6114 iter, 314 nodes (gap 4.2%) Improved solution 23.223768124 after 6319 iter, 356 nodes (gap 4.2%) Improved solution 23.22377177 after 7053 iter, 543 nodes (gap 4.2%) Improved solution 23.223775416 after 7609 iter, 697 nodes (gap 4.2%) Improved solution 23.223775418 after 8197 iter, 845 nodes (gap 4.2%) Improved solution 23.22377906 after 8565 iter, 941 nodes (gap 4.2%) Improved solution 23.2237827 after 9989 iter, 1341 nodes (gap 4.2%) Improved solution 23.22776083 after 12610 iter, 2033 nodes (gap 4.2%) Improved solution 23.22776448 after 12686 iter, 2044 nodes (gap 4.2%) Improved solution 23.22776813 after 12768 iter, 2058 nodes (gap 4.2%) Improved solution 23.227771776 after 12932 iter, 2083 nodes (gap 4.2%) Improved solution 23.227775422 after 13064 iter, 2117 nodes (gap 4.2%) Improved solution 23.227779064 after 13433 iter, 2213 nodes (gap 4.2%) Improved solution 23.227779066 after 14198 iter, 2391 nodes (gap 4.2%) Improved solution 23.227782708 after 14573 iter, 2487 nodes (gap 4.2%) Improved solution 23.227786348 after 15723 iter, 2829 nodes (gap 4.2%) Improved solution 23.22778635 after 18775 iter, 3655 nodes (gap 4.2%) Improved solution 23.22778999 after 19970 iter, 3985 nodes (gap 4.2%) Improved solution 23.227793628 after 29175 iter, 6567 nodes (gap 4.2%) Improved solution 23.227797266 after 33233 iter, 7779 nodes (gap 4.2%) Improved solution 23.2278009 after 39322 iter, 9565 nodes (gap 4.2%) Improved solution 23.230764486 after 52205 iter, 13339 nodes (gap 4.2%) Improved solution 23.230768132 after 52257 iter, 13349 nodes (gap 4.2%) Improved solution 23.230771778 after 52307 iter, 13361 nodes (gap 4.2%) Improved solution 23.23077542 after 52433 iter, 13388 nodes (gap 4.2%) Improved solution 23.230775426 after 52583 iter, 13421 nodes (gap 4.2%) Improved solution 23.230779068 after 52708 iter, 13443 nodes (gap 4.2%) Improved solution 23.23077907 after 52856 iter, 13473 nodes (gap 4.2%) Improved solution 23.230782712 after 52981 iter, 13495 nodes (gap 4.2%) Improved solution 23.230786352 after 53507 iter, 13645 nodes (gap 4.2%) Improved solution 23.230786354 after 54571 iter, 13914 nodes (gap 4.2%) Improved solution 23.230789994 after 55105 iter, 14070 nodes (gap 4.2%) Improved solution 23.230793632 after 65831 iter, 16896 nodes (gap 4.2%) Improved solution 23.23079727 after 75332 iter, 19382 nodes (gap 4.2%) Improved solution 23.230800904 after 96633 iter, 24876 nodes (gap 4.2%) Improved solution 23.230800906 after 124514 iter, 32262 nodes (gap 4.2%) Improved solution 23.230804538 after 157994 iter, 40840 nodes (gap 4.2%) Improved solution 23.23080454 after 190838 iter, 49426 nodes (gap 4.2%) Improved solution 23.23080817 after 212486 iter, 55312 nodes (gap 4.2%) Improved solution 23.232753568 after 300270 iter, 80722 nodes (gap 4.2%) Improved solution 23.232757218 after 300293 iter, 80728 nodes (gap 4.2%) Improved solution 23.232760866 after 300336 iter, 80736 nodes (gap 4.2%) Improved solution 23.232764512 after 300453 iter, 80756 nodes (gap 4.2%) Improved solution 23.232768156 after 300557 iter, 80774 nodes (gap 4.2%) Improved solution 23.2327718 after 300807 iter, 80822 nodes (gap 4.2%) Improved solution 23.23277544 after 301225 iter, 80926 nodes (gap 4.2%) Improved solution 24.232713412 after 301851 iter, 80992 nodes (gap 0.2%) Improved solution 24.23271707 after 301898 iter, 81000 nodes (gap 0.2%) Improved solution 24.232720724 after 302003 iter, 81022 nodes (gap 0.2%) Improved solution 24.232724374 after 302199 iter, 81064 nodes (gap 0.2%) Improved solution 24.232724378 after 302290 iter, 81086 nodes (gap 0.2%) Improved solution 24.232728028 after 302486 iter, 81128 nodes (gap 0.2%) Improved solution 24.232728032 after 302580 iter, 81150 nodes (gap 0.2%) Improved solution 24.232731682 after 302776 iter, 81192 nodes (gap 0.2%) Improved solution 24.232731684 after 302940 iter, 81236 nodes (gap 0.2%) Improved solution 24.232735332 after 303329 iter, 81336 nodes (gap 0.2%) Improved solution 24.232735336 after 303487 iter, 81380 nodes (gap 0.2%) Improved solution 24.232738982 after 303838 iter, 81478 nodes (gap 0.2%) Improved solution 24.232738984 after 304188 iter, 81580 nodes (gap 0.2%) Improved solution 24.23274263 after 304540 iter, 81678 nodes (gap 0.2%) Improved solution 24.232746274 after 305367 iter, 81970 nodes (gap 0.2%) Improved solution 24.232749916 after 306219 iter, 82272 nodes (gap 0.2%) Improved solution 24.23274992 after 306861 iter, 82490 nodes (gap 0.2%) Improved solution 24.232753562 after 307724 iter, 82792 nodes (gap 0.2%) Improved solution 24.232753566 after 308360 iter, 83010 nodes (gap 0.2%) Improved solution 24.232757208 after 309235 iter, 83312 nodes (gap 0.2%) Improved solution 24.232757212 after 310541 iter, 83743 nodes (gap 0.2%) Improved solution 24.232760854 after 311491 iter, 84057 nodes (gap 0.2%) Improved solution 24.232760856 after 313650 iter, 84723 nodes (gap 0.2%) Improved solution 24.232764498 after 314616 iter, 85039 nodes (gap 0.2%) Improved solution 24.232768136 after 319513 iter, 86611 nodes (gap 0.2%) Improved solution 24.23276814 after 322985 iter, 87567 nodes (gap 0.2%) Improved solution 24.232771778 after 327913 iter, 89215 nodes (gap 0.2%) Improved solution 24.232771782 after 335008 iter, 91358 nodes (gap 0.2%) Improved solution 24.23277542 after 339889 iter, 93018 nodes (gap 0.2%) Improved solution 24.232775424 after 348033 iter, 95616 nodes (gap 0.2%) Improved solution 24.232779062 after 350685 iter, 96676 nodes (gap 0.2%) Improved solution 24.232779064 after 362470 iter, 100452 nodes (gap 0.2%) Improved solution 24.232782702 after 365150 iter, 101536 nodes (gap 0.2%) Improved solution 24.232782704 after 386061 iter, 106840 nodes (gap 0.2%) Improved solution 24.23278634 after 414616 iter, 115746 nodes (gap 0.2%) Improved solution 24.232786342 after 461881 iter, 127716 nodes (gap 0.2%) Improved solution 24.232789978 after 490516 iter, 136730 nodes (gap 0.2%) Improved solution 24.23278998 after 580854 iter, 153846 nodes (gap 0.2%) Improved solution 24.232793616 after 609881 iter, 162564 nodes (gap 0.2%) Improved solution 24.23279725 after 1048877 iter, 227128 nodes (gap 0.2%) lp_solve optimization was stopped due to time-out. Optimal solution 24.23279725 after 2463284 iter, 407840 nodes (gap 0.2%). Excellent numeric accuracy ||*|| = 3.55271e-15 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 2463284, 179849 (7.3%) were bound flips. There were 203895 refactorizations, 0 triggered by time and 8 by density. ... on average 11.2 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 8938 NZ entries, 1.0x largest basis. The maximum B&B level was 156, 0.2x MIP order, 131 at the optimal solution. The constraint matrix inf-norm is 8, with a dynamic range of 8000. Time to load data was 0.052 seconds, presolve used 0.036 seconds, ... 7200.040 seconds in simplex solver, in total 7200.128 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 283 iter. Relaxed solution 0 after 1749 iter is B&B base. Feasible solution 0 after 1749 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1749 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 1749, 0 (0.0%) were bound flips. There were 9 refactorizations, 0 triggered by time and 0 by density. ... on average 194.3 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 6661 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.050 seconds, presolve used 0.032 seconds, ... 5.553 seconds in simplex solver, in total 5.635 seconds. Vehicle Type: 0 Num:43 Trip segments:224