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 4604 iter. Relaxed solution 773.320808505 after 5271 iter is B&B base. Feasible solution 771.803828618 after 6376 iter, 78 nodes (gap 0.2%) Improved solution 771.803854672 after 7523 iter, 279 nodes (gap 0.2%) Improved solution 771.809828614 after 7857 iter, 328 nodes (gap 0.2%) Improved solution 771.80985467 after 8569 iter, 439 nodes (gap 0.2%) Improved solution 771.809854674 after 8715 iter, 459 nodes (gap 0.2%) Improved solution 771.809880728 after 9197 iter, 534 nodes (gap 0.2%) Improved solution 771.809880732 after 10964 iter, 914 nodes (gap 0.2%) Improved solution 771.809906782 after 11359 iter, 982 nodes (gap 0.2%) Improved solution 771.809932824 after 19951 iter, 2812 nodes (gap 0.2%) Improved solution 771.820828618 after 21894 iter, 3243 nodes (gap 0.2%) Improved solution 771.820854676 after 22219 iter, 3301 nodes (gap 0.2%) Improved solution 771.826828616 after 22468 iter, 3349 nodes (gap 0.2%) Improved solution 771.826854674 after 22691 iter, 3391 nodes (gap 0.2%) Improved solution 771.826880732 after 23020 iter, 3440 nodes (gap 0.2%) Improved solution 771.837828618 after 23222 iter, 3469 nodes (gap 0.2%) Improved solution 771.837854674 after 23393 iter, 3501 nodes (gap 0.2%) Improved solution 771.843828616 after 23532 iter, 3526 nodes (gap 0.2%) Improved solution 771.843854672 after 23813 iter, 3578 nodes (gap 0.2%) Improved solution 771.843854674 after 23947 iter, 3602 nodes (gap 0.2%) Improved solution 771.84388073 after 24123 iter, 3633 nodes (gap 0.2%) Improved solution 771.843880732 after 25064 iter, 3853 nodes (gap 0.2%) Improved solution 771.843906786 after 25169 iter, 3877 nodes (gap 0.2%) Improved solution 771.843932828 after 30377 iter, 5125 nodes (gap 0.2%) Improved solution 771.843932832 after 35378 iter, 6520 nodes (gap 0.2%) Improved solution 771.84395887 after 45404 iter, 9262 nodes (gap 0.2%) Improved solution 771.84480256 after 73046 iter, 17118 nodes (gap 0.2%) Improved solution 771.844828616 after 73365 iter, 17186 nodes (gap 0.2%) Improved solution 771.850802558 after 73617 iter, 17234 nodes (gap 0.2%) Improved solution 771.850828614 after 73916 iter, 17286 nodes (gap 0.2%) Improved solution 771.850828616 after 74041 iter, 17311 nodes (gap 0.2%) Improved solution 771.850854672 after 74218 iter, 17343 nodes (gap 0.2%) Improved solution 771.850854674 after 75161 iter, 17563 nodes (gap 0.2%) Improved solution 771.850880728 after 75265 iter, 17587 nodes (gap 0.2%) Improved solution 771.850906776 after 80645 iter, 18852 nodes (gap 0.2%) Improved solution 771.850906778 after 83629 iter, 19554 nodes (gap 0.2%) Improved solution 771.850906784 after 93622 iter, 21973 nodes (gap 0.2%) Improved solution 771.850932828 after 100543 iter, 23616 nodes (gap 0.2%) Improved solution 771.85095887 after 151336 iter, 36732 nodes (gap 0.2%) Improved solution 771.850958874 after 196589 iter, 48802 nodes (gap 0.2%) Improved solution 771.850984912 after 290312 iter, 74966 nodes (gap 0.2%) Improved solution 771.857828618 after 295842 iter, 76593 nodes (gap 0.2%) Improved solution 771.857854674 after 296115 iter, 76661 nodes (gap 0.2%) Improved solution 771.863828616 after 296333 iter, 76709 nodes (gap 0.2%) Improved solution 771.863854672 after 296599 iter, 76761 nodes (gap 0.2%) Improved solution 771.863854674 after 296740 iter, 76786 nodes (gap 0.2%) Improved solution 771.86388073 after 296911 iter, 76818 nodes (gap 0.2%) Improved solution 771.863880732 after 299507 iter, 77430 nodes (gap 0.2%) Improved solution 771.863906786 after 299612 iter, 77454 nodes (gap 0.2%) Improved solution 771.863932828 after 314357 iter, 81178 nodes (gap 0.2%) Improved solution 771.86480256 after 363279 iter, 93955 nodes (gap 0.2%) Improved solution 771.864828616 after 363450 iter, 93987 nodes (gap 0.2%) Improved solution 771.870802558 after 363606 iter, 94012 nodes (gap 0.2%) Improved solution 771.870828614 after 363894 iter, 94064 nodes (gap 0.2%) Improved solution 771.870828616 after 364020 iter, 94089 nodes (gap 0.2%) Improved solution 771.870854672 after 364187 iter, 94121 nodes (gap 0.2%) Improved solution 771.87088072 after 365219 iter, 94316 nodes (gap 0.2%) Improved solution 771.870880722 after 368909 iter, 95164 nodes (gap 0.2%) Improved solution 771.870880728 after 376613 iter, 96981 nodes (gap 0.2%) Improved solution 771.870906772 after 381472 iter, 98098 nodes (gap 0.2%) Improved solution 771.870906776 after 389793 iter, 100122 nodes (gap 0.2%) Improved solution 771.870906778 after 393783 iter, 101064 nodes (gap 0.2%) Improved solution 771.870906784 after 403850 iter, 103482 nodes (gap 0.2%) Improved solution 771.870932828 after 410861 iter, 105136 nodes (gap 0.2%) Improved solution 771.87095887 after 555706 iter, 142002 nodes (gap 0.2%) Improved solution 771.87098491 after 958974 iter, 245274 nodes (gap 0.2%) lp_solve optimization was stopped due to time-out. Optimal solution 771.87098491 after 2232442 iter, 571619 nodes (gap 0.2%). Excellent numeric accuracy ||*|| = 1.64278e-15 MEMO: lp_solve version 5.5.0.10 for 32 bit OS, with 64 bit REAL variables. In the total iteration count 2232442, 223978 (10.0%) were bound flips. There were 285807 refactorizations, 0 triggered by time and 7 by density. ... on average 7.0 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 9839 NZ entries, 1.1x largest basis. The maximum B&B level was 98, 0.1x MIP order, 80 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.053 seconds, presolve used 0.029 seconds, ... 7199.983 seconds in simplex solver, in total 7200.065 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.056 seconds, presolve used 0.029 seconds, ... 4.409 seconds in simplex solver, in total 4.494 seconds. Vehicle Type: 0 Num:25 Trip segments:156