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 16691 iter. Relaxed solution 675.566818626 after 18216 iter is B&B base. bfp_factorize: Resolving 1 singularity at refact 81, iter 19648 bfp_factorize: Resolving 1 singularity at refact 99, iter 24125 bfp_factorize: Resolving 1 singularity at refact 182, iter 44674 Feasible solution 604.254823353 after 165258 iter, 73 nodes (gap 10.5%) Improved solution 607.209823353 after 165367 iter, 77 nodes (gap 10.1%) Improved solution 610.774323353 after 166483 iter, 130 nodes (gap 9.6%) Improved solution 610.779323353 after 166486 iter, 132 nodes (gap 9.6%) Improved solution 612.260823353 after 166892 iter, 153 nodes (gap 9.4%) Improved solution 612.265823353 after 166901 iter, 155 nodes (gap 9.4%) Improved solution 612.313825174 after 167094 iter, 172 nodes (gap 9.3%) Improved solution 612.318825174 after 167099 iter, 174 nodes (gap 9.3%) Improved solution 613.749824263 after 167221 iter, 186 nodes (gap 9.1%) Improved solution 614.253824263 after 167222 iter, 187 nodes (gap 9.1%) Improved solution 614.319824263 after 167295 iter, 201 nodes (gap 9.1%) Improved solution 615.316824263 after 167296 iter, 202 nodes (gap 8.9%) Improved solution 617.804823353 after 167459 iter, 213 nodes (gap 8.5%) Improved solution 618.285823353 after 167799 iter, 229 nodes (gap 8.5%) Improved solution 618.297825174 after 168235 iter, 249 nodes (gap 8.5%) Improved solution 619.336824263 after 168609 iter, 279 nodes (gap 8.3%) Improved solution 619.358823353 after 169149 iter, 304 nodes (gap 8.3%) Improved solution 620.299823353 after 171372 iter, 405 nodes (gap 8.2%) Improved solution 624.355824263 after 173708 iter, 530 nodes (gap 7.6%) Improved solution 627.351823352 after 175319 iter, 617 nodes (gap 7.1%) Improved solution 627.366823353 after 180169 iter, 834 nodes (gap 7.1%) Improved solution 628.357822442 after 182492 iter, 929 nodes (gap 7.0%) Improved solution 628.360822442 after 183322 iter, 973 nodes (gap 7.0%) Improved solution 630.342822442 after 185027 iter, 1041 nodes (gap 6.7%) Improved solution 632.348822442 after 186968 iter, 1123 nodes (gap 6.4%) Improved solution 632.362822442 after 188706 iter, 1247 nodes (gap 6.4%) Improved solution 633.359822442 after 193023 iter, 1446 nodes (gap 6.2%) Improved solution 634.416825173 after 205401 iter, 1994 nodes (gap 6.1%) Improved solution 634.420824262 after 212921 iter, 2290 nodes (gap 6.1%) Improved solution 634.428825173 after 218970 iter, 2524 nodes (gap 6.1%) Improved solution 637.365822442 after 256221 iter, 4194 nodes (gap 5.6%) Improved solution 638.389822442 after 259267 iter, 4367 nodes (gap 5.5%) Improved solution 641.385820624 after 275002 iter, 5102 nodes (gap 5.1%) Improved solution 641.393821535 after 285603 iter, 5671 nodes (gap 5.1%) Improved solution 641.406821535 after 304899 iter, 6818 nodes (gap 5.0%) Improved solution 642.403820624 after 305163 iter, 6829 nodes (gap 4.9%) Improved solution 642.403823349 after 309370 iter, 7120 nodes (gap 4.9%) Improved solution 643.370820624 after 316014 iter, 7621 nodes (gap 4.8%) Improved solution 645.395821528 after 362840 iter, 11143 nodes (gap 4.5%) Improved solution 645.405823345 after 371103 iter, 11733 nodes (gap 4.5%) Improved solution 645.41882153 after 384354 iter, 12803 nodes (gap 4.5%) Improved solution 645.903320616 after 576375 iter, 23321 nodes (gap 4.4%) Improved solution 646.390820616 after 742876 iter, 32781 nodes (gap 4.3%) Improved solution 646.412820616 after 752074 iter, 33554 nodes (gap 4.3%) Improved solution 646.418820616 after 803112 iter, 37416 nodes (gap 4.3%) Improved solution 647.397820616 after 803481 iter, 37441 nodes (gap 4.2%) Improved solution 647.413821522 after 1090314 iter, 55755 nodes (gap 4.2%) lp_solve optimization was stopped due to time-out. Optimal solution 647.413821522 after 1140313 iter, 58267 nodes (gap 4.0%). Excellent numeric accuracy ||*|| = 2.66454e-14 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 1140313, 95698 (8.4%) were bound flips. There were 29787 refactorizations, 0 triggered by time and 82 by density. ... on average 35.1 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 23151 NZ entries, 1.1x largest basis. The maximum B&B level was 103, 0.0x MIP order, 83 at the optimal solution. The constraint matrix inf-norm is 8, with a dynamic range of 8000. Time to load data was 0.215 seconds, presolve used 0.182 seconds, ... 7199.826 seconds in simplex solver, in total 7200.223 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 105 iter. Relaxed solution 0 after 3479 iter is B&B base. Feasible solution 0 after 3479 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 3479 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 3479, 0 (0.0%) were bound flips. There were 16 refactorizations, 0 triggered by time and 0 by density. ... on average 217.4 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 14574 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.611 seconds, presolve used 0.088 seconds, ... 46.654 seconds in simplex solver, in total 47.353 seconds. Vehicle Type: 0 Num:32 Trip segments:197