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 3506 iter. Relaxed solution 21.2819873555 after 3860 iter is B&B base. Feasible solution 21.242565428 after 5281 iter, 231 nodes (gap 0.2%) Improved solution 21.242569078 after 5342 iter, 239 nodes (gap 0.2%) Improved solution 21.242572728 after 5403 iter, 247 nodes (gap 0.2%) Improved solution 21.242576378 after 5466 iter, 255 nodes (gap 0.2%) Improved solution 21.242580028 after 5526 iter, 263 nodes (gap 0.2%) Improved solution 21.242583674 after 5657 iter, 288 nodes (gap 0.2%) Improved solution 21.24258732 after 5780 iter, 310 nodes (gap 0.2%) Improved solution 21.242590966 after 5906 iter, 332 nodes (gap 0.2%) Improved solution 21.242594612 after 6054 iter, 366 nodes (gap 0.2%) Improved solution 21.242598254 after 6433 iter, 462 nodes (gap 0.2%) Improved solution 21.242601896 after 6812 iter, 558 nodes (gap 0.2%) Improved solution 21.242605536 after 7410 iter, 724 nodes (gap 0.2%) Improved solution 21.242609174 after 8095 iter, 920 nodes (gap 0.2%) Improved solution 21.242612812 after 8776 iter, 1116 nodes (gap 0.2%) Improved solution 21.24261645 after 10266 iter, 1512 nodes (gap 0.2%) Improved solution 21.242620088 after 11823 iter, 1924 nodes (gap 0.2%) Improved solution 21.242623726 after 14049 iter, 2522 nodes (gap 0.2%) Improved solution 21.242627362 after 16665 iter, 3240 nodes (gap 0.2%) Improved solution 21.242630996 after 20281 iter, 4228 nodes (gap 0.2%) Improved solution 21.24263463 after 23954 iter, 5232 nodes (gap 0.2%) Improved solution 21.243580032 after 25427 iter, 5574 nodes (gap 0.2%) Improved solution 21.243583678 after 25479 iter, 5584 nodes (gap 0.2%) Improved solution 21.243587324 after 25537 iter, 5596 nodes (gap 0.2%) Improved solution 21.24359097 after 25595 iter, 5608 nodes (gap 0.2%) Improved solution 21.243594616 after 25656 iter, 5620 nodes (gap 0.2%) Improved solution 21.243598258 after 25804 iter, 5645 nodes (gap 0.2%) Improved solution 21.2436019 after 25952 iter, 5679 nodes (gap 0.2%) Improved solution 21.24360554 after 26204 iter, 5745 nodes (gap 0.2%) Improved solution 21.243609178 after 26506 iter, 5825 nodes (gap 0.2%) Improved solution 21.243612816 after 26808 iter, 5905 nodes (gap 0.2%) Improved solution 21.243616454 after 27460 iter, 6061 nodes (gap 0.2%) Improved solution 21.243620092 after 28136 iter, 6223 nodes (gap 0.2%) Improved solution 21.24362373 after 29115 iter, 6465 nodes (gap 0.2%) Improved solution 21.243627366 after 30354 iter, 6777 nodes (gap 0.2%) Improved solution 21.243631 after 32088 iter, 7209 nodes (gap 0.2%) Improved solution 21.243634634 after 33844 iter, 7647 nodes (gap 0.2%) Improved solution 21.243638266 after 41032 iter, 9607 nodes (gap 0.2%) Improved solution 21.243641892 after 53442 iter, 12981 nodes (gap 0.2%) Improved solution 21.243645518 after 68989 iter, 17147 nodes (gap 0.2%) Improved solution 21.243649144 after 86932 iter, 21817 nodes (gap 0.2%) Improved solution 21.243652768 after 143828 iter, 35663 nodes (gap 0.2%) Improved solution 21.24365639 after 336584 iter, 79189 nodes (gap 0.2%) Improved solution 21.243660012 after 706003 iter, 159207 nodes (gap 0.2%) Improved solution 21.245580032 after 713536 iter, 161319 nodes (gap 0.2%) Improved solution 21.245583678 after 713593 iter, 161327 nodes (gap 0.2%) Improved solution 21.245587324 after 713661 iter, 161335 nodes (gap 0.2%) Improved solution 21.24559097 after 713732 iter, 161343 nodes (gap 0.2%) Improved solution 21.245594616 after 713790 iter, 161351 nodes (gap 0.2%) Improved solution 21.245598258 after 713930 iter, 161376 nodes (gap 0.2%) Improved solution 21.245601898 after 714139 iter, 161416 nodes (gap 0.2%) Improved solution 21.2456019 after 714217 iter, 161436 nodes (gap 0.2%) Improved solution 21.24560554 after 714351 iter, 161470 nodes (gap 0.2%) Improved solution 21.24560918 after 714615 iter, 161538 nodes (gap 0.2%) Improved solution 21.245612818 after 714928 iter, 161618 nodes (gap 0.2%) Improved solution 21.245616456 after 715241 iter, 161698 nodes (gap 0.2%) Improved solution 21.245620094 after 715907 iter, 161854 nodes (gap 0.2%) Improved solution 21.245623732 after 716893 iter, 162096 nodes (gap 0.2%) Improved solution 21.245627366 after 718648 iter, 162528 nodes (gap 0.2%) Improved solution 21.245631 after 720425 iter, 162966 nodes (gap 0.2%) Improved solution 21.245634634 after 722203 iter, 163404 nodes (gap 0.2%) Improved solution 21.245634638 after 722888 iter, 163578 nodes (gap 0.2%) Improved solution 21.245638272 after 724635 iter, 164016 nodes (gap 0.2%) Improved solution 21.245641904 after 732742 iter, 166220 nodes (gap 0.2%) Improved solution 21.24564553 after 746435 iter, 169986 nodes (gap 0.2%) Improved solution 21.245649156 after 762135 iter, 174368 nodes (gap 0.2%) Improved solution 21.245652782 after 778478 iter, 178940 nodes (gap 0.2%) Improved solution 21.245656406 after 812492 iter, 188946 nodes (gap 0.2%) Improved solution 21.245660028 after 870052 iter, 207134 nodes (gap 0.2%) Improved solution 21.24566365 after 935048 iter, 228052 nodes (gap 0.2%) Improved solution 21.24566727 after 1072679 iter, 276980 nodes (gap 0.2%) Improved solution 21.246580028 after 1097066 iter, 287581 nodes (gap 0.2%) Improved solution 21.246583674 after 1097080 iter, 287585 nodes (gap 0.2%) Improved solution 21.24658732 after 1097094 iter, 287589 nodes (gap 0.2%) Improved solution 21.246590966 after 1097108 iter, 287593 nodes (gap 0.2%) Improved solution 21.246594612 after 1097122 iter, 287597 nodes (gap 0.2%) Improved solution 21.246598254 after 1097206 iter, 287611 nodes (gap 0.2%) Improved solution 21.246601896 after 1097289 iter, 287625 nodes (gap 0.2%) Improved solution 21.246605538 after 1097372 iter, 287639 nodes (gap 0.2%) Improved solution 21.24660918 after 1097455 iter, 287653 nodes (gap 0.2%) Improved solution 21.246612818 after 1097615 iter, 287685 nodes (gap 0.2%) Improved solution 21.246616456 after 1097775 iter, 287717 nodes (gap 0.2%) Improved solution 21.246620094 after 1097935 iter, 287749 nodes (gap 0.2%) Improved solution 21.246623732 after 1098242 iter, 287825 nodes (gap 0.2%) Improved solution 21.246627368 after 1098696 iter, 287935 nodes (gap 0.2%) Improved solution 21.246631004 after 1099150 iter, 288045 nodes (gap 0.2%) Improved solution 21.246634638 after 1099798 iter, 288195 nodes (gap 0.2%) Improved solution 21.24663827 after 1103089 iter, 289033 nodes (gap 0.2%) Improved solution 21.246641896 after 1109405 iter, 290709 nodes (gap 0.2%) Improved solution 21.246645522 after 1116744 iter, 292755 nodes (gap 0.2%) Improved solution 21.246649148 after 1124421 iter, 294923 nodes (gap 0.2%) Improved solution 21.246652772 after 1141902 iter, 300263 nodes (gap 0.2%) Improved solution 21.246656394 after 1176136 iter, 311931 nodes (gap 0.2%) Improved solution 21.246660016 after 1217108 iter, 326415 nodes (gap 0.2%) Improved solution 21.248583672 after 1221156 iter, 327780 nodes (gap 0.1%) Improved solution 21.248587318 after 1221170 iter, 327784 nodes (gap 0.1%) Improved solution 21.248590964 after 1221184 iter, 327788 nodes (gap 0.1%) Improved solution 21.24859461 after 1221198 iter, 327792 nodes (gap 0.1%) Improved solution 21.248598254 after 1221225 iter, 327798 nodes (gap 0.1%) Improved solution 21.248601896 after 1221303 iter, 327812 nodes (gap 0.1%) Improved solution 21.248605538 after 1221381 iter, 327826 nodes (gap 0.1%) Improved solution 21.24860918 after 1221460 iter, 327840 nodes (gap 0.1%) Improved solution 21.24861282 after 1221555 iter, 327858 nodes (gap 0.1%) Improved solution 21.248616458 after 1221711 iter, 327890 nodes (gap 0.1%) Improved solution 21.248620096 after 1221867 iter, 327922 nodes (gap 0.1%) Improved solution 21.248623734 after 1222172 iter, 327998 nodes (gap 0.1%) Improved solution 21.24862737 after 1222625 iter, 328108 nodes (gap 0.1%) Improved solution 21.248631004 after 1223272 iter, 328258 nodes (gap 0.1%) Improved solution 21.248634638 after 1223920 iter, 328408 nodes (gap 0.1%) Improved solution 21.248634642 after 1224217 iter, 328474 nodes (gap 0.1%) Improved solution 21.248638276 after 1224909 iter, 328624 nodes (gap 0.1%) Improved solution 21.248641908 after 1229533 iter, 329766 nodes (gap 0.1%) Improved solution 21.248645534 after 1238289 iter, 332040 nodes (gap 0.1%) Improved solution 21.24864916 after 1248144 iter, 334714 nodes (gap 0.1%) Improved solution 21.248652786 after 1258178 iter, 337452 nodes (gap 0.1%) Improved solution 21.24865641 after 1279839 iter, 343706 nodes (gap 0.1%) Improved solution 21.248660032 after 1317787 iter, 355366 nodes (gap 0.1%) Improved solution 21.248663654 after 1360698 iter, 368674 nodes (gap 0.1%) Improved solution 21.248667274 after 1455573 iter, 400960 nodes (gap 0.1%) Improved solution 21.248670894 after 1588261 iter, 443318 nodes (gap 0.1%) Improved solution 21.248674512 after 1873066 iter, 543928 nodes (gap 0.1%) lp_solve optimization was stopped due to time-out. Optimal solution 21.248674512 after 1877260 iter, 545598 nodes (gap 0.1%). 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 1877260, 154531 (8.2%) were bound flips. There were 272743 refactorizations, 0 triggered by time and 3 by density. ... on average 6.3 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 9081 NZ entries, 1.0x largest basis. The maximum B&B level was 235, 0.3x MIP order, 186 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.031 seconds, ... 7199.975 seconds in simplex solver, in total 7200.059 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 403 iter. Relaxed solution 0 after 1871 iter is B&B base. Feasible solution 0 after 1871 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1871 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 1871, 0 (0.0%) were bound flips. There were 9 refactorizations, 0 triggered by time and 0 by density. ... on average 207.9 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 7244 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.030 seconds, ... 5.088 seconds in simplex solver, in total 5.171 seconds. Vehicle Type: 0 Num:86 Trip segments:360