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 3520 iter. Relaxed solution 25.3259846772 after 3979 iter is B&B base. Feasible solution 25.2851415 after 4447 iter, 65 nodes (gap 0.2%) Improved solution 25.2861415 after 4585 iter, 93 nodes (gap 0.2%) Improved solution 25.286193138 after 5285 iter, 239 nodes (gap 0.2%) Improved solution 25.286244776 after 6832 iter, 573 nodes (gap 0.2%) Improved solution 25.286244778 after 7449 iter, 716 nodes (gap 0.2%) Improved solution 25.286296416 after 9330 iter, 1128 nodes (gap 0.2%) Improved solution 25.286296418 after 12428 iter, 1891 nodes (gap 0.2%) Improved solution 25.286296428 after 13561 iter, 2182 nodes (gap 0.2%) Improved solution 25.28629643 after 14205 iter, 2365 nodes (gap 0.2%) Improved solution 25.286348068 after 16267 iter, 2949 nodes (gap 0.2%) Improved solution 25.2863997 after 30490 iter, 6751 nodes (gap 0.2%) Improved solution 25.287141502 after 61356 iter, 14964 nodes (gap 0.1%) Improved solution 25.287193152 after 61390 iter, 14972 nodes (gap 0.1%) Improved solution 25.28724479 after 62245 iter, 15226 nodes (gap 0.1%) Improved solution 25.287296428 after 64275 iter, 15808 nodes (gap 0.1%) Improved solution 25.28729643 after 64855 iter, 15983 nodes (gap 0.1%) Improved solution 25.287348068 after 66706 iter, 16553 nodes (gap 0.1%) Improved solution 25.2873997 after 73119 iter, 18541 nodes (gap 0.1%) Improved solution 25.287399702 after 151379 iter, 43033 nodes (gap 0.1%) Improved solution 25.287451332 after 154682 iter, 44211 nodes (gap 0.1%) Improved solution 25.287502958 after 392607 iter, 125265 nodes (gap 0.1%) Improved solution 25.288141502 after 630961 iter, 212041 nodes (gap 0.1%) Improved solution 25.288193152 after 631002 iter, 212050 nodes (gap 0.1%) Improved solution 25.28824479 after 631966 iter, 212304 nodes (gap 0.1%) Improved solution 25.288296428 after 634238 iter, 212886 nodes (gap 0.1%) Improved solution 25.28829643 after 634899 iter, 213061 nodes (gap 0.1%) Improved solution 25.288348068 after 637051 iter, 213647 nodes (gap 0.1%) Improved solution 25.2883997 after 644398 iter, 215659 nodes (gap 0.1%) Improved solution 25.288399702 after 674036 iter, 224287 nodes (gap 0.1%) Improved solution 25.288451332 after 677984 iter, 225491 nodes (gap 0.1%) Improved solution 25.2891415 after 744957 iter, 247107 nodes (gap 0.1%) Improved solution 25.28919315 after 744991 iter, 247116 nodes (gap 0.1%) Improved solution 25.289244794 after 745034 iter, 247133 nodes (gap 0.1%) Improved solution 25.289296432 after 745862 iter, 247385 nodes (gap 0.1%) Improved solution 25.289296434 after 746296 iter, 247505 nodes (gap 0.1%) Improved solution 25.289348072 after 746954 iter, 247700 nodes (gap 0.1%) Improved solution 25.289399704 after 750445 iter, 248730 nodes (gap 0.1%) Improved solution 25.289399706 after 786416 iter, 259723 nodes (gap 0.1%) Improved solution 25.289451336 after 789005 iter, 260605 nodes (gap 0.1%) Improved solution 25.289502962 after 903718 iter, 299307 nodes (gap 0.1%) Improved solution 25.290193146 after 931822 iter, 309990 nodes (gap 0.1%) Improved solution 25.29024479 after 931929 iter, 310012 nodes (gap 0.1%) Improved solution 25.290296428 after 932521 iter, 310138 nodes (gap 0.1%) Improved solution 25.29029643 after 932846 iter, 310206 nodes (gap 0.1%) Improved solution 25.290348068 after 933358 iter, 310312 nodes (gap 0.1%) Improved solution 25.2903997 after 935408 iter, 310804 nodes (gap 0.1%) Improved solution 25.291193144 after 936877 iter, 311159 nodes (gap 0.1%) Improved solution 25.291244788 after 936881 iter, 311163 nodes (gap 0.1%) Improved solution 25.291296426 after 937220 iter, 311275 nodes (gap 0.1%) Improved solution 25.291296428 after 937417 iter, 311331 nodes (gap 0.1%) Improved solution 25.291348066 after 937673 iter, 311419 nodes (gap 0.1%) Improved solution 25.291399698 after 939193 iter, 311879 nodes (gap 0.1%) Improved solution 25.2913997 after 942264 iter, 312792 nodes (gap 0.1%) Improved solution 25.29145133 after 957310 iter, 317361 nodes (gap 0.1%) Improved solution 25.291451332 after 959940 iter, 318230 nodes (gap 0.1%) Improved solution 25.291502956 after 1016027 iter, 336259 nodes (gap 0.1%) Improved solution 25.291502958 after 1019282 iter, 337392 nodes (gap 0.1%) Improved solution 25.291502978 after 1146728 iter, 375091 nodes (gap 0.1%) Improved solution 25.291502984 after 1243495 iter, 398106 nodes (gap 0.1%) Improved solution 25.29155461 after 1369232 iter, 424956 nodes (gap 0.1%) Improved solution 25.29229644 after 1643696 iter, 498086 nodes (gap 0.1%) Improved solution 25.292348086 after 1643742 iter, 498095 nodes (gap 0.1%) Improved solution 25.29234809 after 1643791 iter, 498105 nodes (gap 0.1%) Improved solution 25.292399732 after 1644063 iter, 498161 nodes (gap 0.1%) Improved solution 25.29245137 after 1644676 iter, 498301 nodes (gap 0.1%) Improved solution 25.292503008 after 1646076 iter, 498631 nodes (gap 0.1%) Improved solution 25.29255464 after 1649021 iter, 499369 nodes (gap 0.1%) Improved solution 25.292554642 after 1652455 iter, 500487 nodes (gap 0.1%) Improved solution 25.292606274 after 1656345 iter, 501703 nodes (gap 0.1%) Improved solution 25.2926579 after 1713008 iter, 520925 nodes (gap 0.1%) Improved solution 25.293193138 after 1738309 iter, 529548 nodes (gap 0.1%) Improved solution 25.293244776 after 1738566 iter, 529592 nodes (gap 0.1%) Improved solution 25.293244778 after 1738742 iter, 529618 nodes (gap 0.1%) Improved solution 25.293296416 after 1739005 iter, 529658 nodes (gap 0.1%) Improved solution 25.293296428 after 1739577 iter, 529765 nodes (gap 0.1%) Improved solution 25.29329643 after 1739614 iter, 529771 nodes (gap 0.1%) Improved solution 25.293296432 after 1739767 iter, 529797 nodes (gap 0.1%) Improved solution 25.293348068 after 1739947 iter, 529827 nodes (gap 0.1%) Improved solution 25.29334807 after 1739982 iter, 529833 nodes (gap 0.1%) Improved solution 25.2933997 after 1743268 iter, 530439 nodes (gap 0.1%) Improved solution 25.293399702 after 1743308 iter, 530445 nodes (gap 0.1%) Improved solution 25.29339971 after 1751156 iter, 532178 nodes (gap 0.1%) Improved solution 25.293451342 after 1757854 iter, 533562 nodes (gap 0.1%) Improved solution 25.293502968 after 1862045 iter, 557192 nodes (gap 0.1%) lp_solve optimization was stopped due to time-out. Optimal solution 25.293502968 after 1924625 iter, 571864 nodes (gap 0.1%). Excellent numeric accuracy ||*|| = 4.44089e-16 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 1924625, 175770 (9.1%) were bound flips. There were 285930 refactorizations, 0 triggered by time and 5 by density. ... on average 6.1 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 9212 NZ entries, 1.0x largest basis. The maximum B&B level was 76, 0.1x MIP order, 61 at the optimal solution. The constraint matrix inf-norm is 128, with a dynamic range of 128000. Time to load data was 0.052 seconds, presolve used 0.027 seconds, ... 7199.978 seconds in simplex solver, in total 7200.057 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.046 seconds, presolve used 0.030 seconds, ... 4.632 seconds in simplex solver, in total 4.708 seconds. Vehicle Type: 0 Num:23 Trip segments:116