Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 7646 constraints, 11381 variables, 32033 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 8712 iter. Relaxed solution 755.148809497 after 9492 iter is B&B base. Feasible solution 753.962851618 after 10338 iter, 38 nodes (gap 0.2%) Improved solution 753.970825805 after 10732 iter, 82 nodes (gap 0.2%) Improved solution 753.987825807 after 11322 iter, 159 nodes (gap 0.2%) Improved solution 753.987838713 after 11420 iter, 167 nodes (gap 0.2%) Improved solution 753.999838713 after 11994 iter, 242 nodes (gap 0.2%) Improved solution 754.003825807 after 14254 iter, 462 nodes (gap 0.2%) Improved solution 754.015774181 after 14651 iter, 495 nodes (gap 0.1%) Improved solution 754.015799994 after 14711 iter, 500 nodes (gap 0.1%) Improved solution 754.015825807 after 14784 iter, 507 nodes (gap 0.1%) Improved solution 754.020864526 after 16256 iter, 637 nodes (gap 0.1%) Improved solution 754.02178709 after 17267 iter, 702 nodes (gap 0.1%) Improved solution 754.02178709 after 17436 iter, 716 nodes (gap 0.1%) Improved solution 754.026838712 after 18694 iter, 789 nodes (gap 0.1%) Improved solution 754.026864527 after 18783 iter, 796 nodes (gap 0.1%) Improved solution 754.028825809 after 19130 iter, 827 nodes (gap 0.1%) Improved solution 754.028838717 after 19294 iter, 843 nodes (gap 0.1%) Improved solution 754.041851621 after 19661 iter, 868 nodes (gap 0.1%) Improved solution 754.041851621 after 19684 iter, 870 nodes (gap 0.1%) Improved solution 754.047838715 after 20501 iter, 933 nodes (gap 0.1%) Improved solution 754.063812905 after 22846 iter, 1083 nodes (gap 0.1%) Improved solution 754.073812905 after 26790 iter, 1383 nodes (gap 0.1%) Improved solution 754.094864529 after 27021 iter, 1403 nodes (gap 0.1%) Improved solution 754.099877432 after 32179 iter, 1723 nodes (gap 0.1%) Improved solution 754.105877434 after 32672 iter, 1756 nodes (gap 0.1%) Improved solution 754.110864531 after 34921 iter, 1897 nodes (gap 0.1%) Improved solution 754.112774189 after 37385 iter, 2059 nodes (gap 0.1%) Improved solution 754.112825811 after 37726 iter, 2083 nodes (gap 0.1%) Improved solution 754.112825814 after 39020 iter, 2172 nodes (gap 0.1%) Improved solution 754.119851625 after 39161 iter, 2185 nodes (gap 0.1%) Improved solution 754.122864529 after 49013 iter, 2914 nodes (gap 0.1%) Improved solution 754.12286453 after 49020 iter, 2916 nodes (gap 0.1%) Improved solution 754.123851624 after 51917 iter, 3145 nodes (gap 0.1%) Improved solution 754.137787095 after 53702 iter, 3281 nodes (gap 0.1%) Improved solution 754.144812906 after 54130 iter, 3324 nodes (gap 0.1%) Improved solution 754.147800001 after 55640 iter, 3451 nodes (gap 0.1%) Improved solution 754.155825815 after 56834 iter, 3583 nodes (gap 0.1%) Improved solution 754.162851626 after 58687 iter, 3804 nodes (gap 0.1%) Improved solution 754.163825814 after 72865 iter, 4968 nodes (gap 0.1%) Improved solution 754.165800001 after 73100 iter, 4988 nodes (gap 0.1%) Improved solution 754.169864533 after 73507 iter, 5032 nodes (gap 0.1%) Improved solution 754.175877438 after 73921 iter, 5060 nodes (gap 0.1%) Improved solution 754.183864535 after 75299 iter, 5196 nodes (gap 0.1%) Improved solution 754.190800009 after 82143 iter, 5697 nodes (gap 0.1%) Improved solution 754.190800009 after 83080 iter, 5785 nodes (gap 0.1%) Improved solution 754.192838717 after 162491 iter, 12437 nodes (gap 0.1%) Improved solution 754.200825814 after 162598 iter, 12452 nodes (gap 0.1%) Improved solution 754.207761288 after 164008 iter, 12570 nodes (gap 0.1%) Improved solution 754.208761285 after 208891 iter, 16232 nodes (gap 0.1%) Improved solution 754.208799998 after 208949 iter, 16237 nodes (gap 0.1%) Improved solution 754.213774191 after 209141 iter, 16253 nodes (gap 0.1%) Improved solution 754.221838718 after 257205 iter, 19647 nodes (gap 0.1%) Improved solution 754.226812906 after 258995 iter, 19763 nodes (gap 0.1%) Improved solution 754.231825811 after 259255 iter, 19783 nodes (gap 0.1%) Improved solution 754.232787098 after 288427 iter, 21771 nodes (gap 0.1%) Improved solution 754.232787098 after 288666 iter, 21802 nodes (gap 0.1%) Improved solution 754.233787097 after 289142 iter, 21838 nodes (gap 0.1%) Improved solution 754.233787098 after 289197 iter, 21845 nodes (gap 0.1%) Improved solution 754.235748381 after 290310 iter, 21968 nodes (gap 0.1%) Improved solution 754.239748388 after 384110 iter, 28462 nodes (gap 0.1%) Improved solution 754.25180001 after 384628 iter, 28504 nodes (gap 0.1%) Improved solution 754.25280001 after 384800 iter, 28518 nodes (gap 0.1%) Improved solution 754.252877443 after 609551 iter, 44217 nodes (gap 0.1%) Improved solution 754.266851632 after 609607 iter, 44223 nodes (gap 0.1%) Improved solution 754.271812916 after 617517 iter, 44861 nodes (gap 0.1%) Improved solution 754.27582582 after 995598 iter, 72317 nodes (gap 0.1%) Improved solution 754.276825819 after 1023118 iter, 74233 nodes (gap 0.1%) Improved solution 754.281761292 after 1023759 iter, 74270 nodes (gap 0.1%) Improved solution 754.298787103 after 1023919 iter, 74281 nodes (gap 0.1%) Improved solution 754.302774196 after 1062990 iter, 77004 nodes (gap 0.1%) Improved solution 754.303774196 after 1143739 iter, 82790 nodes (gap 0.1%) lp_solve optimization was stopped due to time-out. Optimal solution 754.303774196 after 1174796 iter, 84900 nodes (gap 0.1%). Excellent numeric accuracy ||*|| = 1.77636e-15 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 1174796, 84960 (7.2%) were bound flips. There were 42486 refactorizations, 0 triggered by time and 5 by density. ... on average 25.7 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 22024 NZ entries, 1.0x largest basis. The maximum B&B level was 66, 0.0x MIP order, 48 at the optimal solution. The constraint matrix inf-norm is 128, with a dynamic range of 128000. Time to load data was 0.199 seconds, presolve used 0.083 seconds, ... 7199.925 seconds in simplex solver, in total 7200.207 seconds. Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 7646 constraints, 11381 variables, 32033 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 3376 iter is B&B base. Feasible solution 0 after 3376 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 3376 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 3376, 0 (0.0%) were bound flips. There were 15 refactorizations, 0 triggered by time and 0 by density. ... on average 225.1 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 14150 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.225 seconds, presolve used 0.073 seconds, ... 30.662 seconds in simplex solver, in total 30.960 seconds. Vehicle Type: 0 Num:28 Trip segments:95