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 4013 iter. Relaxed solution 26.2439907556 after 4450 iter is B&B base. Feasible solution 26.215913236 after 5503 iter, 45 nodes (gap 0.1%) Improved solution 26.21591686 after 5525 iter, 46 nodes (gap 0.1%) Improved solution 26.215916862 after 6683 iter, 107 nodes (gap 0.1%) Improved solution 26.215920486 after 6713 iter, 108 nodes (gap 0.1%) Improved solution 26.216920486 after 7568 iter, 155 nodes (gap 0.1%) Improved solution 26.216922299 after 8528 iter, 260 nodes (gap 0.1%) Improved solution 26.216924112 after 10488 iter, 443 nodes (gap 0.1%) Improved solution 26.216925923 after 13782 iter, 808 nodes (gap 0.1%) Improved solution 26.216927734 after 21868 iter, 1705 nodes (gap 0.1%) Improved solution 26.216929545 after 27499 iter, 2412 nodes (gap 0.1%) Improved solution 26.216931356 after 42975 iter, 3953 nodes (gap 0.1%) Improved solution 26.216933167 after 53505 iter, 5136 nodes (gap 0.1%) Improved solution 26.216934978 after 64512 iter, 5858 nodes (gap 0.1%) Improved solution 26.216936789 after 65285 iter, 5968 nodes (gap 0.1%) Improved solution 26.219929551 after 66688 iter, 6057 nodes (gap 0.1%) Improved solution 26.220931364 after 70231 iter, 6421 nodes (gap 0.1%) Improved solution 26.220933175 after 70325 iter, 6437 nodes (gap 0.1%) Improved solution 26.221933173 after 80935 iter, 7391 nodes (gap 0.1%) Improved solution 26.221934984 after 82011 iter, 7474 nodes (gap 0.1%) Improved solution 26.221936795 after 82596 iter, 7526 nodes (gap 0.1%) Improved solution 26.222936797 after 82729 iter, 7539 nodes (gap 0.1%) Improved solution 26.222938608 after 82870 iter, 7565 nodes (gap 0.1%) Improved solution 26.223933171 after 83835 iter, 7653 nodes (gap 0.1%) Improved solution 26.223936793 after 84196 iter, 7703 nodes (gap 0.1%) Improved solution 26.2239386 after 85141 iter, 7834 nodes (gap 0.1%) Improved solution 26.223940411 after 85866 iter, 7916 nodes (gap 0.1%) Improved solution 26.223942214 after 104682 iter, 10408 nodes (gap 0.1%) Improved solution 26.224933167 after 124953 iter, 12487 nodes (gap 0.1%) Improved solution 26.224936789 after 125815 iter, 12581 nodes (gap 0.1%) Improved solution 26.224940405 after 131588 iter, 13300 nodes (gap 0.1%) Improved solution 26.224940407 after 132165 iter, 13365 nodes (gap 0.1%) Improved solution 26.224942212 after 147692 iter, 15192 nodes (gap 0.1%) Improved solution 26.225931352 after 160126 iter, 16613 nodes (gap 0.1%) Improved solution 26.225934976 after 160169 iter, 16617 nodes (gap 0.1%) Improved solution 26.225938598 after 160603 iter, 16647 nodes (gap 0.1%) Improved solution 26.225942214 after 175758 iter, 17958 nodes (gap 0.1%) Improved solution 26.225944019 after 196178 iter, 19763 nodes (gap 0.1%) Improved solution 26.226934978 after 206837 iter, 20718 nodes (gap 0.1%) Improved solution 26.2269386 after 206892 iter, 20724 nodes (gap 0.1%) Improved solution 26.226940405 after 211495 iter, 21193 nodes (gap 0.1%) Improved solution 26.226942216 after 212687 iter, 21319 nodes (gap 0.1%) Improved solution 26.226942218 after 213612 iter, 21385 nodes (gap 0.1%) Improved solution 26.226944021 after 227429 iter, 22950 nodes (gap 0.1%) Improved solution 26.226944023 after 304396 iter, 31338 nodes (gap 0.1%) Improved solution 26.22694583 after 355215 iter, 37061 nodes (gap 0.1%) Improved solution 26.226947635 after 374869 iter, 39368 nodes (gap 0.1%) Improved solution 26.227936779 after 437879 iter, 46846 nodes (gap 0.1%) Improved solution 26.227936785 after 438022 iter, 46868 nodes (gap 0.1%) Improved solution 26.227938588 after 438500 iter, 46929 nodes (gap 0.1%) Improved solution 26.227938596 after 438775 iter, 46960 nodes (gap 0.1%) Improved solution 26.227940401 after 439377 iter, 47035 nodes (gap 0.1%) Improved solution 26.227942206 after 440596 iter, 47174 nodes (gap 0.1%) Improved solution 26.22794221 after 442937 iter, 47433 nodes (gap 0.1%) Improved solution 26.227944011 after 450315 iter, 48231 nodes (gap 0.1%) Improved solution 26.227944025 after 453131 iter, 48560 nodes (gap 0.1%) Improved solution 26.227945822 after 456284 iter, 49014 nodes (gap 0.1%) Improved solution 26.227945826 after 456937 iter, 49105 nodes (gap 0.1%) Improved solution 26.22794583 after 460659 iter, 49558 nodes (gap 0.1%) Improved solution 26.227947627 after 463364 iter, 49915 nodes (gap 0.1%) Improved solution 26.228938598 after 466454 iter, 50276 nodes (gap 0.1%) Improved solution 26.228942216 after 466559 iter, 50287 nodes (gap 0.1%) Improved solution 26.228944025 after 473344 iter, 51020 nodes (gap 0.1%) Improved solution 26.228945822 after 478694 iter, 51652 nodes (gap 0.1%) Improved solution 26.228945826 after 479920 iter, 51808 nodes (gap 0.1%) Improved solution 26.22894583 after 494436 iter, 53516 nodes (gap 0.1%) Improved solution 26.228947627 after 500281 iter, 54210 nodes (gap 0.1%) Improved solution 26.228947637 after 525966 iter, 57583 nodes (gap 0.1%) Improved solution 26.22894944 after 539740 iter, 59248 nodes (gap 0.1%) Improved solution 26.228949442 after 600894 iter, 67440 nodes (gap 0.1%) Improved solution 26.228951245 after 630413 iter, 71029 nodes (gap 0.1%) Improved solution 26.229938602 after 809460 iter, 95822 nodes (gap 0.1%) Improved solution 26.229940413 after 809508 iter, 95827 nodes (gap 0.1%) Improved solution 26.229942218 after 809812 iter, 95856 nodes (gap 0.1%) Improved solution 26.230940407 after 809973 iter, 95875 nodes (gap 0.0%) Improved solution 26.23094221 after 811246 iter, 95997 nodes (gap 0.0%) Improved solution 26.230942214 after 811628 iter, 96036 nodes (gap 0.0%) Improved solution 26.230944019 after 812030 iter, 96078 nodes (gap 0.0%) Improved solution 26.230945826 after 813257 iter, 96211 nodes (gap 0.0%) Improved solution 26.230945828 after 850712 iter, 100497 nodes (gap 0.0%) Improved solution 26.230947635 after 869946 iter, 102840 nodes (gap 0.0%) Improved solution 26.23094944 after 897934 iter, 106565 nodes (gap 0.0%) Improved solution 26.230949442 after 932940 iter, 111539 nodes (gap 0.0%) Improved solution 26.230949444 after 1005530 iter, 122085 nodes (gap 0.0%) Improved solution 26.230951251 after 1028218 iter, 125473 nodes (gap 0.0%) Improved solution 26.230953056 after 1071022 iter, 132193 nodes (gap 0.0%) Improved solution 26.230954861 after 1371727 iter, 178684 nodes (gap 0.0%) Improved solution 26.230954865 after 1811358 iter, 240904 nodes (gap 0.0%) Improved solution 26.230956672 after 2206060 iter, 290656 nodes (gap 0.0%) lp_solve optimization was stopped due to time-out. Optimal solution 26.230956672 after 2598634 iter, 341952 nodes (gap 0.0%). Excellent numeric accuracy ||*|| = 1.27936e-16 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 2598634, 211074 (8.1%) were bound flips. There were 171046 refactorizations, 0 triggered by time and 58 by density. ... on average 14.0 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 10175 NZ entries, 1.0x largest basis. The maximum B&B level was 64, 0.1x 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.067 seconds, presolve used 0.036 seconds, ... 7199.968 seconds in simplex solver, in total 7200.071 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 105 iter. Relaxed solution 0 after 1661 iter is B&B base. Feasible solution 0 after 1661 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1661 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 1661, 0 (0.0%) were bound flips. There were 9 refactorizations, 0 triggered by time and 0 by density. ... on average 184.6 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 6954 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.055 seconds, presolve used 0.040 seconds, ... 5.455 seconds in simplex solver, in total 5.550 seconds. Vehicle Type: 0 Num:20 Trip segments:48