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 4324 iter. Relaxed solution 778.679571748 after 4587 iter is B&B base. Feasible solution 685.170728292 after 5504 iter, 84 nodes (gap 12.0%) Improved solution 700.340676646 after 5570 iter, 93 nodes (gap 10.0%) Improved solution 725.370624984 after 5574 iter, 95 nodes (gap 6.8%) Improved solution 725.390624984 after 5626 iter, 116 nodes (gap 6.8%) Improved solution 741.530676632 after 5925 iter, 195 nodes (gap 4.8%) Improved solution 741.530728292 after 5993 iter, 213 nodes (gap 4.8%) Improved solution 741.530779952 after 6187 iter, 263 nodes (gap 4.8%) Improved solution 741.546676634 after 6528 iter, 335 nodes (gap 4.8%) Improved solution 741.546728294 after 6575 iter, 346 nodes (gap 4.8%) Improved solution 741.54677995 after 6953 iter, 448 nodes (gap 4.8%) Improved solution 741.546779954 after 7230 iter, 514 nodes (gap 4.8%) Improved solution 741.546831608 after 7774 iter, 650 nodes (gap 4.8%) Improved solution 741.550676632 after 9951 iter, 1191 nodes (gap 4.8%) Improved solution 741.550728292 after 10035 iter, 1211 nodes (gap 4.8%) Improved solution 741.550779952 after 10261 iter, 1269 nodes (gap 4.8%) Improved solution 741.566676634 after 10652 iter, 1360 nodes (gap 4.8%) Improved solution 741.566728294 after 10702 iter, 1373 nodes (gap 4.8%) Improved solution 741.56677995 after 11060 iter, 1469 nodes (gap 4.8%) Improved solution 741.566779954 after 11317 iter, 1537 nodes (gap 4.8%) Improved solution 741.566831608 after 11897 iter, 1691 nodes (gap 4.8%) Improved solution 741.56683161 after 21035 iter, 4161 nodes (gap 4.8%) Improved solution 741.566883264 after 22272 iter, 4485 nodes (gap 4.8%) Improved solution 741.566934914 after 80913 iter, 20952 nodes (gap 4.8%) Improved solution 741.574728288 after 106574 iter, 29066 nodes (gap 4.8%) Improved solution 741.574779948 after 106590 iter, 29074 nodes (gap 4.8%) Improved solution 741.574779952 after 106729 iter, 29104 nodes (gap 4.8%) Improved solution 741.574831608 after 107244 iter, 29217 nodes (gap 4.8%) Improved solution 741.59072829 after 108106 iter, 29440 nodes (gap 4.8%) Improved solution 741.590728294 after 108212 iter, 29460 nodes (gap 4.8%) Improved solution 741.59077995 after 108873 iter, 29630 nodes (gap 4.8%) Improved solution 741.590831606 after 111561 iter, 30310 nodes (gap 4.8%) Improved solution 741.59083161 after 112284 iter, 30504 nodes (gap 4.8%) Improved solution 741.590883264 after 114413 iter, 31032 nodes (gap 4.8%) Improved solution 741.590934914 after 160330 iter, 43096 nodes (gap 4.8%) Improved solution 741.590986562 after 319325 iter, 87571 nodes (gap 4.8%) Improved solution 760.576676632 after 369788 iter, 103058 nodes (gap 2.3%) Improved solution 760.57672829 after 369884 iter, 103080 nodes (gap 2.3%) Improved solution 760.576779942 after 370649 iter, 103270 nodes (gap 2.3%) Improved solution 760.59262497 after 370998 iter, 103351 nodes (gap 2.3%) Improved solution 760.59267663 after 371011 iter, 103357 nodes (gap 2.3%) Improved solution 760.592676634 after 371062 iter, 103365 nodes (gap 2.3%) Improved solution 760.592728292 after 371077 iter, 103373 nodes (gap 2.3%) Improved solution 760.592779942 after 372729 iter, 103791 nodes (gap 2.3%) Improved solution 760.59667663 after 373314 iter, 103929 nodes (gap 2.3%) Improved solution 760.61867663 after 373509 iter, 103971 nodes (gap 2.3%) Improved solution 760.618728286 after 373981 iter, 104085 nodes (gap 2.3%) Improved solution 760.61872829 after 374291 iter, 104149 nodes (gap 2.3%) Improved solution 760.618779944 after 374689 iter, 104245 nodes (gap 2.3%) Improved solution 760.634728292 after 374893 iter, 104287 nodes (gap 2.3%) Improved solution 760.634779942 after 375402 iter, 104411 nodes (gap 2.3%) Improved solution 760.63867663 after 375681 iter, 104463 nodes (gap 2.3%) Improved solution 760.638728286 after 375781 iter, 104491 nodes (gap 2.3%) Improved solution 760.63872829 after 375859 iter, 104505 nodes (gap 2.3%) Improved solution 760.638779944 after 375933 iter, 104531 nodes (gap 2.3%) Improved solution 760.654728292 after 375985 iter, 104541 nodes (gap 2.3%) Improved solution 760.654779942 after 376101 iter, 104571 nodes (gap 2.3%) Improved solution 760.654779944 after 377724 iter, 104945 nodes (gap 2.3%) Improved solution 760.654831594 after 377974 iter, 105009 nodes (gap 2.3%) Improved solution 760.654831598 after 381241 iter, 105823 nodes (gap 2.3%) Improved solution 760.6548316 after 427011 iter, 113368 nodes (gap 2.3%) Improved solution 760.65488325 after 432520 iter, 114852 nodes (gap 2.3%) Improved solution 760.654883254 after 438038 iter, 116364 nodes (gap 2.3%) Improved solution 760.654883256 after 931405 iter, 211773 nodes (gap 2.3%) Improved solution 760.6549349 after 1444427 iter, 343817 nodes (gap 2.3%) Improved solution 760.654934902 after 1456266 iter, 347370 nodes (gap 2.3%) lp_solve optimization was stopped due to time-out. Optimal solution 760.654934902 after 2358307 iter, 527358 nodes (gap 0.3%). 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 2358307, 156433 (6.6%) were bound flips. There were 263672 refactorizations, 0 triggered by time and 7 by density. ... on average 8.4 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 9799 NZ entries, 1.1x largest basis. The maximum B&B level was 103, 0.1x MIP order, 91 at the optimal solution. The constraint matrix inf-norm is 128, with a dynamic range of 128000. Time to load data was 0.048 seconds, presolve used 0.028 seconds, ... 7199.976 seconds in simplex solver, in total 7200.052 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.050 seconds, presolve used 0.029 seconds, ... 4.277 seconds in simplex solver, in total 4.356 seconds. Vehicle Type: 0 Num:26 Trip segments:160