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 4143 iter. Relaxed solution 386.873789439 after 4435 iter is B&B base. Feasible solution 385.91086569 after 5537 iter, 149 nodes (gap 0.2%) Improved solution 385.910891748 after 5562 iter, 157 nodes (gap 0.2%) Improved solution 385.910917802 after 6788 iter, 435 nodes (gap 0.2%) Improved solution 385.91586569 after 6946 iter, 454 nodes (gap 0.2%) Improved solution 385.915891748 after 6988 iter, 462 nodes (gap 0.2%) Improved solution 385.915917802 after 7259 iter, 542 nodes (gap 0.2%) Improved solution 385.915917804 after 7647 iter, 629 nodes (gap 0.2%) Improved solution 385.915943858 after 7918 iter, 701 nodes (gap 0.2%) Improved solution 385.91594386 after 8621 iter, 889 nodes (gap 0.2%) Improved solution 385.915969914 after 8892 iter, 969 nodes (gap 0.2%) Improved solution 385.920839632 after 11360 iter, 1647 nodes (gap 0.2%) Improved solution 385.92086569 after 11414 iter, 1658 nodes (gap 0.2%) Improved solution 385.920891746 after 11559 iter, 1685 nodes (gap 0.2%) Improved solution 385.920891748 after 11788 iter, 1737 nodes (gap 0.2%) Improved solution 385.920917804 after 11923 iter, 1761 nodes (gap 0.2%) Improved solution 385.920943858 after 12457 iter, 1881 nodes (gap 0.2%) Improved solution 385.92094386 after 12506 iter, 1889 nodes (gap 0.2%) Improved solution 385.920969914 after 12818 iter, 1969 nodes (gap 0.2%) Improved solution 385.920995966 after 21405 iter, 4249 nodes (gap 0.2%) Improved solution 385.920995968 after 36753 iter, 8513 nodes (gap 0.2%) Improved solution 385.921022018 after 37161 iter, 8645 nodes (gap 0.2%) Improved solution 385.92102202 after 78428 iter, 20715 nodes (gap 0.2%) Improved solution 385.921022022 after 154718 iter, 43451 nodes (gap 0.2%) Improved solution 385.921048072 after 154928 iter, 43541 nodes (gap 0.2%) Improved solution 385.921074122 after 471963 iter, 136110 nodes (gap 0.2%) Improved solution 385.92586569 after 518432 iter, 150310 nodes (gap 0.2%) Improved solution 385.925891748 after 518489 iter, 150318 nodes (gap 0.2%) Improved solution 385.925917804 after 518684 iter, 150345 nodes (gap 0.2%) Improved solution 385.925943858 after 519285 iter, 150465 nodes (gap 0.2%) Improved solution 385.92594386 after 519335 iter, 150473 nodes (gap 0.2%) Improved solution 385.925969914 after 519701 iter, 150553 nodes (gap 0.2%) Improved solution 385.925995966 after 520501 iter, 150787 nodes (gap 0.2%) Improved solution 385.925995968 after 522406 iter, 151339 nodes (gap 0.2%) Improved solution 385.926022018 after 522850 iter, 151469 nodes (gap 0.2%) Improved solution 385.92602202 after 545514 iter, 157811 nodes (gap 0.2%) Improved solution 385.926022022 after 554799 iter, 160627 nodes (gap 0.2%) Improved solution 385.926048072 after 555035 iter, 160715 nodes (gap 0.2%) Improved solution 385.926074122 after 747878 iter, 216012 nodes (gap 0.2%) Improved solution 385.92610017 after 1099898 iter, 317104 nodes (gap 0.2%) Improved solution 385.926100172 after 1728571 iter, 507836 nodes (gap 0.2%) Improved solution 385.926126218 after 1731003 iter, 508844 nodes (gap 0.2%) Improved solution 385.94686569 after 1851877 iter, 545456 nodes (gap 0.2%) Improved solution 385.946891748 after 1851976 iter, 545476 nodes (gap 0.2%) Improved solution 385.946917802 after 1852144 iter, 545524 nodes (gap 0.2%) Improved solution 385.946917806 after 1852658 iter, 545631 nodes (gap 0.2%) Improved solution 385.94694386 after 1852721 iter, 545659 nodes (gap 0.2%) Improved solution 385.946969914 after 1853668 iter, 545895 nodes (gap 0.2%) Improved solution 385.95186569 after 1874626 iter, 550650 nodes (gap 0.2%) Improved solution 385.951891748 after 1874686 iter, 550660 nodes (gap 0.2%) Improved solution 385.951917802 after 1874868 iter, 550707 nodes (gap 0.2%) Improved solution 385.951917806 after 1875660 iter, 550882 nodes (gap 0.2%) Improved solution 385.95194386 after 1875769 iter, 550922 nodes (gap 0.2%) Improved solution 385.951969914 after 1877141 iter, 551266 nodes (gap 0.2%) Improved solution 385.951995966 after 1902401 iter, 556919 nodes (gap 0.2%) Improved solution 385.951995968 after 1961654 iter, 570139 nodes (gap 0.2%) Improved solution 385.952022018 after 1964524 iter, 570773 nodes (gap 0.2%) Improved solution 385.95202202 after 2182440 iter, 618382 nodes (gap 0.2%) lp_solve optimization was stopped due to time-out. Optimal solution 385.95202202 after 2198350 iter, 621970 nodes (gap 0.2%). Excellent numeric accuracy ||*|| = 7.10543e-15 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 2198350, 126362 (5.7%) were bound flips. There were 310943 refactorizations, 0 triggered by time and 6 by density. ... on average 6.7 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 9364 NZ entries, 1.0x largest basis. The maximum B&B level was 164, 0.2x MIP order, 150 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.052 seconds, presolve used 0.029 seconds, ... 7199.975 seconds in simplex solver, in total 7200.056 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 ||*|| = 0 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 64, with a dynamic range of 64000. Time to load data was 0.054 seconds, presolve used 0.029 seconds, ... 4.249 seconds in simplex solver, in total 4.332 seconds. Vehicle Type: 0 Num:52 Trip segments:304