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 4865 iter. Relaxed solution 777.243685725 after 6793 iter is B&B base. Feasible solution 776.86032818 after 9772 iter, 191 nodes (gap 0.0%) Improved solution 776.86033184 after 9819 iter, 203 nodes (gap 0.0%) Improved solution 776.860335498 after 9895 iter, 217 nodes (gap 0.0%) Improved solution 776.860339156 after 9953 iter, 231 nodes (gap 0.0%) Improved solution 776.876317196 after 10127 iter, 248 nodes (gap 0.0%) Improved solution 776.876317198 after 10216 iter, 260 nodes (gap 0.0%) Improved solution 776.876320858 after 10260 iter, 272 nodes (gap 0.0%) Improved solution 776.876320862 after 10338 iter, 284 nodes (gap 0.0%) Improved solution 776.87632452 after 10392 iter, 298 nodes (gap 0.0%) Improved solution 776.876328178 after 10585 iter, 334 nodes (gap 0.0%) Improved solution 776.876331836 after 11035 iter, 424 nodes (gap 0.0%) Improved solution 776.876335494 after 11497 iter, 516 nodes (gap 0.0%) Improved solution 776.876339152 after 11960 iter, 608 nodes (gap 0.0%) Improved solution 776.876339154 after 12153 iter, 652 nodes (gap 0.0%) Improved solution 776.876342812 after 12612 iter, 744 nodes (gap 0.0%) Improved solution 776.87634647 after 12951 iter, 824 nodes (gap 0.0%) Improved solution 776.876350126 after 13906 iter, 1104 nodes (gap 0.0%) Improved solution 776.87635378 after 17707 iter, 2154 nodes (gap 0.0%) Improved solution 776.876353782 after 18295 iter, 2322 nodes (gap 0.0%) Improved solution 776.876357436 after 19189 iter, 2594 nodes (gap 0.0%) Improved solution 776.890317186 after 19597 iter, 2628 nodes (gap 0.0%) Improved solution 776.890320846 after 19719 iter, 2654 nodes (gap 0.0%) Improved solution 776.890324504 after 19843 iter, 2680 nodes (gap 0.0%) Improved solution 776.890328162 after 19967 iter, 2706 nodes (gap 0.0%) Improved solution 776.89033182 after 20091 iter, 2732 nodes (gap 0.0%) Improved solution 776.890331826 after 20132 iter, 2736 nodes (gap 0.0%) Improved solution 776.890335484 after 20165 iter, 2744 nodes (gap 0.0%) Improved solution 776.890335488 after 20232 iter, 2760 nodes (gap 0.0%) Improved solution 776.890339146 after 20265 iter, 2768 nodes (gap 0.0%) Improved solution 776.89033915 after 20332 iter, 2784 nodes (gap 0.0%) Improved solution 776.890342808 after 20365 iter, 2792 nodes (gap 0.0%) Improved solution 776.890342812 after 20431 iter, 2808 nodes (gap 0.0%) Improved solution 776.89034647 after 20464 iter, 2816 nodes (gap 0.0%) Improved solution 776.890350124 after 21222 iter, 3028 nodes (gap 0.0%) Improved solution 776.89035013 after 21341 iter, 3050 nodes (gap 0.0%) Improved solution 776.890353784 after 21688 iter, 3140 nodes (gap 0.0%) Improved solution 776.89035379 after 21964 iter, 3222 nodes (gap 0.0%) Improved solution 776.890357444 after 22100 iter, 3264 nodes (gap 0.0%) Improved solution 776.890357446 after 22350 iter, 3338 nodes (gap 0.0%) Improved solution 776.8903611 after 22487 iter, 3384 nodes (gap 0.0%) Improved solution 776.896317188 after 22814 iter, 3413 nodes (gap 0.0%) Improved solution 776.896320848 after 22861 iter, 3425 nodes (gap 0.0%) Improved solution 776.896324506 after 22894 iter, 3433 nodes (gap 0.0%) Improved solution 776.896328164 after 22927 iter, 3441 nodes (gap 0.0%) Improved solution 776.896331822 after 22960 iter, 3449 nodes (gap 0.0%) Improved solution 776.896331826 after 23044 iter, 3467 nodes (gap 0.0%) Improved solution 776.896335484 after 23077 iter, 3475 nodes (gap 0.0%) Improved solution 776.896335488 after 23161 iter, 3493 nodes (gap 0.0%) Improved solution 776.896339146 after 23194 iter, 3501 nodes (gap 0.0%) Improved solution 776.89633915 after 23278 iter, 3519 nodes (gap 0.0%) Improved solution 776.896342808 after 23311 iter, 3527 nodes (gap 0.0%) Improved solution 776.896342812 after 23396 iter, 3545 nodes (gap 0.0%) Improved solution 776.89634647 after 23429 iter, 3553 nodes (gap 0.0%) Improved solution 776.896350124 after 24030 iter, 3677 nodes (gap 0.0%) Improved solution 776.89635013 after 24570 iter, 3775 nodes (gap 0.0%) Improved solution 776.896353784 after 25260 iter, 3915 nodes (gap 0.0%) Improved solution 776.896353788 after 25753 iter, 4013 nodes (gap 0.0%) Improved solution 776.896357442 after 26309 iter, 4155 nodes (gap 0.0%) Improved solution 776.896357446 after 27139 iter, 4426 nodes (gap 0.0%) Improved solution 776.8963611 after 27318 iter, 4476 nodes (gap 0.0%) Improved solution 776.896364754 after 28686 iter, 4894 nodes (gap 0.0%) Improved solution 776.896368408 after 30060 iter, 5312 nodes (gap 0.0%) Improved solution 776.89637206 after 32102 iter, 5938 nodes (gap 0.0%) Improved solution 776.896375708 after 34813 iter, 6771 nodes (gap 0.0%) Improved solution 776.89637571 after 34845 iter, 6778 nodes (gap 0.0%) Improved solution 776.900331838 after 35616 iter, 6914 nodes (gap 0.0%) Improved solution 776.900335498 after 35668 iter, 6928 nodes (gap 0.0%) Improved solution 776.900339156 after 35699 iter, 6936 nodes (gap 0.0%) Improved solution 776.900342814 after 35730 iter, 6944 nodes (gap 0.0%) Improved solution 776.900346472 after 35763 iter, 6952 nodes (gap 0.0%) Improved solution 776.900350126 after 36277 iter, 7090 nodes (gap 0.0%) Improved solution 776.900350132 after 36379 iter, 7110 nodes (gap 0.0%) Improved solution 776.900353786 after 36832 iter, 7212 nodes (gap 0.0%) Improved solution 776.90035379 after 37184 iter, 7288 nodes (gap 0.0%) Improved solution 776.900357444 after 37600 iter, 7390 nodes (gap 0.0%) Improved solution 776.900357448 after 38333 iter, 7628 nodes (gap 0.0%) Improved solution 776.900361102 after 38405 iter, 7652 nodes (gap 0.0%) Improved solution 776.900364756 after 39500 iter, 8000 nodes (gap 0.0%) Improved solution 776.90036841 after 40594 iter, 8348 nodes (gap 0.0%) Improved solution 776.900372062 after 42292 iter, 8906 nodes (gap 0.0%) Improved solution 776.90037571 after 44576 iter, 9657 nodes (gap 0.0%) Improved solution 776.900375712 after 44583 iter, 9660 nodes (gap 0.0%) Improved solution 776.900375716 after 47192 iter, 10501 nodes (gap 0.0%) Improved solution 776.900379364 after 47713 iter, 10698 nodes (gap 0.0%) Improved solution 776.900379366 after 47720 iter, 10701 nodes (gap 0.0%) Improved solution 776.900383014 after 52432 iter, 12116 nodes (gap 0.0%) Improved solution 776.900383016 after 52439 iter, 12119 nodes (gap 0.0%) Improved solution 776.900386662 after 62031 iter, 14690 nodes (gap 0.0%) Improved solution 776.900386664 after 62036 iter, 14693 nodes (gap 0.0%) Improved solution 776.900390308 after 90288 iter, 20430 nodes (gap 0.0%) Improved solution 776.90039031 after 90293 iter, 20433 nodes (gap 0.0%) Improved solution 776.900390314 after 103325 iter, 23021 nodes (gap 0.0%) Improved solution 776.900390316 after 103332 iter, 23024 nodes (gap 0.0%) Improved solution 776.90039396 after 139216 iter, 30739 nodes (gap 0.0%) Improved solution 776.900393962 after 139223 iter, 30742 nodes (gap 0.0%) Improved solution 776.900393964 after 213049 iter, 44481 nodes (gap 0.0%) Improved solution 776.900393966 after 213056 iter, 44484 nodes (gap 0.0%) Improved solution 776.90039761 after 250160 iter, 52431 nodes (gap 0.0%) Improved solution 776.900397612 after 250167 iter, 52434 nodes (gap 0.0%) lp_solve optimization was stopped due to time-out. Optimal solution 776.900397612 after 2430118 iter, 467114 nodes (gap 0.0%). Excellent numeric accuracy ||*|| = 3.73035e-14 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 2430118, 240432 (9.9%) were bound flips. There were 233525 refactorizations, 0 triggered by time and 13 by density. ... on average 9.4 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 10470 NZ entries, 1.1x largest basis. The maximum B&B level was 204, 0.2x MIP order, 162 at the optimal solution. The constraint matrix inf-norm is 8, with a dynamic range of 8000. Time to load data was 0.053 seconds, presolve used 0.030 seconds, ... 7199.979 seconds in simplex solver, in total 7200.062 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 403 iter. Relaxed solution 0 after 1871 iter is B&B base. Feasible solution 0 after 1871 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1871 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 1871, 0 (0.0%) were bound flips. There were 9 refactorizations, 0 triggered by time and 0 by density. ... on average 207.9 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 7244 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.060 seconds, presolve used 0.030 seconds, ... 5.135 seconds in simplex solver, in total 5.225 seconds. Vehicle Type: 0 Num:95 Trip segments:664