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 3538 iter. Relaxed solution 26.3339841483 after 4152 iter is B&B base. Feasible solution 26.269747244 after 5450 iter, 239 nodes (gap 0.2%) Improved solution 26.269773294 after 5456 iter, 243 nodes (gap 0.2%) Improved solution 26.269799344 after 5462 iter, 247 nodes (gap 0.2%) Improved solution 26.269825394 after 5468 iter, 251 nodes (gap 0.2%) Improved solution 26.270747244 after 5572 iter, 259 nodes (gap 0.2%) Improved solution 26.270773294 after 5578 iter, 263 nodes (gap 0.2%) Improved solution 26.270799344 after 5584 iter, 267 nodes (gap 0.2%) Improved solution 26.270825394 after 5590 iter, 271 nodes (gap 0.2%) Improved solution 26.270851444 after 5596 iter, 275 nodes (gap 0.2%) Improved solution 26.27087749 after 5649 iter, 289 nodes (gap 0.2%) Improved solution 26.270903536 after 5702 iter, 303 nodes (gap 0.2%) Improved solution 26.270929582 after 5755 iter, 317 nodes (gap 0.2%) Improved solution 26.27095562 after 5856 iter, 349 nodes (gap 0.2%) Improved solution 26.270981658 after 5957 iter, 381 nodes (gap 0.2%) Improved solution 26.270981662 after 6050 iter, 409 nodes (gap 0.2%) Improved solution 26.2710077 after 6145 iter, 441 nodes (gap 0.2%) Improved solution 26.271007704 after 6238 iter, 469 nodes (gap 0.2%) Improved solution 26.271033742 after 6333 iter, 501 nodes (gap 0.2%) Improved solution 26.271033746 after 6426 iter, 529 nodes (gap 0.2%) Improved solution 26.271059784 after 6521 iter, 561 nodes (gap 0.2%) Improved solution 26.271059788 after 6614 iter, 589 nodes (gap 0.2%) Improved solution 26.271085826 after 6723 iter, 627 nodes (gap 0.2%) Improved solution 26.271085828 after 7103 iter, 753 nodes (gap 0.2%) Improved solution 26.271111866 after 7214 iter, 791 nodes (gap 0.2%) Improved solution 26.271111868 after 7705 iter, 959 nodes (gap 0.2%) Improved solution 26.271137906 after 7816 iter, 997 nodes (gap 0.2%) Improved solution 26.271137908 after 8307 iter, 1165 nodes (gap 0.2%) Improved solution 26.271163946 after 8418 iter, 1203 nodes (gap 0.2%) Improved solution 26.271189984 after 9028 iter, 1411 nodes (gap 0.2%) Improved solution 26.271216018 after 9857 iter, 1709 nodes (gap 0.2%) Improved solution 26.271242052 after 10703 iter, 2021 nodes (gap 0.2%) Improved solution 26.271242056 after 11105 iter, 2185 nodes (gap 0.2%) Improved solution 26.27126809 after 11923 iter, 2499 nodes (gap 0.2%) Improved solution 26.271268094 after 12325 iter, 2663 nodes (gap 0.2%) Improved solution 26.271294128 after 13143 iter, 2977 nodes (gap 0.2%) Improved solution 26.271294132 after 13545 iter, 3141 nodes (gap 0.2%) Improved solution 26.271320166 after 14363 iter, 3455 nodes (gap 0.2%) Improved solution 26.27132017 after 18147 iter, 4879 nodes (gap 0.2%) Improved solution 26.271346204 after 18957 iter, 5193 nodes (gap 0.2%) Improved solution 26.271346206 after 28780 iter, 8937 nodes (gap 0.2%) Improved solution 26.27137224 after 29586 iter, 9251 nodes (gap 0.2%) Improved solution 26.271372242 after 40244 iter, 13359 nodes (gap 0.2%) Improved solution 26.271398276 after 41050 iter, 13673 nodes (gap 0.2%) Improved solution 26.271398278 after 51983 iter, 17817 nodes (gap 0.2%) Improved solution 26.271424312 after 52821 iter, 18133 nodes (gap 0.2%) Improved solution 26.271450346 after 65538 iter, 23067 nodes (gap 0.2%) Improved solution 26.271476378 after 91254 iter, 33373 nodes (gap 0.2%) Improved solution 26.271502408 after 117524 iter, 44011 nodes (gap 0.2%) Improved solution 26.271528436 after 678724 iter, 255565 nodes (gap 0.2%) Improved solution 26.271554464 after 1328466 iter, 501279 nodes (gap 0.2%) lp_solve optimization was stopped due to time-out. Optimal solution 26.271554464 after 1653866 iter, 617333 nodes (gap 0.2%). 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 1653866, 194917 (11.8%) were bound flips. There were 308601 refactorizations, 0 triggered by time and 4 by density. ... on average 4.7 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 8918 NZ entries, 1.0x largest basis. The maximum B&B level was 242, 0.3x MIP order, 190 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.052 seconds, presolve used 0.029 seconds, ... 7199.978 seconds in simplex solver, in total 7200.059 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.053 seconds, presolve used 0.029 seconds, ... 4.312 seconds in simplex solver, in total 4.394 seconds. Vehicle Type: 0 Num:97 Trip segments:376