Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3524 constraints, 5927 variables, 15923 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 3812 iter. Relaxed solution 23.2079912049 after 4208 iter is B&B base. Feasible solution 23.189797886 after 5448 iter, 105 nodes (gap 0.1%) Improved solution 23.189799697 after 5582 iter, 118 nodes (gap 0.1%) Improved solution 23.189801502 after 6925 iter, 312 nodes (gap 0.1%) Improved solution 23.190792457 after 7125 iter, 349 nodes (gap 0.1%) Improved solution 23.190794268 after 7142 iter, 354 nodes (gap 0.1%) Improved solution 23.190796079 after 7218 iter, 370 nodes (gap 0.1%) Improved solution 23.19079789 after 7455 iter, 428 nodes (gap 0.1%) Improved solution 23.191794268 after 7632 iter, 443 nodes (gap 0.1%) Improved solution 23.191796079 after 7746 iter, 457 nodes (gap 0.1%) Improved solution 23.19179789 after 7943 iter, 489 nodes (gap 0.1%) Improved solution 23.191799691 after 9875 iter, 797 nodes (gap 0.1%) Improved solution 23.191801502 after 10081 iter, 829 nodes (gap 0.1%) Improved solution 23.191803303 after 12191 iter, 1165 nodes (gap 0.1%) Improved solution 23.191805114 after 12386 iter, 1199 nodes (gap 0.1%) Improved solution 23.192788835 after 12622 iter, 1234 nodes (gap 0.1%) Improved solution 23.192790646 after 12641 iter, 1239 nodes (gap 0.1%) Improved solution 23.192792457 after 12728 iter, 1255 nodes (gap 0.1%) Improved solution 23.192794268 after 12843 iter, 1279 nodes (gap 0.1%) Improved solution 23.192796077 after 12938 iter, 1295 nodes (gap 0.1%) Improved solution 23.192797888 after 13185 iter, 1342 nodes (gap 0.1%) Improved solution 23.192799691 after 13370 iter, 1373 nodes (gap 0.1%) Improved solution 23.192801502 after 13410 iter, 1383 nodes (gap 0.1%) Improved solution 23.192803303 after 13915 iter, 1471 nodes (gap 0.1%) Improved solution 23.192805114 after 13952 iter, 1481 nodes (gap 0.1%) Improved solution 23.192806915 after 14466 iter, 1571 nodes (gap 0.1%) Improved solution 23.192808726 after 14506 iter, 1581 nodes (gap 0.1%) Improved solution 23.192810525 after 15623 iter, 1795 nodes (gap 0.1%) Improved solution 23.192812336 after 15664 iter, 1805 nodes (gap 0.1%) Improved solution 23.193799683 after 16844 iter, 1937 nodes (gap 0.1%) Improved solution 23.193801494 after 16864 iter, 1942 nodes (gap 0.1%) Improved solution 23.193803303 after 16953 iter, 1961 nodes (gap 0.1%) Improved solution 23.193805114 after 17169 iter, 1994 nodes (gap 0.1%) Improved solution 23.193806915 after 19745 iter, 2382 nodes (gap 0.1%) Improved solution 23.193808726 after 19762 iter, 2387 nodes (gap 0.1%) Improved solution 23.193810525 after 24072 iter, 3100 nodes (gap 0.1%) Improved solution 23.193812336 after 24089 iter, 3105 nodes (gap 0.1%) Improved solution 23.193812338 after 28340 iter, 3789 nodes (gap 0.1%) Improved solution 23.193814137 after 29515 iter, 3998 nodes (gap 0.1%) Improved solution 23.193815948 after 29577 iter, 4011 nodes (gap 0.1%) Improved solution 23.194796071 after 30533 iter, 4127 nodes (gap 0.1%) Improved solution 23.194797882 after 30558 iter, 4132 nodes (gap 0.1%) Improved solution 23.194799691 after 30662 iter, 4151 nodes (gap 0.1%) Improved solution 23.194801496 after 30837 iter, 4177 nodes (gap 0.1%) Improved solution 23.194803305 after 30941 iter, 4196 nodes (gap 0.1%) Improved solution 23.194805116 after 31195 iter, 4239 nodes (gap 0.1%) Improved solution 23.194806917 after 32900 iter, 4489 nodes (gap 0.1%) Improved solution 23.194808728 after 32924 iter, 4495 nodes (gap 0.1%) Improved solution 23.194810527 after 35971 iter, 4975 nodes (gap 0.1%) Improved solution 23.194812338 after 35995 iter, 4981 nodes (gap 0.1%) Improved solution 23.194814137 after 39432 iter, 5543 nodes (gap 0.1%) Improved solution 23.194815948 after 39456 iter, 5549 nodes (gap 0.1%) Improved solution 23.194817747 after 51641 iter, 7589 nodes (gap 0.1%) Improved solution 23.194819558 after 51667 iter, 7595 nodes (gap 0.1%) Improved solution 23.194821357 after 71296 iter, 10837 nodes (gap 0.1%) Improved solution 23.194823168 after 71322 iter, 10843 nodes (gap 0.1%) Improved solution 23.194824967 after 93707 iter, 14655 nodes (gap 0.1%) Improved solution 23.194826778 after 93734 iter, 14661 nodes (gap 0.1%) Improved solution 23.194828577 after 160164 iter, 25763 nodes (gap 0.1%) Improved solution 23.194830388 after 160191 iter, 25769 nodes (gap 0.1%) Improved solution 23.194832187 after 230995 iter, 37779 nodes (gap 0.1%) Improved solution 23.194833998 after 231022 iter, 37785 nodes (gap 0.1%) Improved solution 23.194835797 after 305624 iter, 50007 nodes (gap 0.1%) Improved solution 23.194837608 after 305649 iter, 50013 nodes (gap 0.1%) Improved solution 23.194839407 after 379180 iter, 62219 nodes (gap 0.1%) Improved solution 23.194841218 after 379205 iter, 62225 nodes (gap 0.1%) Improved solution 23.19484122 after 394843 iter, 65650 nodes (gap 0.1%) Improved solution 23.194843025 after 394890 iter, 65656 nodes (gap 0.1%) Improved solution 23.195790638 after 497608 iter, 78736 nodes (gap 0.1%) Improved solution 23.195792449 after 497646 iter, 78741 nodes (gap 0.1%) Improved solution 23.195794256 after 497887 iter, 78774 nodes (gap 0.1%) Improved solution 23.195796067 after 497909 iter, 78779 nodes (gap 0.1%) Improved solution 23.195797876 after 498597 iter, 78886 nodes (gap 0.1%) Improved solution 23.195799687 after 498634 iter, 78894 nodes (gap 0.1%) Improved solution 23.195799689 after 499840 iter, 79089 nodes (gap 0.1%) Improved solution 23.195801494 after 499911 iter, 79100 nodes (gap 0.1%) Improved solution 23.195803305 after 499948 iter, 79107 nodes (gap 0.1%) Improved solution 23.195805114 after 501611 iter, 79363 nodes (gap 0.1%) Improved solution 23.195806919 after 505737 iter, 79907 nodes (gap 0.1%) Improved solution 23.195808724 after 510821 iter, 80665 nodes (gap 0.1%) Improved solution 23.195810533 after 519152 iter, 81816 nodes (gap 0.1%) Improved solution 23.195812334 after 539945 iter, 84963 nodes (gap 0.1%) Improved solution 23.195814143 after 550375 iter, 86464 nodes (gap 0.1%) Improved solution 23.195815944 after 573609 iter, 90015 nodes (gap 0.1%) Improved solution 23.195817753 after 584439 iter, 91594 nodes (gap 0.1%) Improved solution 23.195819554 after 608183 iter, 95235 nodes (gap 0.1%) Improved solution 23.195821363 after 619081 iter, 96832 nodes (gap 0.1%) Improved solution 23.195821365 after 664558 iter, 104777 nodes (gap 0.1%) Improved solution 23.19582317 after 664595 iter, 104783 nodes (gap 0.1%) Improved solution 23.195824975 after 731490 iter, 116087 nodes (gap 0.1%) Improved solution 23.195826776 after 792188 iter, 126680 nodes (gap 0.1%) Improved solution 23.195828579 after 815356 iter, 130277 nodes (gap 0.1%) Improved solution 23.195828583 after 817306 iter, 130640 nodes (gap 0.1%) Improved solution 23.195830388 after 817446 iter, 130666 nodes (gap 0.1%) Improved solution 23.195832189 after 910715 iter, 147241 nodes (gap 0.1%) Improved solution 23.195832193 after 912655 iter, 147604 nodes (gap 0.1%) Improved solution 23.195833998 after 912794 iter, 147630 nodes (gap 0.1%) Improved solution 23.195835799 after 1008939 iter, 164839 nodes (gap 0.1%) Improved solution 23.195835803 after 1010892 iter, 165202 nodes (gap 0.1%) Improved solution 23.195837608 after 1011031 iter, 165228 nodes (gap 0.1%) Improved solution 23.195839409 after 1107522 iter, 182453 nodes (gap 0.1%) Improved solution 23.195839413 after 1109400 iter, 182816 nodes (gap 0.1%) Improved solution 23.195841218 after 1109540 iter, 182842 nodes (gap 0.1%) Improved solution 23.195843023 after 1322915 iter, 217531 nodes (gap 0.1%) Improved solution 23.195843027 after 1435278 iter, 233447 nodes (gap 0.1%) Improved solution 23.195844832 after 1587878 iter, 254815 nodes (gap 0.1%) Improved solution 23.195846637 after 1633316 iter, 263061 nodes (gap 0.1%) lp_solve optimization was stopped due to time-out. Optimal solution 23.195846637 after 2328413 iter, 374918 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 2328413, 217392 (9.3%) were bound flips. There were 187448 refactorizations, 0 triggered by time and 3 by density. ... on average 11.3 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 10132 NZ entries, 1.0x largest basis. The maximum B&B level was 121, 0.1x MIP order, 90 at the optimal solution. The constraint matrix inf-norm is 8, with a dynamic range of 8000. Time to load data was 0.064 seconds, presolve used 0.033 seconds, ... 7199.971 seconds in simplex solver, in total 7200.068 seconds. Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3524 constraints, 5927 variables, 15923 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 1661 iter is B&B base. Feasible solution 0 after 1661 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1661 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 1661, 0 (0.0%) were bound flips. There were 9 refactorizations, 0 triggered by time and 0 by density. ... on average 184.6 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 6954 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.067 seconds, presolve used 0.036 seconds, ... 5.690 seconds in simplex solver, in total 5.793 seconds. Vehicle Type: 0 Num:74 Trip segments:170