Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 7646 constraints, 11381 variables, 32033 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 7281 iter. Relaxed solution 24.2319927428 after 8233 iter is B&B base. Feasible solution 24.230942062 after 8394 iter, 33 nodes (gap 0.0%) Improved solution 24.230967865 after 8400 iter, 36 nodes (gap 0.0%) Improved solution 24.230980771 after 8627 iter, 93 nodes (gap 0.0%) Improved solution 24.231006574 after 8724 iter, 130 nodes (gap 0.0%) Improved solution 24.231019474 after 9746 iter, 462 nodes (gap 0.0%) Improved solution 24.231032377 after 10593 iter, 727 nodes (gap 0.0%) Improved solution 24.23105818 after 10690 iter, 764 nodes (gap 0.0%) Improved solution 24.23107108 after 12419 iter, 1360 nodes (gap 0.0%) Improved solution 24.231083983 after 13291 iter, 1633 nodes (gap 0.0%) Improved solution 24.231109786 after 13388 iter, 1670 nodes (gap 0.0%) Improved solution 24.231122686 after 15187 iter, 2296 nodes (gap 0.0%) Improved solution 24.231135589 after 16059 iter, 2571 nodes (gap 0.0%) Improved solution 24.231161392 after 16152 iter, 2608 nodes (gap 0.0%) Improved solution 24.231174292 after 16956 iter, 2881 nodes (gap 0.0%) Improved solution 24.231187195 after 17341 iter, 3004 nodes (gap 0.0%) Improved solution 24.231212998 after 17433 iter, 3041 nodes (gap 0.0%) Improved solution 24.231238801 after 26055 iter, 5680 nodes (gap 0.0%) Optimal solution 24.231238801 after 108908 iter, 31064 nodes (gap 0.0%). Excellent numeric accuracy ||*|| = 8.22909e-17 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 108908, 12591 (11.6%) were bound flips. There were 15568 refactorizations, 0 triggered by time and 0 by density. ... on average 6.2 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 22065 NZ entries, 1.0x largest basis. The maximum B&B level was 42, 0.0x MIP order, 28 at the optimal solution. The constraint matrix inf-norm is 128, with a dynamic range of 128000. Time to load data was 0.181 seconds, presolve used 0.092 seconds, ... 1002.152 seconds in simplex solver, in total 1002.425 seconds. Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 7646 constraints, 11381 variables, 32033 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 3376 iter is B&B base. Feasible solution 0 after 3376 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 3376 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 3376, 0 (0.0%) were bound flips. There were 15 refactorizations, 0 triggered by time and 0 by density. ... on average 225.1 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 14150 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 128, with a dynamic range of 128000. Time to load data was 0.206 seconds, presolve used 0.077 seconds, ... 31.164 seconds in simplex solver, in total 31.447 seconds. Vehicle Type: 0 Num:26 Trip segments:59