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 3491 iter. Relaxed solution 23.275983741 after 3931 iter is B&B base. Feasible solution 23.192932822 after 4576 iter, 76 nodes (gap 0.3%) Improved solution 23.193932822 after 4594 iter, 79 nodes (gap 0.3%) Improved solution 23.19395888 after 4607 iter, 83 nodes (gap 0.3%) Improved solution 23.193984932 after 5087 iter, 173 nodes (gap 0.3%) Improved solution 23.194932822 after 5375 iter, 225 nodes (gap 0.3%) Improved solution 23.19495888 after 5383 iter, 229 nodes (gap 0.3%) Improved solution 23.194984932 after 5546 iter, 265 nodes (gap 0.3%) Improved solution 23.195010984 after 6503 iter, 493 nodes (gap 0.3%) Improved solution 23.195010988 after 8077 iter, 911 nodes (gap 0.3%) Improved solution 23.19501099 after 8593 iter, 1046 nodes (gap 0.3%) Improved solution 23.19503704 after 11080 iter, 1686 nodes (gap 0.3%) Improved solution 23.195932826 after 197577 iter, 47848 nodes (gap 0.3%) Improved solution 23.196932826 after 197608 iter, 47853 nodes (gap 0.3%) Improved solution 23.196958882 after 197770 iter, 47873 nodes (gap 0.3%) Improved solution 23.197932826 after 198340 iter, 47949 nodes (gap 0.3%) Improved solution 23.197958882 after 198393 iter, 47961 nodes (gap 0.3%) Improved solution 23.197958888 after 198810 iter, 48046 nodes (gap 0.3%) Improved solution 23.197984944 after 198877 iter, 48060 nodes (gap 0.3%) Improved solution 23.198010992 after 199798 iter, 48234 nodes (gap 0.3%) Improved solution 23.19803704 after 202819 iter, 48872 nodes (gap 0.3%) Improved solution 23.198063088 after 206672 iter, 49666 nodes (gap 0.3%) Improved solution 23.198932832 after 238673 iter, 56447 nodes (gap 0.3%) Improved solution 23.198958894 after 239059 iter, 56510 nodes (gap 0.3%) Improved solution 23.198984942 after 240914 iter, 56840 nodes (gap 0.3%) Improved solution 23.19901099 after 247049 iter, 58184 nodes (gap 0.3%) Improved solution 23.199037036 after 251900 iter, 59262 nodes (gap 0.3%) Improved solution 23.199906776 after 252494 iter, 59375 nodes (gap 0.3%) Improved solution 23.199932832 after 252545 iter, 59387 nodes (gap 0.3%) Improved solution 23.199932838 after 252914 iter, 59462 nodes (gap 0.3%) Improved solution 23.199958894 after 252921 iter, 59464 nodes (gap 0.3%) Improved solution 23.19998494 after 253790 iter, 59628 nodes (gap 0.3%) Improved solution 23.199984942 after 255127 iter, 59862 nodes (gap 0.3%) Improved solution 23.200010988 after 256122 iter, 60070 nodes (gap 0.3%) Improved solution 23.20001099 after 261714 iter, 61242 nodes (gap 0.3%) Improved solution 23.200037036 after 262950 iter, 61532 nodes (gap 0.3%) Improved solution 23.200037042 after 266459 iter, 62326 nodes (gap 0.3%) Improved solution 23.200063086 after 270458 iter, 63190 nodes (gap 0.3%) Improved solution 23.200089126 after 327809 iter, 75548 nodes (gap 0.3%) Improved solution 23.200932822 after 354658 iter, 81155 nodes (gap 0.3%) Improved solution 23.200958878 after 354709 iter, 81167 nodes (gap 0.3%) Improved solution 23.200958884 after 355096 iter, 81244 nodes (gap 0.3%) Improved solution 23.20098494 after 355151 iter, 81258 nodes (gap 0.3%) Improved solution 23.201010988 after 356002 iter, 81414 nodes (gap 0.3%) Improved solution 23.201037036 after 358824 iter, 81990 nodes (gap 0.3%) Improved solution 23.201063078 after 365523 iter, 83258 nodes (gap 0.3%) Improved solution 23.201063084 after 370363 iter, 84180 nodes (gap 0.3%) Improved solution 23.201089126 after 376116 iter, 85318 nodes (gap 0.3%) Improved solution 23.201932822 after 502533 iter, 109679 nodes (gap 0.3%) Improved solution 23.201958878 after 502583 iter, 109691 nodes (gap 0.3%) Improved solution 23.201958884 after 502938 iter, 109758 nodes (gap 0.3%) Improved solution 23.20198494 after 502942 iter, 109760 nodes (gap 0.3%) Improved solution 23.202010988 after 503699 iter, 109902 nodes (gap 0.3%) Improved solution 23.202037036 after 506498 iter, 110470 nodes (gap 0.3%) Improved solution 23.202063078 after 512802 iter, 111686 nodes (gap 0.3%) Improved solution 23.202063084 after 517336 iter, 112568 nodes (gap 0.3%) Improved solution 23.202089126 after 522690 iter, 113666 nodes (gap 0.3%) Improved solution 23.202958892 after 775746 iter, 160656 nodes (gap 0.3%) Improved solution 23.202984954 after 775955 iter, 160691 nodes (gap 0.3%) Improved solution 23.203011002 after 777023 iter, 160867 nodes (gap 0.3%) Improved solution 23.203037046 after 780185 iter, 161397 nodes (gap 0.3%) Improved solution 23.203037048 after 781094 iter, 161548 nodes (gap 0.3%) Improved solution 23.203063092 after 784155 iter, 162066 nodes (gap 0.3%) Improved solution 23.203063094 after 794300 iter, 163885 nodes (gap 0.3%) Improved solution 23.203063098 after 799768 iter, 164944 nodes (gap 0.3%) Improved solution 23.203089142 after 806558 iter, 166300 nodes (gap 0.3%) Improved solution 23.203958892 after 817110 iter, 168167 nodes (gap 0.3%) Improved solution 23.203984954 after 817373 iter, 168208 nodes (gap 0.3%) Improved solution 23.204011002 after 818996 iter, 168478 nodes (gap 0.3%) Improved solution 23.204037046 after 820683 iter, 168754 nodes (gap 0.3%) Improved solution 23.204958888 after 822784 iter, 169114 nodes (gap 0.3%) Improved solution 23.20498495 after 823081 iter, 169163 nodes (gap 0.3%) Improved solution 23.205010998 after 824913 iter, 169477 nodes (gap 0.3%) Improved solution 23.205037042 after 826791 iter, 169809 nodes (gap 0.3%) Improved solution 23.205037044 after 830360 iter, 170426 nodes (gap 0.3%) Improved solution 23.205063088 after 832130 iter, 170732 nodes (gap 0.3%) Improved solution 23.20506309 after 848244 iter, 173669 nodes (gap 0.3%) Improved solution 23.205063094 after 860182 iter, 176044 nodes (gap 0.3%) Improved solution 23.205089138 after 864273 iter, 176882 nodes (gap 0.3%) Improved solution 23.20511518 after 903167 iter, 184360 nodes (gap 0.3%) Improved solution 23.205984932 after 910742 iter, 185752 nodes (gap 0.3%) Improved solution 23.206010994 after 911015 iter, 185797 nodes (gap 0.3%) Improved solution 23.206037042 after 912094 iter, 185981 nodes (gap 0.3%) Improved solution 23.206063084 after 914586 iter, 186383 nodes (gap 0.3%) Improved solution 23.206063088 after 916621 iter, 186706 nodes (gap 0.3%) Improved solution 23.20608913 after 918949 iter, 187090 nodes (gap 0.3%) Improved solution 23.206089132 after 932657 iter, 189397 nodes (gap 0.3%) Improved solution 23.206089138 after 939950 iter, 190810 nodes (gap 0.3%) Improved solution 23.20611518 after 944630 iter, 191790 nodes (gap 0.3%) Improved solution 23.206984932 after 1375281 iter, 270835 nodes (gap 0.3%) Improved solution 23.207010984 after 1376053 iter, 270950 nodes (gap 0.3%) Improved solution 23.207037026 after 1378294 iter, 271288 nodes (gap 0.3%) Improved solution 23.20703703 after 1379855 iter, 271531 nodes (gap 0.3%) Improved solution 23.207063072 after 1381081 iter, 271709 nodes (gap 0.3%) Improved solution 23.20706308 after 1389610 iter, 273145 nodes (gap 0.3%) Improved solution 23.207063086 after 1396060 iter, 274338 nodes (gap 0.3%) Improved solution 23.207089128 after 1403442 iter, 275632 nodes (gap 0.3%) Improved solution 23.20708913 after 1694056 iter, 327370 nodes (gap 0.3%) lp_solve optimization was stopped due to time-out. Optimal solution 23.20708913 after 1706363 iter, 329837 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 1706363, 126576 (7.4%) were bound flips. There were 164912 refactorizations, 0 triggered by time and 5 by density. ... on average 9.6 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 8947 NZ entries, 1.0x largest basis. The maximum B&B level was 89, 0.1x MIP order, 80 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.095 seconds, presolve used 0.031 seconds, ... 7199.972 seconds in simplex solver, in total 7200.098 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 ||*|| = 0 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 64, with a dynamic range of 64000. Time to load data was 0.055 seconds, presolve used 0.034 seconds, ... 4.845 seconds in simplex solver, in total 4.934 seconds. Vehicle Type: 0 Num:26 Trip segments:140