Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 7646 constraints, 11381 variables, 32033 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 7696 iter. Relaxed solution 383.643904912 after 8822 iter is B&B base. Feasible solution 383.634057228 after 9226 iter, 53 nodes (gap 0.0%) Improved solution 383.634083238 after 9311 iter, 69 nodes (gap 0.0%) Improved solution 383.634109248 after 9396 iter, 85 nodes (gap 0.0%) Improved solution 383.634135258 after 9482 iter, 101 nodes (gap 0.0%) Improved solution 383.634161268 after 9568 iter, 117 nodes (gap 0.0%) Improved solution 383.634174271 after 9924 iter, 290 nodes (gap 0.0%) Improved solution 383.634187274 after 10514 iter, 529 nodes (gap 0.0%) Improved solution 383.63419378 after 11593 iter, 898 nodes (gap 0.0%) Improved solution 383.63420028 after 13230 iter, 1470 nodes (gap 0.0%) Improved solution 383.634206783 after 14420 iter, 1985 nodes (gap 0.0%) Improved solution 383.634213283 after 15055 iter, 2230 nodes (gap 0.0%) Improved solution 383.634219789 after 17142 iter, 2940 nodes (gap 0.0%) Improved solution 383.634226289 after 19334 iter, 3670 nodes (gap 0.0%) Improved solution 383.636998711 after 20493 iter, 4127 nodes (gap 0.0%) Improved solution 383.637024723 after 20499 iter, 4129 nodes (gap 0.0%) Improved solution 383.637044232 after 20544 iter, 4142 nodes (gap 0.0%) Improved solution 383.637050733 after 20572 iter, 4150 nodes (gap 0.0%) Improved solution 383.637070242 after 20637 iter, 4166 nodes (gap 0.0%) Improved solution 383.637076743 after 20665 iter, 4174 nodes (gap 0.0%) Improved solution 383.637096252 after 20730 iter, 4190 nodes (gap 0.0%) Improved solution 383.637102753 after 20758 iter, 4198 nodes (gap 0.0%) Improved solution 383.637122262 after 20850 iter, 4220 nodes (gap 0.0%) Improved solution 383.637128761 after 20930 iter, 4244 nodes (gap 0.0%) Improved solution 383.63713526 after 21140 iter, 4309 nodes (gap 0.0%) Improved solution 383.63714827 after 21443 iter, 4386 nodes (gap 0.0%) Improved solution 383.637154769 after 21516 iter, 4416 nodes (gap 0.0%) Improved solution 383.63715477 after 21920 iter, 4529 nodes (gap 0.0%) Improved solution 383.637161269 after 22008 iter, 4559 nodes (gap 0.0%) Improved solution 383.637161273 after 23747 iter, 4996 nodes (gap 0.0%) Improved solution 383.637167773 after 24040 iter, 5075 nodes (gap 0.0%) Improved solution 383.637174272 after 26339 iter, 5630 nodes (gap 0.0%) Improved solution 383.637174276 after 26969 iter, 5828 nodes (gap 0.0%) Improved solution 383.637180775 after 27085 iter, 5875 nodes (gap 0.0%) Improved solution 383.637180776 after 27233 iter, 5905 nodes (gap 0.0%) Improved solution 383.637193779 after 27728 iter, 6096 nodes (gap 0.0%) Improved solution 383.637200282 after 36807 iter, 8201 nodes (gap 0.0%) Improved solution 383.637206784 after 37477 iter, 8407 nodes (gap 0.0%) Improved solution 383.637213285 after 60873 iter, 13682 nodes (gap 0.0%) Improved solution 383.637219787 after 61718 iter, 13924 nodes (gap 0.0%) Improved solution 383.643167772 after 64143 iter, 14573 nodes (gap 0.0%) Improved solution 383.643180775 after 64159 iter, 14579 nodes (gap 0.0%) Improved solution 383.643193778 after 64162 iter, 14582 nodes (gap 0.0%) Improved solution 383.643200284 after 64534 iter, 14668 nodes (gap 0.0%) Improved solution 383.643206784 after 65198 iter, 14824 nodes (gap 0.0%) Improved solution 383.643213285 after 65375 iter, 14870 nodes (gap 0.0%) Improved solution 383.643213287 after 65616 iter, 14933 nodes (gap 0.0%) Improved solution 383.643219787 after 65725 iter, 14966 nodes (gap 0.0%) Improved solution 383.643219791 after 67429 iter, 15383 nodes (gap 0.0%) Improved solution 383.643226293 after 67668 iter, 15452 nodes (gap 0.0%) Improved solution 383.643232793 after 69381 iter, 15882 nodes (gap 0.0%) Improved solution 383.643239293 after 69800 iter, 16002 nodes (gap 0.0%) Improved solution 383.643245799 after 70288 iter, 16150 nodes (gap 0.0%) Improved solution 383.643252299 after 70735 iter, 16298 nodes (gap 0.0%) Improved solution 383.6432588 after 70943 iter, 16360 nodes (gap 0.0%) Improved solution 383.643258802 after 71017 iter, 16381 nodes (gap 0.0%) Improved solution 383.643265302 after 71271 iter, 16464 nodes (gap 0.0%) Improved solution 383.643271805 after 72084 iter, 16691 nodes (gap 0.0%) Improved solution 383.643278305 after 72194 iter, 16729 nodes (gap 0.0%) Improved solution 383.643284808 after 72270 iter, 16752 nodes (gap 0.0%) Improved solution 383.643291308 after 72335 iter, 16776 nodes (gap 0.0%) Improved solution 383.643310814 after 72613 iter, 16869 nodes (gap 0.0%) Improved solution 383.64333682 after 73189 iter, 17044 nodes (gap 0.0%) Optimal solution 383.64333682 after 73289 iter, 17080 nodes (gap 0.0%). 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 73289, 6732 (9.2%) were bound flips. There were 8580 refactorizations, 0 triggered by time and 0 by density. ... on average 7.8 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 22108 NZ entries, 1.0x largest basis. The maximum B&B level was 65, 0.0x MIP order, 41 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.185 seconds, presolve used 0.075 seconds, ... 625.150 seconds in simplex solver, in total 625.410 seconds. Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 7646 constraints, 11381 variables, 32033 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 3376 iter is B&B base. Feasible solution 0 after 3376 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 3376 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 3376, 0 (0.0%) were bound flips. There were 15 refactorizations, 0 triggered by time and 0 by density. ... on average 225.1 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 14150 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.167 seconds, presolve used 0.070 seconds, ... 31.101 seconds in simplex solver, in total 31.338 seconds. Vehicle Type: 0 Num:42 Trip segments:102