Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 20672 constraints, 24621 variables, 73163 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 18390 iter. Relaxed solution 775.970709821 after 20306 iter is B&B base. Feasible solution 775.705640832 after 20768 iter, 58 nodes (gap 0.0%) Improved solution 775.705673353 after 20994 iter, 93 nodes (gap 0.0%) Improved solution 775.705679855 after 21147 iter, 114 nodes (gap 0.0%) Improved solution 775.70571238 after 22062 iter, 285 nodes (gap 0.0%) Improved solution 775.705751404 after 26454 iter, 1193 nodes (gap 0.0%) Improved solution 775.705770916 after 28367 iter, 1628 nodes (gap 0.0%) Improved solution 775.705809937 after 33462 iter, 2800 nodes (gap 0.0%) Improved solution 775.705829449 after 35668 iter, 3255 nodes (gap 0.0%) Improved solution 775.705848958 after 39472 iter, 4084 nodes (gap 0.0%) Improved solution 775.705855458 after 40506 iter, 4311 nodes (gap 0.0%) Improved solution 775.705874968 after 47461 iter, 6090 nodes (gap 0.0%) Improved solution 775.705881477 after 68796 iter, 12370 nodes (gap 0.0%) Improved solution 775.705907486 after 74829 iter, 13771 nodes (gap 0.0%) Improved solution 775.705926995 after 79838 iter, 15013 nodes (gap 0.0%) Improved solution 775.705933496 after 81999 iter, 15443 nodes (gap 0.0%) Improved solution 775.705946502 after 92456 iter, 17892 nodes (gap 0.0%) lp_solve optimization was stopped due to time-out. Optimal solution 775.705946502 after 279250 iter, 62823 nodes (gap 0.0%). 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 279250, 20833 (7.5%) were bound flips. There were 31475 refactorizations, 0 triggered by time and 0 by density. ... on average 8.2 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 57936 NZ entries, 1.0x largest basis. The maximum B&B level was 84, 0.0x MIP order, 51 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.315 seconds, presolve used 0.193 seconds, ... 7199.825 seconds in simplex solver, in total 7200.333 seconds. Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 20672 constraints, 24621 variables, 73163 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 9294 iter is B&B base. Feasible solution 0 after 9294 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 9294 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 9294, 0 (0.0%) were bound flips. There were 39 refactorizations, 0 triggered by time and 0 by density. ... on average 238.3 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 39176 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.304 seconds, presolve used 0.190 seconds, ... 227.181 seconds in simplex solver, in total 227.675 seconds. Vehicle Type: 0 Num:43 Trip segments:162