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 3866 iter. Relaxed solution 21.1879926851 after 4408 iter is B&B base. Feasible solution 21.157427686 after 5256 iter, 42 nodes (gap 0.1%) Improved solution 21.157453708 after 9457 iter, 638 nodes (gap 0.1%) Improved solution 21.159466725 after 10025 iter, 697 nodes (gap 0.1%) Improved solution 21.159492749 after 10107 iter, 705 nodes (gap 0.1%) Improved solution 21.15950576 after 10570 iter, 746 nodes (gap 0.1%) Improved solution 21.160388649 after 140697 iter, 13951 nodes (gap 0.1%) Improved solution 21.160414675 after 140978 iter, 13981 nodes (gap 0.1%) Improved solution 21.160427682 after 141198 iter, 13999 nodes (gap 0.1%) Improved solution 21.160440697 after 141663 iter, 14055 nodes (gap 0.1%) Improved solution 21.160466721 after 141732 iter, 14065 nodes (gap 0.1%) Improved solution 21.160479732 after 142382 iter, 14114 nodes (gap 0.1%) Improved solution 21.160492737 after 185332 iter, 19169 nodes (gap 0.1%) Improved solution 21.160492739 after 280236 iter, 28220 nodes (gap 0.1%) Improved solution 21.16050575 after 331439 iter, 32439 nodes (gap 0.1%) Improved solution 21.160505752 after 346956 iter, 33725 nodes (gap 0.1%) Improved solution 21.160518757 after 433217 iter, 43157 nodes (gap 0.1%) Improved solution 21.161440683 after 434495 iter, 43293 nodes (gap 0.1%) Improved solution 21.161466709 after 434638 iter, 43315 nodes (gap 0.1%) Improved solution 21.16147972 after 435001 iter, 43354 nodes (gap 0.1%) Improved solution 21.161492731 after 436108 iter, 43459 nodes (gap 0.1%) Improved solution 21.161492733 after 455836 iter, 45232 nodes (gap 0.1%) Improved solution 21.161505744 after 456062 iter, 45262 nodes (gap 0.1%) Improved solution 21.161505756 after 512494 iter, 51360 nodes (gap 0.1%) Improved solution 21.162453702 after 582900 iter, 59757 nodes (gap 0.1%) Improved solution 21.162453704 after 583127 iter, 59772 nodes (gap 0.1%) Improved solution 21.16247973 after 583152 iter, 59775 nodes (gap 0.1%) Improved solution 21.162505752 after 584527 iter, 59862 nodes (gap 0.1%) Improved solution 21.162518763 after 592912 iter, 60645 nodes (gap 0.1%) Improved solution 21.16253177 after 717310 iter, 74283 nodes (gap 0.1%) Improved solution 21.163466709 after 721529 iter, 74796 nodes (gap 0.1%) Improved solution 21.163466711 after 721681 iter, 74806 nodes (gap 0.1%) Improved solution 21.163492737 after 721771 iter, 74818 nodes (gap 0.1%) Improved solution 21.163518759 after 722883 iter, 74913 nodes (gap 0.1%) Improved solution 21.16353177 after 769677 iter, 79567 nodes (gap 0.1%) Improved solution 21.164375612 after 837187 iter, 87641 nodes (gap 0.1%) Improved solution 21.164401638 after 837205 iter, 87643 nodes (gap 0.1%) Improved solution 21.164401642 after 837332 iter, 87651 nodes (gap 0.1%) Improved solution 21.164414649 after 837358 iter, 87655 nodes (gap 0.1%) Improved solution 21.164414655 after 837479 iter, 87663 nodes (gap 0.1%) Improved solution 21.164440681 after 837505 iter, 87665 nodes (gap 0.1%) Improved solution 21.164453692 after 838281 iter, 87715 nodes (gap 0.1%) Improved solution 21.164466707 after 838749 iter, 87746 nodes (gap 0.1%) Improved solution 21.164479714 after 840556 iter, 87881 nodes (gap 0.1%) Improved solution 21.164492729 after 841013 iter, 87912 nodes (gap 0.1%) Improved solution 21.164505744 after 842295 iter, 88049 nodes (gap 0.1%) Improved solution 21.164518755 after 854257 iter, 89281 nodes (gap 0.1%) Improved solution 21.164531766 after 858555 iter, 89819 nodes (gap 0.1%) Improved solution 21.164544773 after 898864 iter, 93670 nodes (gap 0.1%) Improved solution 21.165440683 after 945474 iter, 98773 nodes (gap 0.1%) Improved solution 21.165466711 after 945499 iter, 98775 nodes (gap 0.1%) Improved solution 21.165492733 after 945912 iter, 98809 nodes (gap 0.1%) Improved solution 21.165518757 after 946503 iter, 98872 nodes (gap 0.1%) Improved solution 21.165518761 after 958688 iter, 100170 nodes (gap 0.1%) Improved solution 21.165531772 after 959660 iter, 100260 nodes (gap 0.1%) Improved solution 21.16647972 after 967418 iter, 101332 nodes (gap 0.1%) Improved solution 21.166505742 after 967557 iter, 101356 nodes (gap 0.1%) Improved solution 21.166531764 after 968223 iter, 101457 nodes (gap 0.1%) Improved solution 21.166544769 after 993768 iter, 104088 nodes (gap 0.1%) Improved solution 21.16655778 after 1019924 iter, 106932 nodes (gap 0.1%) Improved solution 21.166570779 after 1063581 iter, 111443 nodes (gap 0.1%) Improved solution 21.16747972 after 1129079 iter, 115954 nodes (gap 0.1%) Improved solution 21.167505742 after 1129320 iter, 115968 nodes (gap 0.1%) Improved solution 21.167518753 after 1132483 iter, 116276 nodes (gap 0.1%) Improved solution 21.167531764 after 1134176 iter, 116423 nodes (gap 0.1%) Improved solution 21.167544767 after 1137213 iter, 116758 nodes (gap 0.1%) Improved solution 21.167544769 after 1141665 iter, 117217 nodes (gap 0.1%) Improved solution 21.16755778 after 1158042 iter, 119113 nodes (gap 0.1%) Improved solution 21.167570777 after 1163744 iter, 119877 nodes (gap 0.1%) Improved solution 21.167570779 after 1204767 iter, 124026 nodes (gap 0.1%) Improved solution 21.16758378 after 1224421 iter, 126046 nodes (gap 0.1%) Improved solution 21.167583786 after 1291417 iter, 130944 nodes (gap 0.1%) Improved solution 21.167583788 after 1319061 iter, 133736 nodes (gap 0.1%) Improved solution 21.16758379 after 1319428 iter, 133775 nodes (gap 0.1%) Improved solution 21.167596793 after 1382696 iter, 140398 nodes (gap 0.1%) Improved solution 21.168479722 after 1513215 iter, 149376 nodes (gap 0.1%) Improved solution 21.168505744 after 1513423 iter, 149390 nodes (gap 0.1%) Improved solution 21.168531766 after 1514560 iter, 149489 nodes (gap 0.1%) Improved solution 21.168557778 after 1522729 iter, 150450 nodes (gap 0.1%) Improved solution 21.168570783 after 1526812 iter, 150909 nodes (gap 0.1%) Improved solution 21.168570785 after 1527095 iter, 150950 nodes (gap 0.1%) Improved solution 21.168583784 after 1637232 iter, 163327 nodes (gap 0.1%) Improved solution 21.16858379 after 1653693 iter, 165140 nodes (gap 0.1%) Improved solution 21.168596793 after 1658530 iter, 165781 nodes (gap 0.1%) Improved solution 21.168596795 after 1658811 iter, 165825 nodes (gap 0.1%) Improved solution 21.168609798 after 1743875 iter, 175133 nodes (gap 0.1%) lp_solve optimization was stopped due to time-out. Optimal solution 21.168609798 after 2868399 iter, 272478 nodes (gap 0.1%). Excellent numeric accuracy ||*|| = 8.88178e-16 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 2868399, 261661 (9.1%) were bound flips. There were 136333 refactorizations, 0 triggered by time and 76 by density. ... on average 19.1 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 10124 NZ entries, 1.0x largest basis. The maximum B&B level was 64, 0.1x MIP order, 50 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.060 seconds, presolve used 0.034 seconds, ... 7199.970 seconds in simplex solver, in total 7200.064 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 2 iter. Relaxed solution 0 after 1558 iter is B&B base. Feasible solution 0 after 1558 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1558 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 1558, 0 (0.0%) were bound flips. There were 8 refactorizations, 0 triggered by time and 0 by density. ... on average 194.8 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 6528 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.058 seconds, presolve used 0.033 seconds, ... 5.049 seconds in simplex solver, in total 5.140 seconds. Vehicle Type: 0 Num:15 Trip segments:60