Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 20672 constraints, 24621 variables, 73163 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 17271 iter. Relaxed solution 385.49085166 after 19643 iter is B&B base. Feasible solution 385.489686462 after 19817 iter, 48 nodes (gap 0.0%) Improved solution 385.48971898 after 19859 iter, 63 nodes (gap 0.0%) Improved solution 385.489718983 after 19957 iter, 97 nodes (gap 0.0%) Improved solution 385.48972548 after 20067 iter, 144 nodes (gap 0.0%) Improved solution 385.489725482 after 20161 iter, 180 nodes (gap 0.0%) Improved solution 385.489738485 after 20374 iter, 235 nodes (gap 0.0%) Improved solution 385.489771004 after 20418 iter, 250 nodes (gap 0.0%) Improved solution 385.489771007 after 20496 iter, 281 nodes (gap 0.0%) Improved solution 385.489777504 after 20713 iter, 355 nodes (gap 0.0%) Improved solution 385.489777506 after 20790 iter, 386 nodes (gap 0.0%) Improved solution 385.489777508 after 21115 iter, 502 nodes (gap 0.0%) Improved solution 385.489784013 after 21744 iter, 759 nodes (gap 0.0%) Improved solution 385.489784016 after 21822 iter, 790 nodes (gap 0.0%) Improved solution 385.489790513 after 22042 iter, 864 nodes (gap 0.0%) Improved solution 385.489790515 after 22119 iter, 895 nodes (gap 0.0%) Improved solution 385.489803519 after 22363 iter, 984 nodes (gap 0.0%) Improved solution 385.489803521 after 22645 iter, 1080 nodes (gap 0.0%) Improved solution 385.489803523 after 22672 iter, 1087 nodes (gap 0.0%) Improved solution 385.489823028 after 22843 iter, 1173 nodes (gap 0.0%) Improved solution 385.48982303 after 22996 iter, 1253 nodes (gap 0.0%) Improved solution 385.489823032 after 24705 iter, 1979 nodes (gap 0.0%) Improved solution 385.489836039 after 25476 iter, 2260 nodes (gap 0.0%) Improved solution 385.489842539 after 25745 iter, 2393 nodes (gap 0.0%) Improved solution 385.489842541 after 25939 iter, 2506 nodes (gap 0.0%) Improved solution 385.489849039 after 32334 iter, 5880 nodes (gap 0.0%) Improved solution 385.48984904 after 32896 iter, 6203 nodes (gap 0.0%) Improved solution 385.489855538 after 39369 iter, 9655 nodes (gap 0.0%) Improved solution 385.489855539 after 39561 iter, 9776 nodes (gap 0.0%) Improved solution 385.489855551 after 52090 iter, 15942 nodes (gap 0.0%) Improved solution 385.48986205 after 52610 iter, 16181 nodes (gap 0.0%) Improved solution 385.489862051 after 54162 iter, 16911 nodes (gap 0.0%) Improved solution 385.489868549 after 56736 iter, 18058 nodes (gap 0.0%) Improved solution 385.489868557 after 58303 iter, 18782 nodes (gap 0.0%) Improved solution 385.489875056 after 58354 iter, 18801 nodes (gap 0.0%) Improved solution 385.489875057 after 60155 iter, 19663 nodes (gap 0.0%) Improved solution 385.489881556 after 60208 iter, 19682 nodes (gap 0.0%) Improved solution 385.489888063 after 62707 iter, 20873 nodes (gap 0.0%) Improved solution 385.489894563 after 62721 iter, 20880 nodes (gap 0.0%) Improved solution 385.489901063 after 63632 iter, 21379 nodes (gap 0.0%) Improved solution 385.489907562 after 70414 iter, 24986 nodes (gap 0.0%) Improved solution 385.48990757 after 89540 iter, 35225 nodes (gap 0.0%) Improved solution 385.48991407 after 89554 iter, 35232 nodes (gap 0.0%) Improved solution 385.48992057 after 90783 iter, 35899 nodes (gap 0.0%) Improved solution 385.489927067 after 107586 iter, 44465 nodes (gap 0.0%) Improved solution 385.489927076 after 109660 iter, 45568 nodes (gap 0.0%) Improved solution 385.489933576 after 111504 iter, 46461 nodes (gap 0.0%) Improved solution 385.489953082 after 112768 iter, 47235 nodes (gap 0.0%) Improved solution 385.489959582 after 113242 iter, 47526 nodes (gap 0.0%) Improved solution 385.489972588 after 130753 iter, 56996 nodes (gap 0.0%) Improved solution 385.489998594 after 131590 iter, 57478 nodes (gap 0.0%) Optimal solution 385.489998594 after 131658 iter, 57514 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 131658, 24781 (18.8%) were bound flips. There were 28839 refactorizations, 0 triggered by time and 0 by density. ... on average 3.7 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 57828 NZ entries, 1.0x largest basis. The maximum B&B level was 57, 0.0x MIP order, 50 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.350 seconds, presolve used 0.219 seconds, ... 4989.096 seconds in simplex solver, in total 4989.665 seconds. Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 20672 constraints, 24621 variables, 73163 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 9294 iter is B&B base. Feasible solution 0 after 9294 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 9294 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 9294, 0 (0.0%) were bound flips. There were 39 refactorizations, 0 triggered by time and 0 by density. ... on average 238.3 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 39176 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.335 seconds, presolve used 0.191 seconds, ... 230.199 seconds in simplex solver, in total 230.725 seconds. Vehicle Type: 0 Num:42 Trip segments:154