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 19229 iter. Relaxed solution 393.564833133 after 21996 iter is B&B base. Feasible solution 393.518740003 after 22556 iter, 62 nodes (gap 0.0%) Improved solution 393.518743614 after 22816 iter, 127 nodes (gap 0.0%) Improved solution 393.518744512 after 23549 iter, 312 nodes (gap 0.0%) Improved solution 393.518745421 after 26044 iter, 822 nodes (gap 0.0%) Improved solution 393.518749032 after 26457 iter, 925 nodes (gap 0.0%) Improved solution 393.51874993 after 27221 iter, 1118 nodes (gap 0.0%) Improved solution 393.518750839 after 29712 iter, 1634 nodes (gap 0.0%) Improved solution 393.51875445 after 30122 iter, 1737 nodes (gap 0.0%) Improved solution 393.518755348 after 30858 iter, 1930 nodes (gap 0.0%) Improved solution 393.518756257 after 33255 iter, 2446 nodes (gap 0.0%) Improved solution 393.518759868 after 33671 iter, 2549 nodes (gap 0.0%) Improved solution 393.518760766 after 34415 iter, 2742 nodes (gap 0.0%) Improved solution 393.518760772 after 37778 iter, 3501 nodes (gap 0.0%) Improved solution 393.518762579 after 49977 iter, 6293 nodes (gap 0.0%) Improved solution 393.51876258 after 51031 iter, 6505 nodes (gap 0.0%) Improved solution 393.51876619 after 51352 iter, 6591 nodes (gap 0.0%) Improved solution 393.518767091 after 109832 iter, 21766 nodes (gap 0.0%) lp_solve optimization was stopped due to time-out. Optimal solution 393.518767091 after 246403 iter, 58218 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 246403, 20015 (8.1%) were bound flips. There were 29173 refactorizations, 0 triggered by time and 0 by density. ... on average 7.8 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 58267 NZ entries, 1.0x largest basis. The maximum B&B level was 89, 0.0x MIP order, 70 at the optimal solution. The constraint matrix inf-norm is 8, with a dynamic range of 8000. Time to load data was 0.334 seconds, presolve used 0.196 seconds, ... 7199.826 seconds in simplex solver, in total 7200.356 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 1308 iter. Relaxed solution 0 after 10600 iter is B&B base. Feasible solution 0 after 10600 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 10600 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 10600, 0 (0.0%) were bound flips. There were 45 refactorizations, 0 triggered by time and 0 by density. ... on average 235.6 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 45178 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.305 seconds, presolve used 0.192 seconds, ... 265.637 seconds in simplex solver, in total 266.134 seconds. Vehicle Type: 0 Num:76 Trip segments:258