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 7377 iter. Relaxed solution 24.2279931934 after 8196 iter is B&B base. Feasible solution 24.227304311 after 8372 iter, 40 nodes (gap 0.0%) Improved solution 24.227317314 after 8386 iter, 48 nodes (gap 0.0%) Improved solution 24.227330317 after 8396 iter, 54 nodes (gap 0.0%) Improved solution 24.22734332 after 8399 iter, 57 nodes (gap 0.0%) Improved solution 24.227349826 after 9442 iter, 330 nodes (gap 0.0%) Improved solution 24.227356326 after 10154 iter, 523 nodes (gap 0.0%) Improved solution 24.227362829 after 11619 iter, 963 nodes (gap 0.0%) Improved solution 24.227369329 after 12789 iter, 1302 nodes (gap 0.0%) Improved solution 24.227369335 after 17478 iter, 2747 nodes (gap 0.0%) Improved solution 24.227375835 after 17549 iter, 2775 nodes (gap 0.0%) Improved solution 24.227382335 after 21806 iter, 4144 nodes (gap 0.0%) Improved solution 24.227382338 after 27137 iter, 5768 nodes (gap 0.0%) Improved solution 24.227388838 after 27207 iter, 5796 nodes (gap 0.0%) Improved solution 24.227395338 after 29266 iter, 6415 nodes (gap 0.0%) Improved solution 24.227395344 after 33499 iter, 7566 nodes (gap 0.0%) Improved solution 24.227401844 after 43589 iter, 10551 nodes (gap 0.0%) Improved solution 24.227401847 after 49270 iter, 12243 nodes (gap 0.0%) Improved solution 24.227408347 after 49843 iter, 12429 nodes (gap 0.0%) Improved solution 24.227414847 after 52900 iter, 13378 nodes (gap 0.0%) Improved solution 24.22742135 after 55681 iter, 14153 nodes (gap 0.0%) Improved solution 24.22742785 after 58101 iter, 14848 nodes (gap 0.0%) Improved solution 24.227434353 after 59751 iter, 15342 nodes (gap 0.0%) Improved solution 24.227440853 after 60429 iter, 15535 nodes (gap 0.0%) Improved solution 24.227440856 after 60853 iter, 15664 nodes (gap 0.0%) Improved solution 24.227447356 after 60869 iter, 15671 nodes (gap 0.0%) Improved solution 24.227453856 after 61161 iter, 15746 nodes (gap 0.0%) Improved solution 24.227453859 after 61825 iter, 15941 nodes (gap 0.0%) Improved solution 24.227460359 after 61841 iter, 15948 nodes (gap 0.0%) Improved solution 24.227466859 after 62026 iter, 15999 nodes (gap 0.0%) Improved solution 24.227466862 after 64999 iter, 16980 nodes (gap 0.0%) Improved solution 24.227473362 after 65091 iter, 17016 nodes (gap 0.0%) Improved solution 24.227479865 after 65245 iter, 17063 nodes (gap 0.0%) Improved solution 24.227486365 after 65256 iter, 17068 nodes (gap 0.0%) Improved solution 24.227492865 after 69032 iter, 18357 nodes (gap 0.0%) Improved solution 24.227505871 after 73374 iter, 19875 nodes (gap 0.0%) Improved solution 24.227512371 after 73481 iter, 19914 nodes (gap 0.0%) Improved solution 24.227518871 after 77360 iter, 21243 nodes (gap 0.0%) Improved solution 24.227531877 after 81877 iter, 22845 nodes (gap 0.0%) Improved solution 24.227538377 after 81984 iter, 22884 nodes (gap 0.0%) Improved solution 24.227544877 after 85871 iter, 24215 nodes (gap 0.0%) Improved solution 24.227557883 after 86517 iter, 24421 nodes (gap 0.0%) Improved solution 24.227564383 after 86635 iter, 24460 nodes (gap 0.0%) Improved solution 24.227570886 after 89385 iter, 25436 nodes (gap 0.0%) Improved solution 24.227583889 after 91774 iter, 26275 nodes (gap 0.0%) Improved solution 24.227590389 after 91892 iter, 26314 nodes (gap 0.0%) Improved solution 24.227596892 after 93384 iter, 26836 nodes (gap 0.0%) Improved solution 24.227609895 after 99028 iter, 28759 nodes (gap 0.0%) Improved solution 24.227616395 after 99146 iter, 28798 nodes (gap 0.0%) Improved solution 24.227622898 after 113873 iter, 34087 nodes (gap 0.0%) Improved solution 24.227629398 after 114730 iter, 34412 nodes (gap 0.0%) Optimal solution 24.227629398 after 116302 iter, 34974 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 116302, 13454 (11.6%) were bound flips. There were 17522 refactorizations, 0 triggered by time and 0 by density. ... on average 5.9 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 21969 NZ entries, 1.0x largest basis. The maximum B&B level was 52, 0.0x MIP order, 28 at the optimal solution. The constraint matrix inf-norm is 64, with a dynamic range of 64000. Time to load data was 0.184 seconds, presolve used 0.074 seconds, ... 1086.855 seconds in simplex solver, in total 1087.113 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.172 seconds, presolve used 0.074 seconds, ... 32.242 seconds in simplex solver, in total 32.488 seconds. Vehicle Type: 0 Num:23 Trip segments:57