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 3716 iter. Relaxed solution 26.3319854835 after 4089 iter is B&B base. Feasible solution 26.259869856 after 5089 iter, 146 nodes (gap 0.3%) Improved solution 26.25992151 after 5141 iter, 154 nodes (gap 0.3%) Improved solution 26.259973164 after 5192 iter, 162 nodes (gap 0.3%) Improved solution 26.260024814 after 5347 iter, 187 nodes (gap 0.3%) Improved solution 26.26007646 after 5660 iter, 249 nodes (gap 0.3%) Improved solution 26.260076464 after 5746 iter, 271 nodes (gap 0.3%) Improved solution 26.26012811 after 5919 iter, 315 nodes (gap 0.3%) Improved solution 26.260179756 after 6577 iter, 513 nodes (gap 0.3%) Improved solution 26.26017976 after 8454 iter, 1057 nodes (gap 0.3%) Improved solution 26.260231406 after 9112 iter, 1255 nodes (gap 0.3%) Improved solution 26.260283052 after 13907 iter, 2663 nodes (gap 0.3%) Improved solution 26.260334694 after 23213 iter, 5351 nodes (gap 0.3%) Improved solution 26.260334698 after 23985 iter, 5605 nodes (gap 0.3%) Improved solution 26.26038634 after 25444 iter, 6095 nodes (gap 0.3%) Improved solution 26.260386342 after 27196 iter, 6729 nodes (gap 0.3%) Improved solution 26.260437984 after 28233 iter, 7073 nodes (gap 0.3%) Improved solution 26.260489624 after 32496 iter, 8523 nodes (gap 0.3%) Improved solution 26.260489628 after 33816 iter, 8893 nodes (gap 0.3%) Improved solution 26.260541266 after 38368 iter, 10449 nodes (gap 0.3%) Improved solution 26.26054127 after 40069 iter, 10927 nodes (gap 0.3%) Improved solution 26.260592908 after 44621 iter, 12483 nodes (gap 0.3%) Improved solution 26.26059291 after 56192 iter, 16287 nodes (gap 0.3%) Improved solution 26.260644548 after 63352 iter, 18869 nodes (gap 0.3%) Improved solution 26.260696186 after 90978 iter, 28595 nodes (gap 0.3%) Improved solution 26.266128114 after 91280 iter, 28624 nodes (gap 0.2%) Improved solution 26.26617976 after 91313 iter, 28632 nodes (gap 0.2%) Improved solution 26.266179768 after 91420 iter, 28654 nodes (gap 0.2%) Improved solution 26.266231414 after 91453 iter, 28662 nodes (gap 0.2%) Improved solution 26.266231418 after 91547 iter, 28682 nodes (gap 0.2%) Improved solution 26.266283064 after 91580 iter, 28690 nodes (gap 0.2%) Improved solution 26.266334706 after 91756 iter, 28740 nodes (gap 0.2%) Improved solution 26.26633471 after 91958 iter, 28794 nodes (gap 0.2%) Improved solution 26.266386352 after 92142 iter, 28846 nodes (gap 0.2%) Improved solution 26.266386356 after 92419 iter, 28917 nodes (gap 0.2%) Improved solution 26.266437998 after 92577 iter, 28973 nodes (gap 0.2%) Improved solution 26.266489638 after 93489 iter, 29225 nodes (gap 0.2%) Improved solution 26.266489642 after 94327 iter, 29453 nodes (gap 0.2%) Improved solution 26.26654128 after 95391 iter, 29761 nodes (gap 0.2%) Improved solution 26.266541284 after 96311 iter, 30023 nodes (gap 0.2%) Improved solution 26.266592922 after 97374 iter, 30331 nodes (gap 0.2%) Improved solution 26.266592924 after 102859 iter, 32006 nodes (gap 0.2%) Improved solution 26.266644562 after 104251 iter, 32428 nodes (gap 0.2%) Improved solution 26.2666962 after 114996 iter, 35828 nodes (gap 0.2%) Improved solution 26.266696204 after 125436 iter, 39388 nodes (gap 0.2%) Improved solution 26.266747842 after 148425 iter, 47562 nodes (gap 0.2%) Improved solution 26.266747846 after 182197 iter, 60396 nodes (gap 0.2%) Improved solution 26.266799484 after 183797 iter, 61100 nodes (gap 0.2%) Improved solution 26.266851122 after 247839 iter, 87366 nodes (gap 0.2%) Improved solution 26.266902758 after 382532 iter, 142800 nodes (gap 0.2%) Improved solution 26.266954392 after 533960 iter, 206298 nodes (gap 0.2%) lp_solve optimization was stopped due to time-out. Optimal solution 26.266954392 after 1589730 iter, 657498 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 1589730, 156502 (9.8%) were bound flips. There were 328722 refactorizations, 0 triggered by time and 7 by density. ... on average 4.4 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 9168 NZ entries, 1.0x largest basis. The maximum B&B level was 150, 0.2x MIP order, 120 at the optimal solution. The constraint matrix inf-norm is 128, with a dynamic range of 128000. Time to load data was 0.056 seconds, presolve used 0.029 seconds, ... 7199.975 seconds in simplex solver, in total 7200.060 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 ||*|| = 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 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 128, with a dynamic range of 128000. Time to load data was 0.259 seconds, presolve used 0.146 seconds, ... 8.786 seconds in simplex solver, in total 9.191 seconds. Vehicle Type: 0 Num:51 Trip segments:236