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 16967 iter. Relaxed solution 391.574856559 after 19310 iter is B&B base. Feasible solution 391.572393662 after 19476 iter, 48 nodes (gap 0.0%) Improved solution 391.572419471 after 19516 iter, 64 nodes (gap 0.0%) Improved solution 391.57245818 after 19550 iter, 79 nodes (gap 0.0%) Improved solution 391.572458183 after 19690 iter, 133 nodes (gap 0.0%) Improved solution 391.57247108 after 19814 iter, 194 nodes (gap 0.0%) Improved solution 391.572471082 after 19937 iter, 250 nodes (gap 0.0%) Improved solution 391.572496885 after 20058 iter, 305 nodes (gap 0.0%) Improved solution 391.572522694 after 20098 iter, 321 nodes (gap 0.0%) Improved solution 391.572561404 after 20133 iter, 336 nodes (gap 0.0%) Improved solution 391.572561407 after 20231 iter, 383 nodes (gap 0.0%) Improved solution 391.572574304 after 20451 iter, 471 nodes (gap 0.0%) Improved solution 391.572574306 after 20544 iter, 518 nodes (gap 0.0%) Improved solution 391.572574308 after 20876 iter, 660 nodes (gap 0.0%) Improved solution 391.572587213 after 21616 iter, 995 nodes (gap 0.0%) Improved solution 391.572587216 after 21714 iter, 1042 nodes (gap 0.0%) Improved solution 391.572600113 after 21934 iter, 1130 nodes (gap 0.0%) Improved solution 391.572600115 after 22027 iter, 1177 nodes (gap 0.0%) Improved solution 391.572613022 after 22275 iter, 1291 nodes (gap 0.0%) Improved solution 391.572664628 after 22312 iter, 1309 nodes (gap 0.0%) Improved solution 391.57266463 after 22592 iter, 1425 nodes (gap 0.0%) Improved solution 391.572690439 after 24463 iter, 2184 nodes (gap 0.0%) Improved solution 391.572703339 after 24892 iter, 2359 nodes (gap 0.0%) Improved solution 391.572703341 after 25220 iter, 2512 nodes (gap 0.0%) Improved solution 391.572716239 after 32208 iter, 5798 nodes (gap 0.0%) Improved solution 391.57271624 after 33084 iter, 6207 nodes (gap 0.0%) Improved solution 391.572729138 after 40624 iter, 9803 nodes (gap 0.0%) Improved solution 391.572729139 after 40960 iter, 9962 nodes (gap 0.0%) Improved solution 391.572729151 after 57192 iter, 17280 nodes (gap 0.0%) Improved solution 391.57274205 after 57879 iter, 17563 nodes (gap 0.0%) Improved solution 391.572742051 after 59928 iter, 18429 nodes (gap 0.0%) Improved solution 391.572754949 after 62809 iter, 19722 nodes (gap 0.0%) Improved solution 391.572767852 after 63198 iter, 19889 nodes (gap 0.0%) Improved solution 391.572767854 after 63436 iter, 20000 nodes (gap 0.0%) Improved solution 391.572793663 after 64329 iter, 20387 nodes (gap 0.0%) Improved solution 391.572806563 after 64346 iter, 20394 nodes (gap 0.0%) Improved solution 391.572819463 after 65610 iter, 21009 nodes (gap 0.0%) Improved solution 391.572832362 after 73034 iter, 24648 nodes (gap 0.0%) Improved solution 391.57283237 after 92058 iter, 34513 nodes (gap 0.0%) Improved solution 391.57284527 after 92075 iter, 34520 nodes (gap 0.0%) Improved solution 391.57285817 after 93733 iter, 35357 nodes (gap 0.0%) Improved solution 391.572871076 after 112059 iter, 44583 nodes (gap 0.0%) Improved solution 391.572883976 after 112076 iter, 44590 nodes (gap 0.0%) Improved solution 391.572896875 after 113732 iter, 45267 nodes (gap 0.0%) Improved solution 391.572922682 after 123390 iter, 50373 nodes (gap 0.0%) Improved solution 391.572935582 after 124142 iter, 50698 nodes (gap 0.0%) Improved solution 391.572961388 after 147907 iter, 61465 nodes (gap 0.0%) Improved solution 391.573012994 after 147953 iter, 61484 nodes (gap 0.0%) Optimal solution 391.573012994 after 148014 iter, 61520 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 148014, 27924 (18.9%) were bound flips. There were 30840 refactorizations, 0 triggered by time and 0 by density. ... on average 3.9 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 57951 NZ entries, 1.0x largest basis. The maximum B&B level was 58, 0.0x MIP order, 50 at the optimal solution. The constraint matrix inf-norm is 128, with a dynamic range of 128000. Time to load data was 0.304 seconds, presolve used 0.183 seconds, ... 4963.333 seconds in simplex solver, in total 4963.820 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 ||*|| = 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 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 128, with a dynamic range of 128000. Time to load data was 0.315 seconds, presolve used 0.189 seconds, ... 225.868 seconds in simplex solver, in total 226.372 seconds. Vehicle Type: 0 Num:42 Trip segments:154