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 7525 iter. Relaxed solution 21.201993124 after 8313 iter is B&B base. Feasible solution 21.184925065 after 8759 iter, 33 nodes (gap 0.1%) Improved solution 21.184928687 after 8774 iter, 36 nodes (gap 0.1%) Improved solution 21.184930489 after 8924 iter, 55 nodes (gap 0.1%) Improved solution 21.184931394 after 12123 iter, 494 nodes (gap 0.1%) Improved solution 21.184932301 after 12300 iter, 517 nodes (gap 0.1%) Improved solution 21.18493501 after 12773 iter, 587 nodes (gap 0.1%) Improved solution 21.186927783 after 14529 iter, 799 nodes (gap 0.1%) Improved solution 21.186929585 after 14556 iter, 806 nodes (gap 0.1%) Improved solution 21.186931397 after 16033 iter, 992 nodes (gap 0.1%) Improved solution 21.186934106 after 16181 iter, 1012 nodes (gap 0.1%) Improved solution 21.186934115 after 19369 iter, 1450 nodes (gap 0.1%) Improved solution 21.186935917 after 19660 iter, 1502 nodes (gap 0.1%) Improved solution 21.186936824 after 19689 iter, 1508 nodes (gap 0.1%) Improved solution 21.186937722 after 21870 iter, 1810 nodes (gap 0.1%) Improved solution 21.186938629 after 28770 iter, 2642 nodes (gap 0.1%) Improved solution 21.186939527 after 31574 iter, 2998 nodes (gap 0.1%) Improved solution 21.186939529 after 35184 iter, 3479 nodes (gap 0.1%) Improved solution 21.186940435 after 67698 iter, 7771 nodes (gap 0.1%) Improved solution 21.186941333 after 72948 iter, 8543 nodes (gap 0.1%) Improved solution 21.187930491 after 75879 iter, 8972 nodes (gap 0.1%) Improved solution 21.187931397 after 75909 iter, 8978 nodes (gap 0.1%) Improved solution 21.187935923 after 76049 iter, 9002 nodes (gap 0.1%) Improved solution 21.18793683 after 78096 iter, 9390 nodes (gap 0.1%) Improved solution 21.187939539 after 79860 iter, 9689 nodes (gap 0.1%) Improved solution 21.187940437 after 81012 iter, 9899 nodes (gap 0.1%) Improved solution 21.187941344 after 83308 iter, 10273 nodes (gap 0.1%) Improved solution 21.187942242 after 86492 iter, 10861 nodes (gap 0.1%) Improved solution 21.187943146 after 190707 iter, 24496 nodes (gap 0.1%) Improved solution 21.187944053 after 206553 iter, 26689 nodes (gap 0.1%) Improved solution 21.187944054 after 245239 iter, 32733 nodes (gap 0.1%) Improved solution 21.187944949 after 529592 iter, 74407 nodes (gap 0.1%) Improved solution 21.187944954 after 541450 iter, 76424 nodes (gap 0.1%) Improved solution 21.188930496 after 823168 iter, 117329 nodes (gap 0.1%) Improved solution 21.188932298 after 823216 iter, 117334 nodes (gap 0.1%) Improved solution 21.188934112 after 823257 iter, 117339 nodes (gap 0.1%) Improved solution 21.188934115 after 823884 iter, 117421 nodes (gap 0.1%) Improved solution 21.188935917 after 824003 iter, 117436 nodes (gap 0.1%) Improved solution 21.188937726 after 824032 iter, 117441 nodes (gap 0.1%) Improved solution 21.188937729 after 825486 iter, 117616 nodes (gap 0.1%) Improved solution 21.188939531 after 825511 iter, 117621 nodes (gap 0.1%) Improved solution 21.188940438 after 829434 iter, 118079 nodes (gap 0.1%) Improved solution 21.18894224 after 829497 iter, 118090 nodes (gap 0.1%) Improved solution 21.189938623 after 837300 iter, 119100 nodes (gap 0.1%) Improved solution 21.189942242 after 837321 iter, 119106 nodes (gap 0.1%) Improved solution 21.189943149 after 838175 iter, 119252 nodes (gap 0.1%) Improved solution 21.189944952 after 842819 iter, 120142 nodes (gap 0.1%) Improved solution 21.189944961 after 852367 iter, 121480 nodes (gap 0.1%) Improved solution 21.189946761 after 876562 iter, 125735 nodes (gap 0.1%) Improved solution 21.189946763 after 877956 iter, 125974 nodes (gap 0.1%) Improved solution 21.190938628 after 894661 iter, 128130 nodes (gap 0.0%) Improved solution 21.190939534 after 894721 iter, 128141 nodes (gap 0.0%) Improved solution 21.190939537 after 894885 iter, 128163 nodes (gap 0.0%) Improved solution 21.190940433 after 896175 iter, 128339 nodes (gap 0.0%) Improved solution 21.190940435 after 896244 iter, 128351 nodes (gap 0.0%) Improved solution 21.190942246 after 896280 iter, 128357 nodes (gap 0.0%) Improved solution 21.190942249 after 896473 iter, 128386 nodes (gap 0.0%) Improved solution 21.190944044 after 900582 iter, 129005 nodes (gap 0.0%) Improved solution 21.190944047 after 900803 iter, 129042 nodes (gap 0.0%) Improved solution 21.190944049 after 901068 iter, 129087 nodes (gap 0.0%) Improved solution 21.190945853 after 937009 iter, 133927 nodes (gap 0.0%) Improved solution 21.190945858 after 937818 iter, 134079 nodes (gap 0.0%) lp_solve optimization was stopped due to time-out. Optimal solution 21.190945858 after 976042 iter, 139776 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 976042, 82211 (8.4%) were bound flips. There were 69920 refactorizations, 0 triggered by time and 3 by density. ... on average 12.8 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 22077 NZ entries, 1.0x largest basis. The maximum B&B level was 46, 0.0x MIP order, 32 at the optimal solution. The constraint matrix inf-norm is 8, with a dynamic range of 8000. Time to load data was 0.170 seconds, presolve used 0.069 seconds, ... 7199.940 seconds in simplex solver, in total 7200.179 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 105 iter. Relaxed solution 0 after 3479 iter is B&B base. Feasible solution 0 after 3479 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 3479 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 3479, 0 (0.0%) were bound flips. There were 16 refactorizations, 0 triggered by time and 0 by density. ... on average 217.4 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 14574 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.182 seconds, presolve used 0.105 seconds, ... 33.279 seconds in simplex solver, in total 33.566 seconds. Vehicle Type: 0 Num:24 Trip segments:60