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 5807 iter. Relaxed solution 620.280195873 after 7358 iter is B&B base. Feasible solution 586.093665912 after 9737 iter, 101 nodes (gap 5.5%) Improved solution 586.097665904 after 9741 iter, 103 nodes (gap 5.5%) Improved solution 586.097669566 after 9743 iter, 105 nodes (gap 5.5%) Improved solution 593.157654962 after 9952 iter, 123 nodes (gap 4.4%) Improved solution 593.157658618 after 10086 iter, 161 nodes (gap 4.4%) Improved solution 593.157662272 after 10230 iter, 207 nodes (gap 4.4%) Improved solution 593.157662278 after 10273 iter, 217 nodes (gap 4.4%) Improved solution 593.157665932 after 10359 iter, 239 nodes (gap 4.4%) Improved solution 593.157669582 after 10675 iter, 351 nodes (gap 4.4%) Improved solution 602.100665924 after 10795 iter, 368 nodes (gap 2.9%) Improved solution 602.105665924 after 10802 iter, 371 nodes (gap 2.9%) Improved solution 602.109665916 after 10832 iter, 379 nodes (gap 2.9%) Improved solution 602.112665916 after 10914 iter, 398 nodes (gap 2.9%) Improved solution 602.113665916 after 10926 iter, 403 nodes (gap 2.9%) Improved solution 602.114665912 after 25951 iter, 1854 nodes (gap 2.9%) Improved solution 609.071665908 after 26007 iter, 1860 nodes (gap 1.8%) Improved solution 609.075662238 after 26013 iter, 1865 nodes (gap 1.8%) Improved solution 609.09565129 after 26270 iter, 1887 nodes (gap 1.8%) Improved solution 609.095654952 after 26407 iter, 1899 nodes (gap 1.8%) Improved solution 617.89615129 after 30958 iter, 2304 nodes (gap 0.4%) Improved solution 617.89665129 after 31097 iter, 2320 nodes (gap 0.4%) Improved solution 617.896654948 after 31362 iter, 2362 nodes (gap 0.4%) Improved solution 617.8966586 after 32815 iter, 2613 nodes (gap 0.4%) Improved solution 617.89666225 after 36237 iter, 3215 nodes (gap 0.4%) Improved solution 617.896662262 after 41847 iter, 4157 nodes (gap 0.4%) Improved solution 617.896662264 after 42136 iter, 4196 nodes (gap 0.4%) Improved solution 617.896665912 after 60024 iter, 7229 nodes (gap 0.4%) Improved solution 617.896665914 after 60515 iter, 7300 nodes (gap 0.4%) Improved solution 617.95265129 after 109838 iter, 17572 nodes (gap 0.4%) Improved solution 617.952654946 after 109934 iter, 17596 nodes (gap 0.4%) Improved solution 617.952658598 after 110700 iter, 17720 nodes (gap 0.4%) Improved solution 617.96065129 after 116063 iter, 18383 nodes (gap 0.4%) Improved solution 617.960654946 after 116144 iter, 18407 nodes (gap 0.4%) Improved solution 617.960658598 after 116543 iter, 18507 nodes (gap 0.4%) Improved solution 617.96365495 after 127447 iter, 20039 nodes (gap 0.4%) Improved solution 617.963658606 after 127504 iter, 20057 nodes (gap 0.4%) Improved solution 617.963662256 after 127654 iter, 20116 nodes (gap 0.4%) Improved solution 617.963662258 after 127656 iter, 20117 nodes (gap 0.4%) Improved solution 617.963665908 after 127931 iter, 20196 nodes (gap 0.4%) Improved solution 617.973647622 after 171004 iter, 25477 nodes (gap 0.4%) Improved solution 617.973651282 after 171125 iter, 25517 nodes (gap 0.4%) Improved solution 617.973654934 after 178492 iter, 26623 nodes (gap 0.4%) Improved solution 617.973658586 after 191925 iter, 28651 nodes (gap 0.4%) Improved solution 617.979647622 after 192093 iter, 28676 nodes (gap 0.4%) Improved solution 617.979651282 after 192119 iter, 28686 nodes (gap 0.4%) Improved solution 617.979654934 after 192434 iter, 28782 nodes (gap 0.4%) Improved solution 617.979658586 after 192965 iter, 28946 nodes (gap 0.4%) Improved solution 617.979658594 after 216112 iter, 31587 nodes (gap 0.4%) Improved solution 617.979662246 after 216630 iter, 31751 nodes (gap 0.4%) Improved solution 617.982647622 after 979701 iter, 111484 nodes (gap 0.4%) Improved solution 617.982651282 after 979730 iter, 111494 nodes (gap 0.4%) Improved solution 617.982654934 after 980149 iter, 111590 nodes (gap 0.4%) Improved solution 617.982658586 after 980922 iter, 111770 nodes (gap 0.4%) Improved solution 617.982658594 after 992988 iter, 113215 nodes (gap 0.4%) Improved solution 617.982662246 after 993792 iter, 113395 nodes (gap 0.4%) Improved solution 618.037654956 after 1734527 iter, 192868 nodes (gap 0.4%) Improved solution 618.037658612 after 1734549 iter, 192878 nodes (gap 0.4%) Improved solution 618.037662264 after 1734751 iter, 192942 nodes (gap 0.4%) Improved solution 618.037665914 after 1735248 iter, 193078 nodes (gap 0.4%) lp_solve optimization was stopped due to time-out. Optimal solution 618.037665914 after 2634109 iter, 321230 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 2634109, 93411 (3.5%) were bound flips. There were 160624 refactorizations, 0 triggered by time and 16 by density. ... on average 15.8 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 10408 NZ entries, 1.1x largest basis. The maximum B&B level was 129, 0.1x MIP order, 103 at the optimal solution. The constraint matrix inf-norm is 8, with a dynamic range of 8000. Time to load data was 0.052 seconds, presolve used 0.028 seconds, ... 7199.976 seconds in simplex solver, in total 7200.056 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 283 iter. Relaxed solution 0 after 1749 iter is B&B base. Feasible solution 0 after 1749 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1749 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 1749, 0 (0.0%) were bound flips. There were 9 refactorizations, 0 triggered by time and 0 by density. ... on average 194.3 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 6661 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.053 seconds, presolve used 0.029 seconds, ... 4.806 seconds in simplex solver, in total 4.888 seconds. Vehicle Type: 0 Num:49 Trip segments:368