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 4132 iter. Relaxed solution 399.997779021 after 4425 iter is B&B base. Feasible solution 364.83568805 after 6270 iter, 307 nodes (gap 8.8%) Improved solution 374.855223128 after 6520 iter, 326 nodes (gap 6.3%) Improved solution 374.85527479 after 6551 iter, 332 nodes (gap 6.3%) Improved solution 374.85532645 after 6589 iter, 342 nodes (gap 6.3%) Improved solution 374.855378108 after 6652 iter, 356 nodes (gap 6.3%) Improved solution 374.855429766 after 6721 iter, 370 nodes (gap 6.3%) Improved solution 374.855481424 after 6794 iter, 386 nodes (gap 6.3%) Improved solution 374.85553308 after 6883 iter, 408 nodes (gap 6.3%) Improved solution 374.855584734 after 7023 iter, 442 nodes (gap 6.3%) Improved solution 374.855636388 after 7162 iter, 476 nodes (gap 6.3%) Improved solution 374.855636392 after 7390 iter, 546 nodes (gap 6.3%) Improved solution 374.855688046 after 7529 iter, 580 nodes (gap 6.3%) Improved solution 374.85568805 after 7865 iter, 690 nodes (gap 6.3%) Improved solution 374.855739704 after 8004 iter, 724 nodes (gap 6.3%) Improved solution 374.855791358 after 8490 iter, 860 nodes (gap 6.3%) Improved solution 374.855843012 after 8976 iter, 996 nodes (gap 6.3%) Improved solution 374.855894666 after 9242 iter, 1074 nodes (gap 6.3%) Improved solution 374.855946318 after 9552 iter, 1170 nodes (gap 6.3%) Improved solution 374.855997968 after 9991 iter, 1322 nodes (gap 6.3%) Improved solution 374.856049618 after 10430 iter, 1474 nodes (gap 6.3%) Improved solution 374.856101268 after 10869 iter, 1626 nodes (gap 6.3%) Improved solution 374.875533084 after 11310 iter, 1726 nodes (gap 6.3%) Improved solution 374.875584742 after 11337 iter, 1732 nodes (gap 6.3%) Improved solution 374.875636398 after 11374 iter, 1742 nodes (gap 6.3%) Improved solution 374.875688052 after 11430 iter, 1756 nodes (gap 6.3%) Improved solution 374.875739706 after 11485 iter, 1770 nodes (gap 6.3%) Improved solution 374.87579136 after 11793 iter, 1864 nodes (gap 6.3%) Improved solution 374.875843014 after 12100 iter, 1958 nodes (gap 6.3%) Improved solution 374.875894668 after 12263 iter, 2010 nodes (gap 6.3%) Improved solution 374.87594632 after 12471 iter, 2080 nodes (gap 6.3%) Improved solution 374.87599797 after 12782 iter, 2188 nodes (gap 6.3%) Improved solution 374.87604962 after 13093 iter, 2296 nodes (gap 6.3%) Improved solution 374.87610127 after 13404 iter, 2404 nodes (gap 6.3%) Improved solution 374.876101274 after 14062 iter, 2654 nodes (gap 6.3%) Improved solution 374.876152924 after 14390 iter, 2770 nodes (gap 6.3%) Improved solution 374.876152928 after 15478 iter, 3188 nodes (gap 6.3%) Improved solution 374.876204578 after 15826 iter, 3304 nodes (gap 6.3%) Improved solution 374.876256224 after 30072 iter, 8202 nodes (gap 6.3%) Improved solution 374.87630787 after 45167 iter, 13402 nodes (gap 6.3%) Improved solution 374.876307872 after 57858 iter, 18152 nodes (gap 6.3%) Improved solution 374.876359518 after 60365 iter, 19190 nodes (gap 6.3%) Improved solution 374.876411164 after 78043 iter, 25990 nodes (gap 6.3%) Improved solution 374.87646281 after 95721 iter, 32790 nodes (gap 6.3%) Improved solution 383.904274794 after 117886 iter, 40721 nodes (gap 4.0%) Improved solution 383.904326452 after 117941 iter, 40733 nodes (gap 4.0%) Improved solution 383.90437811 after 118004 iter, 40747 nodes (gap 4.0%) Improved solution 383.904429768 after 118072 iter, 40761 nodes (gap 4.0%) Improved solution 383.904481426 after 118140 iter, 40775 nodes (gap 4.0%) Improved solution 383.90453308 after 118275 iter, 40800 nodes (gap 4.0%) Improved solution 383.904584734 after 118401 iter, 40822 nodes (gap 4.0%) Improved solution 383.904584738 after 118538 iter, 40852 nodes (gap 4.0%) Improved solution 383.904636392 after 118664 iter, 40874 nodes (gap 4.0%) Improved solution 383.904636396 after 118874 iter, 40922 nodes (gap 4.0%) Improved solution 383.90468805 after 119000 iter, 40944 nodes (gap 4.0%) Improved solution 383.904739704 after 119307 iter, 41010 nodes (gap 4.0%) Improved solution 383.904791358 after 119614 iter, 41076 nodes (gap 4.0%) Improved solution 383.90484301 after 120176 iter, 41226 nodes (gap 4.0%) Improved solution 383.904843012 after 120317 iter, 41266 nodes (gap 4.0%) Improved solution 383.904894664 after 120564 iter, 41350 nodes (gap 4.0%) Improved solution 383.904894666 after 120821 iter, 41428 nodes (gap 4.0%) Improved solution 383.904946316 after 121060 iter, 41512 nodes (gap 4.0%) Improved solution 383.904997966 after 121681 iter, 41712 nodes (gap 4.0%) Improved solution 383.905049616 after 122301 iter, 41912 nodes (gap 4.0%) Improved solution 383.90504962 after 123172 iter, 42186 nodes (gap 4.0%) Improved solution 383.90510127 after 123808 iter, 42402 nodes (gap 4.0%) Improved solution 383.905101274 after 125195 iter, 42847 nodes (gap 4.0%) Improved solution 383.905152924 after 125802 iter, 43061 nodes (gap 4.0%) Improved solution 383.905204574 after 129751 iter, 44359 nodes (gap 4.0%) Improved solution 383.90525622 after 163751 iter, 54447 nodes (gap 4.0%) Improved solution 383.905307866 after 199359 iter, 65035 nodes (gap 4.0%) Improved solution 383.90530787 after 211684 iter, 68877 nodes (gap 4.0%) Improved solution 383.905359516 after 218797 iter, 71343 nodes (gap 4.0%) Improved solution 383.905411162 after 305686 iter, 102287 nodes (gap 4.0%) Improved solution 383.905462808 after 405708 iter, 138555 nodes (gap 4.0%) Improved solution 383.905514454 after 506457 iter, 175135 nodes (gap 4.0%) Improved solution 383.905514458 after 758633 iter, 269903 nodes (gap 4.0%) Improved solution 383.905566104 after 988922 iter, 366115 nodes (gap 4.0%) Improved solution 383.905566108 after 1458876 iter, 551404 nodes (gap 4.0%) Improved solution 383.905617754 after 1480643 iter, 559838 nodes (gap 4.0%) lp_solve optimization was stopped due to time-out. Optimal solution 383.905617754 after 1806975 iter, 690593 nodes (gap 4.0%). Excellent numeric accuracy ||*|| = 5.44703e-16 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 1806975, 189597 (10.5%) were bound flips. There were 345193 refactorizations, 0 triggered by time and 7 by density. ... on average 4.7 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 9252 NZ entries, 1.0x largest basis. The maximum B&B level was 328, 0.4x MIP order, 286 at the optimal solution. The constraint matrix inf-norm is 128, with a dynamic range of 128000. Time to load data was 0.700 seconds, presolve used 0.035 seconds, ... 7199.970 seconds in simplex solver, in total 7200.705 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 ||*|| = 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 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 128, with a dynamic range of 128000. Time to load data was 0.055 seconds, presolve used 0.029 seconds, ... 4.510 seconds in simplex solver, in total 4.594 seconds. Vehicle Type: 0 Num:105 Trip segments:572