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 8460 iter. Relaxed solution 793.51679936 after 9283 iter is B&B base. Feasible solution 793.14708966 after 9855 iter, 52 nodes (gap 0.0%) Improved solution 793.147096162 after 9921 iter, 64 nodes (gap 0.0%) Improved solution 793.147102665 after 9978 iter, 75 nodes (gap 0.0%) Improved solution 793.147109167 after 10027 iter, 87 nodes (gap 0.0%) Improved solution 793.147115676 after 10265 iter, 127 nodes (gap 0.0%) Improved solution 793.147122178 after 10329 iter, 139 nodes (gap 0.0%) Improved solution 793.147128681 after 10492 iter, 166 nodes (gap 0.0%) Improved solution 793.147135183 after 10536 iter, 178 nodes (gap 0.0%) Improved solution 793.14714169 after 11148 iter, 285 nodes (gap 0.0%) Improved solution 793.147148192 after 11187 iter, 291 nodes (gap 0.0%) Improved solution 793.147154695 after 11696 iter, 401 nodes (gap 0.0%) Improved solution 793.147161197 after 11929 iter, 450 nodes (gap 0.0%) Improved solution 793.147180705 after 12115 iter, 484 nodes (gap 0.0%) Improved solution 793.147187207 after 12395 iter, 536 nodes (gap 0.0%) Improved solution 793.164089658 after 15124 iter, 949 nodes (gap 0.0%) Improved solution 793.164115672 after 15174 iter, 959 nodes (gap 0.0%) Improved solution 793.164122174 after 15459 iter, 1002 nodes (gap 0.0%) Improved solution 793.164128677 after 15625 iter, 1034 nodes (gap 0.0%) Improved solution 793.164141682 after 15940 iter, 1094 nodes (gap 0.0%) Improved solution 793.164148184 after 15973 iter, 1100 nodes (gap 0.0%) Improved solution 793.164154687 after 16134 iter, 1133 nodes (gap 0.0%) Improved solution 793.164154695 after 23421 iter, 2283 nodes (gap 0.0%) Improved solution 793.164161197 after 23460 iter, 2289 nodes (gap 0.0%) Improved solution 793.1641677 after 23586 iter, 2312 nodes (gap 0.0%) Improved solution 793.164174202 after 23642 iter, 2322 nodes (gap 0.0%) Improved solution 793.164174203 after 29856 iter, 3160 nodes (gap 0.0%) Improved solution 793.164180705 after 29928 iter, 3170 nodes (gap 0.0%) Improved solution 793.164180706 after 36448 iter, 4245 nodes (gap 0.0%) Improved solution 793.164187208 after 36583 iter, 4261 nodes (gap 0.0%) Improved solution 793.164187212 after 91435 iter, 12637 nodes (gap 0.0%) Improved solution 793.164193714 after 91478 iter, 12643 nodes (gap 0.0%) Improved solution 793.164193715 after 118296 iter, 16255 nodes (gap 0.0%) Improved solution 793.164200217 after 118336 iter, 16261 nodes (gap 0.0%) Improved solution 793.164206719 after 171442 iter, 23920 nodes (gap 0.0%) Improved solution 793.179096165 after 304922 iter, 43793 nodes (gap 0.0%) Improved solution 793.179109173 after 304943 iter, 43799 nodes (gap 0.0%) Improved solution 793.179115676 after 304988 iter, 43808 nodes (gap 0.0%) Improved solution 793.179115678 after 305400 iter, 43889 nodes (gap 0.0%) Improved solution 793.179122181 after 305603 iter, 43928 nodes (gap 0.0%) Improved solution 793.179135187 after 305649 iter, 43938 nodes (gap 0.0%) Improved solution 793.17914169 after 305785 iter, 43972 nodes (gap 0.0%) Improved solution 793.179161197 after 306131 iter, 44061 nodes (gap 0.0%) Improved solution 793.1791677 after 306165 iter, 44076 nodes (gap 0.0%) Improved solution 793.179167706 after 318927 iter, 46521 nodes (gap 0.0%) Improved solution 793.17917421 after 320321 iter, 46806 nodes (gap 0.0%) Improved solution 793.179187215 after 321274 iter, 47034 nodes (gap 0.0%) Improved solution 793.179193718 after 334360 iter, 49308 nodes (gap 0.0%) Improved solution 793.179193719 after 346473 iter, 51717 nodes (gap 0.0%) Improved solution 793.179200221 after 346850 iter, 51808 nodes (gap 0.0%) Improved solution 793.179200225 after 411443 iter, 64335 nodes (gap 0.0%) Improved solution 793.179206727 after 480052 iter, 76839 nodes (gap 0.0%) Improved solution 793.179219732 after 511835 iter, 82659 nodes (gap 0.0%) Improved solution 793.179226235 after 563939 iter, 92365 nodes (gap 0.0%) Improved solution 793.179232737 after 706535 iter, 119807 nodes (gap 0.0%) lp_solve optimization was stopped due to time-out. Optimal solution 793.179232737 after 912373 iter, 162283 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 912373, 72987 (8.0%) were bound flips. There were 81161 refactorizations, 0 triggered by time and 0 by density. ... on average 10.3 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 21976 NZ entries, 1.0x largest basis. The maximum B&B level was 68, 0.0x MIP order, 57 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.177 seconds, presolve used 0.074 seconds, ... 7199.940 seconds in simplex solver, in total 7200.191 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.187 seconds, presolve used 0.082 seconds, ... 30.631 seconds in simplex solver, in total 30.900 seconds. Vehicle Type: 0 Num:49 Trip segments:118