Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3524 constraints, 5927 variables, 15923 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 3813 iter. Relaxed solution 24.2219922789 after 4355 iter is B&B base. Feasible solution 24.203452427 after 5893 iter, 114 nodes (gap 0.1%) Improved solution 24.203465438 after 5918 iter, 119 nodes (gap 0.1%) Improved solution 24.203478449 after 6236 iter, 162 nodes (gap 0.1%) Improved solution 24.203504469 after 6425 iter, 192 nodes (gap 0.1%) Improved solution 24.203530483 after 6891 iter, 252 nodes (gap 0.1%) Improved solution 24.203556493 after 8479 iter, 446 nodes (gap 0.1%) Improved solution 24.203582503 after 10566 iter, 696 nodes (gap 0.1%) Improved solution 24.203608513 after 12662 iter, 968 nodes (gap 0.1%) Improved solution 24.203608517 after 17199 iter, 1647 nodes (gap 0.1%) Improved solution 24.203621516 after 21256 iter, 2224 nodes (gap 0.1%) Improved solution 24.203634527 after 21276 iter, 2227 nodes (gap 0.1%) Improved solution 24.203647528 after 43325 iter, 5440 nodes (gap 0.1%) Improved solution 24.204634525 after 46374 iter, 5867 nodes (gap 0.1%) Improved solution 24.204634529 after 47587 iter, 6032 nodes (gap 0.1%) Improved solution 24.204647528 after 49437 iter, 6274 nodes (gap 0.1%) Improved solution 24.204660539 after 49476 iter, 6278 nodes (gap 0.1%) Improved solution 24.20467354 after 57970 iter, 7524 nodes (gap 0.1%) Improved solution 24.204686549 after 61853 iter, 8120 nodes (gap 0.1%) Improved solution 24.204699552 after 75289 iter, 10131 nodes (gap 0.1%) Improved solution 24.204699556 after 88472 iter, 12228 nodes (gap 0.1%) Improved solution 24.204712557 after 100810 iter, 14011 nodes (gap 0.1%) Improved solution 24.204725566 after 101239 iter, 14064 nodes (gap 0.1%) Improved solution 24.204738567 after 140700 iter, 20457 nodes (gap 0.1%) Improved solution 24.204751576 after 141134 iter, 20510 nodes (gap 0.1%) Improved solution 24.204764577 after 181372 iter, 27039 nodes (gap 0.1%) Improved solution 24.204777586 after 181801 iter, 27092 nodes (gap 0.1%) Improved solution 24.204790587 after 221933 iter, 33605 nodes (gap 0.1%) Improved solution 24.204803596 after 222367 iter, 33658 nodes (gap 0.1%) Improved solution 24.204816599 after 242080 iter, 37072 nodes (gap 0.1%) Improved solution 24.204829604 after 286799 iter, 45314 nodes (gap 0.1%) Improved solution 24.204842607 after 309313 iter, 49494 nodes (gap 0.1%) Improved solution 24.204855612 after 355884 iter, 58166 nodes (gap 0.1%) Improved solution 24.205660539 after 364487 iter, 59769 nodes (gap 0.1%) Improved solution 24.205686549 after 369491 iter, 60393 nodes (gap 0.1%) Improved solution 24.205712559 after 375715 iter, 61191 nodes (gap 0.1%) Improved solution 24.205738569 after 382279 iter, 62051 nodes (gap 0.1%) Improved solution 24.205738569 after 382480 iter, 62075 nodes (gap 0.1%) Improved solution 24.205764579 after 388842 iter, 62933 nodes (gap 0.1%) Improved solution 24.205777586 after 394486 iter, 63708 nodes (gap 0.1%) Improved solution 24.205790589 after 399218 iter, 64381 nodes (gap 0.1%) Improved solution 24.205803596 after 404883 iter, 65178 nodes (gap 0.1%) Improved solution 24.205816599 after 409709 iter, 65877 nodes (gap 0.1%) Improved solution 24.205829604 after 421558 iter, 67732 nodes (gap 0.1%) Improved solution 24.205842607 after 426909 iter, 68581 nodes (gap 0.1%) Improved solution 24.205855612 after 439838 iter, 70584 nodes (gap 0.1%) Improved solution 24.205868615 after 445271 iter, 71441 nodes (gap 0.1%) Improved solution 24.205868617 after 473736 iter, 76007 nodes (gap 0.1%) Improved solution 24.205868619 after 897779 iter, 143695 nodes (gap 0.1%) Improved solution 24.20588162 after 1029072 iter, 162545 nodes (gap 0.1%) Improved solution 24.205894627 after 1060700 iter, 167259 nodes (gap 0.1%) lp_solve optimization was stopped due to time-out. Optimal solution 24.205894627 after 2346297 iter, 374617 nodes (gap 0.1%). 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 2346297, 125924 (5.4%) were bound flips. There were 187297 refactorizations, 0 triggered by time and 1 by density. ... on average 11.9 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 10151 NZ entries, 1.0x largest basis. The maximum B&B level was 122, 0.1x MIP order, 88 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.067 seconds, presolve used 0.033 seconds, ... 7199.974 seconds in simplex solver, in total 7200.074 seconds. Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3524 constraints, 5927 variables, 15923 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 1558 iter is B&B base. Feasible solution 0 after 1558 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1558 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 1558, 0 (0.0%) were bound flips. There were 8 refactorizations, 0 triggered by time and 0 by density. ... on average 194.8 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 6528 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.060 seconds, presolve used 0.033 seconds, ... 5.877 seconds in simplex solver, in total 5.970 seconds. Vehicle Type: 0 Num:74 Trip segments:170