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 3675 iter. Relaxed solution 26.307979208 after 4067 iter is B&B base. Feasible solution 24.213847608 after 4781 iter, 78 nodes (gap 7.7%) Improved solution 24.214847608 after 4793 iter, 80 nodes (gap 7.7%) Improved solution 24.214851264 after 4798 iter, 84 nodes (gap 7.7%) Improved solution 26.21984395 after 4923 iter, 93 nodes (gap 0.3%) Improved solution 26.219847608 after 5008 iter, 104 nodes (gap 0.3%) Improved solution 26.219851262 after 5574 iter, 201 nodes (gap 0.3%) Improved solution 26.22084395 after 5872 iter, 246 nodes (gap 0.3%) Improved solution 26.220847608 after 5967 iter, 257 nodes (gap 0.3%) Improved solution 26.220851262 after 6543 iter, 360 nodes (gap 0.3%) Improved solution 26.220851264 after 7410 iter, 532 nodes (gap 0.3%) Improved solution 26.220854918 after 7976 iter, 629 nodes (gap 0.3%) Improved solution 26.22184395 after 8308 iter, 677 nodes (gap 0.3%) Improved solution 26.221847608 after 8397 iter, 688 nodes (gap 0.3%) Improved solution 26.221851262 after 8634 iter, 725 nodes (gap 0.3%) Improved solution 26.221851264 after 8884 iter, 788 nodes (gap 0.3%) Improved solution 26.221854918 after 9121 iter, 825 nodes (gap 0.3%) Improved solution 26.221858568 after 10983 iter, 1189 nodes (gap 0.3%) Improved solution 26.221862212 after 19640 iter, 2887 nodes (gap 0.3%) Improved solution 26.221865854 after 49715 iter, 9243 nodes (gap 0.3%) Improved solution 26.225840298 after 181229 iter, 29708 nodes (gap 0.3%) Improved solution 26.225843954 after 181356 iter, 29724 nodes (gap 0.3%) Improved solution 26.225847606 after 181595 iter, 29764 nodes (gap 0.3%) Improved solution 26.226840298 after 181792 iter, 29789 nodes (gap 0.3%) Improved solution 26.226843954 after 181919 iter, 29805 nodes (gap 0.3%) Improved solution 26.226847606 after 182156 iter, 29845 nodes (gap 0.3%) Improved solution 26.22684761 after 182460 iter, 29916 nodes (gap 0.3%) Improved solution 26.226851262 after 182699 iter, 29956 nodes (gap 0.3%) Improved solution 26.226854906 after 194090 iter, 32254 nodes (gap 0.3%) Improved solution 26.227843954 after 200740 iter, 33575 nodes (gap 0.3%) Improved solution 26.227847612 after 200818 iter, 33587 nodes (gap 0.3%) Improved solution 26.227851256 after 203906 iter, 34215 nodes (gap 0.3%) Improved solution 26.2278549 after 215363 iter, 36660 nodes (gap 0.3%) Improved solution 26.227854906 after 223157 iter, 38198 nodes (gap 0.3%) Improved solution 26.22785855 after 244730 iter, 42576 nodes (gap 0.3%) Improved solution 26.227858552 after 265146 iter, 46595 nodes (gap 0.3%) Improved solution 26.227862196 after 288064 iter, 50909 nodes (gap 0.3%) Improved solution 26.2278622 after 450288 iter, 85135 nodes (gap 0.3%) Improved solution 26.227862202 after 475105 iter, 90251 nodes (gap 0.3%) Improved solution 26.227865844 after 512619 iter, 97555 nodes (gap 0.3%) Improved solution 26.227865848 after 1046077 iter, 216475 nodes (gap 0.3%) Improved solution 26.227869486 after 1168316 iter, 242763 nodes (gap 0.3%) lp_solve optimization was stopped due to time-out. Optimal solution 26.227869486 after 1670047 iter, 356008 nodes (gap 0.3%). 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 1670047, 130840 (7.8%) were bound flips. There were 177995 refactorizations, 0 triggered by time and 5 by density. ... on average 8.6 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 8975 NZ entries, 1.0x largest basis. The maximum B&B level was 98, 0.1x MIP order, 86 at the optimal solution. The constraint matrix inf-norm is 8, with a dynamic range of 8000. Time to load data was 0.054 seconds, presolve used 0.030 seconds, ... 7199.989 seconds in simplex solver, in total 7200.073 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 6674 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.045 seconds, presolve used 0.029 seconds, ... 4.648 seconds in simplex solver, in total 4.722 seconds. Vehicle Type: 0 Num:26 Trip segments:144