Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3524 constraints, 5927 variables, 15923 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 3828 iter. Relaxed solution 22.2079931459 after 4260 iter is B&B base. Feasible solution 22.198529129 after 4822 iter, 53 nodes (gap 0.0%) Improved solution 22.198580745 after 5351 iter, 135 nodes (gap 0.0%) Improved solution 22.198632355 after 8076 iter, 577 nodes (gap 0.0%) Improved solution 22.200477511 after 8461 iter, 623 nodes (gap 0.0%) Improved solution 22.200503322 after 8478 iter, 626 nodes (gap 0.0%) Improved solution 22.200529127 after 8880 iter, 669 nodes (gap 0.0%) Improved solution 22.200554938 after 8899 iter, 674 nodes (gap 0.0%) Improved solution 22.200606554 after 9558 iter, 765 nodes (gap 0.0%) Improved solution 22.200658164 after 10300 iter, 874 nodes (gap 0.0%) Improved solution 22.200709774 after 14281 iter, 1463 nodes (gap 0.0%) Improved solution 22.200761384 after 18219 iter, 2066 nodes (gap 0.0%) Improved solution 22.200812994 after 58141 iter, 8124 nodes (gap 0.0%) Improved solution 22.200812996 after 87769 iter, 12618 nodes (gap 0.0%) Improved solution 22.200812998 after 92308 iter, 13390 nodes (gap 0.0%) Improved solution 22.200838801 after 108079 iter, 15856 nodes (gap 0.0%) Improved solution 22.200864606 after 111261 iter, 16398 nodes (gap 0.0%) Improved solution 22.200864608 after 117474 iter, 17582 nodes (gap 0.0%) Improved solution 22.200890411 after 233812 iter, 37106 nodes (gap 0.0%) Improved solution 22.200916216 after 238535 iter, 38012 nodes (gap 0.0%) Improved solution 22.200916218 after 245421 iter, 39362 nodes (gap 0.0%) Improved solution 22.20091622 after 288264 iter, 47847 nodes (gap 0.0%) Improved solution 22.200942023 after 333811 iter, 57920 nodes (gap 0.0%) Improved solution 22.20096783 after 334136 iter, 57972 nodes (gap 0.0%) Improved solution 22.201529131 after 337860 iter, 58824 nodes (gap 0.0%) Improved solution 22.201529131 after 337888 iter, 58828 nodes (gap 0.0%) Improved solution 22.201580747 after 337915 iter, 58832 nodes (gap 0.0%) Improved solution 22.201632357 after 338124 iter, 58866 nodes (gap 0.0%) Improved solution 22.201683967 after 338553 iter, 58942 nodes (gap 0.0%) Improved solution 22.201709772 after 338719 iter, 58970 nodes (gap 0.0%) Improved solution 22.201735579 after 338988 iter, 59023 nodes (gap 0.0%) Improved solution 22.201761384 after 339346 iter, 59080 nodes (gap 0.0%) Improved solution 22.201787189 after 339715 iter, 59146 nodes (gap 0.0%) Improved solution 22.201787191 after 340911 iter, 59341 nodes (gap 0.0%) Improved solution 22.201812994 after 341123 iter, 59372 nodes (gap 0.0%) Improved solution 22.201838799 after 341637 iter, 59488 nodes (gap 0.0%) Improved solution 22.201838801 after 403288 iter, 67369 nodes (gap 0.0%) Improved solution 22.201864604 after 439069 iter, 72286 nodes (gap 0.0%) Improved solution 22.201890409 after 439652 iter, 72424 nodes (gap 0.0%) Improved solution 22.201890411 after 585422 iter, 91065 nodes (gap 0.0%) Improved solution 22.201890413 after 1097225 iter, 153102 nodes (gap 0.0%) Improved solution 22.201916218 after 1104762 iter, 154071 nodes (gap 0.0%) Improved solution 22.20191622 after 1494636 iter, 199290 nodes (gap 0.0%) lp_solve optimization was stopped due to time-out. Optimal solution 22.20191622 after 2367826 iter, 302193 nodes (gap 0.0%). 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 2367826, 138269 (5.8%) were bound flips. There were 151096 refactorizations, 0 triggered by time and 2 by density. ... on average 14.8 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 10070 NZ entries, 1.0x largest basis. The maximum B&B level was 68, 0.1x MIP order, 54 at the optimal solution. The constraint matrix inf-norm is 128, with a dynamic range of 128000. Time to load data was 0.058 seconds, presolve used 0.034 seconds, ... 7199.971 seconds in simplex solver, in total 7200.063 seconds. Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3524 constraints, 5927 variables, 15923 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 1558 iter is B&B base. Feasible solution 0 after 1558 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1558 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 1558, 0 (0.0%) were bound flips. There were 8 refactorizations, 0 triggered by time and 0 by density. ... on average 194.8 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 6528 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.061 seconds, presolve used 0.034 seconds, ... 5.557 seconds in simplex solver, in total 5.652 seconds. Vehicle Type: 0 Num:36 Trip segments:84