Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3242 constraints, 5231 variables, 13493 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 4466 iter. Relaxed solution 388.715018003 after 5652 iter is B&B base. Feasible solution 388.587463282 after 7048 iter, 202 nodes (gap 0.0%) Improved solution 388.587466936 after 7074 iter, 210 nodes (gap 0.0%) Improved solution 388.58747059 after 7100 iter, 218 nodes (gap 0.0%) Improved solution 388.587474244 after 7126 iter, 226 nodes (gap 0.0%) Improved solution 388.587477898 after 7151 iter, 234 nodes (gap 0.0%) Improved solution 388.587481548 after 7208 iter, 257 nodes (gap 0.0%) Improved solution 388.587485196 after 7470 iter, 327 nodes (gap 0.0%) Improved solution 388.587488842 after 7794 iter, 409 nodes (gap 0.0%) Improved solution 388.587492488 after 8127 iter, 491 nodes (gap 0.0%) Improved solution 388.587496134 after 8457 iter, 573 nodes (gap 0.0%) Improved solution 388.587496138 after 9230 iter, 745 nodes (gap 0.0%) Improved solution 388.587499784 after 9419 iter, 809 nodes (gap 0.0%) Improved solution 388.587499788 after 10695 iter, 1173 nodes (gap 0.0%) Improved solution 388.587503434 after 10877 iter, 1245 nodes (gap 0.0%) Improved solution 388.587503436 after 12342 iter, 1689 nodes (gap 0.0%) Improved solution 388.587507082 after 12520 iter, 1765 nodes (gap 0.0%) Improved solution 388.587507084 after 13863 iter, 2173 nodes (gap 0.0%) Improved solution 388.58751073 after 14162 iter, 2291 nodes (gap 0.0%) Improved solution 388.587514374 after 21396 iter, 4398 nodes (gap 0.0%) Improved solution 388.587518016 after 30906 iter, 7378 nodes (gap 0.0%) Improved solution 388.587521658 after 40606 iter, 10422 nodes (gap 0.0%) Improved solution 388.5875253 after 50342 iter, 13502 nodes (gap 0.0%) Improved solution 388.587525304 after 52979 iter, 14412 nodes (gap 0.0%) Improved solution 388.587528946 after 56415 iter, 15650 nodes (gap 0.0%) Improved solution 388.588463282 after 56939 iter, 15739 nodes (gap 0.0%) Improved solution 388.588466936 after 56970 iter, 15747 nodes (gap 0.0%) Improved solution 388.58847059 after 57001 iter, 15755 nodes (gap 0.0%) Improved solution 388.588474244 after 57029 iter, 15763 nodes (gap 0.0%) Improved solution 388.588477898 after 57059 iter, 15771 nodes (gap 0.0%) Improved solution 388.588481548 after 57127 iter, 15794 nodes (gap 0.0%) Improved solution 388.588485198 after 57188 iter, 15814 nodes (gap 0.0%) Improved solution 388.588488846 after 57461 iter, 15892 nodes (gap 0.0%) Improved solution 388.588492492 after 57788 iter, 15984 nodes (gap 0.0%) Improved solution 388.588496138 after 58123 iter, 16076 nodes (gap 0.0%) Improved solution 388.588499784 after 58459 iter, 16168 nodes (gap 0.0%) Improved solution 388.588499788 after 58539 iter, 16190 nodes (gap 0.0%) Improved solution 388.588503434 after 58741 iter, 16264 nodes (gap 0.0%) Improved solution 388.588503436 after 59085 iter, 16380 nodes (gap 0.0%) Improved solution 388.588507082 after 59283 iter, 16456 nodes (gap 0.0%) Improved solution 388.588507084 after 59497 iter, 16530 nodes (gap 0.0%) Improved solution 388.58851073 after 59819 iter, 16650 nodes (gap 0.0%) Improved solution 388.588514376 after 60464 iter, 16880 nodes (gap 0.0%) Improved solution 388.58851802 after 62273 iter, 17444 nodes (gap 0.0%) Improved solution 388.588521662 after 64270 iter, 18102 nodes (gap 0.0%) Improved solution 388.588525304 after 66268 iter, 18760 nodes (gap 0.0%) Improved solution 388.588528946 after 68280 iter, 19432 nodes (gap 0.0%) Improved solution 388.58852895 after 71489 iter, 20446 nodes (gap 0.0%) Improved solution 388.588532592 after 72207 iter, 20728 nodes (gap 0.0%) Improved solution 388.588532596 after 76905 iter, 22404 nodes (gap 0.0%) Improved solution 388.588536238 after 77600 iter, 22704 nodes (gap 0.0%) Improved solution 388.58853988 after 86123 iter, 25850 nodes (gap 0.0%) Improved solution 388.588543522 after 114016 iter, 35728 nodes (gap 0.0%) Improved solution 388.589477902 after 117014 iter, 36667 nodes (gap 0.0%) Improved solution 388.589481552 after 117034 iter, 36678 nodes (gap 0.0%) Improved solution 388.589485202 after 117057 iter, 36692 nodes (gap 0.0%) Improved solution 388.589488852 after 117080 iter, 36706 nodes (gap 0.0%) Improved solution 388.589492502 after 117103 iter, 36720 nodes (gap 0.0%) Improved solution 388.58949615 after 117341 iter, 36800 nodes (gap 0.0%) Improved solution 388.589499796 after 117574 iter, 36882 nodes (gap 0.0%) Improved solution 388.589503442 after 117815 iter, 36964 nodes (gap 0.0%) Improved solution 388.589507088 after 118055 iter, 37046 nodes (gap 0.0%) Improved solution 388.589510734 after 118299 iter, 37129 nodes (gap 0.0%) Improved solution 388.589514378 after 119630 iter, 37546 nodes (gap 0.0%) Improved solution 388.58951802 after 121483 iter, 38178 nodes (gap 0.0%) Improved solution 388.589521662 after 123400 iter, 38826 nodes (gap 0.0%) Improved solution 388.589525304 after 125318 iter, 39476 nodes (gap 0.0%) Improved solution 388.589525308 after 125934 iter, 39678 nodes (gap 0.0%) Improved solution 388.58952895 after 127526 iter, 40300 nodes (gap 0.0%) Improved solution 388.590477902 after 127965 iter, 40370 nodes (gap 0.0%) Improved solution 388.590481552 after 127988 iter, 40381 nodes (gap 0.0%) Improved solution 388.590485202 after 128015 iter, 40395 nodes (gap 0.0%) Improved solution 388.590488852 after 128042 iter, 40409 nodes (gap 0.0%) Improved solution 388.590492502 after 128069 iter, 40423 nodes (gap 0.0%) Improved solution 388.59049615 after 128325 iter, 40505 nodes (gap 0.0%) Improved solution 388.590499796 after 128565 iter, 40589 nodes (gap 0.0%) Improved solution 388.590503442 after 128811 iter, 40673 nodes (gap 0.0%) Improved solution 388.590507088 after 129058 iter, 40757 nodes (gap 0.0%) Improved solution 388.590510734 after 129318 iter, 40844 nodes (gap 0.0%) Improved solution 388.59051438 after 129574 iter, 40928 nodes (gap 0.0%) Improved solution 388.590518024 after 130094 iter, 41094 nodes (gap 0.0%) Improved solution 388.590521666 after 130655 iter, 41284 nodes (gap 0.0%) Improved solution 388.590525308 after 131215 iter, 41474 nodes (gap 0.0%) Improved solution 388.59052895 after 131778 iter, 41666 nodes (gap 0.0%) Improved solution 388.590528954 after 132617 iter, 41916 nodes (gap 0.0%) Improved solution 388.590532596 after 133043 iter, 42090 nodes (gap 0.0%) Improved solution 388.5905326 after 134562 iter, 42626 nodes (gap 0.0%) Improved solution 388.590536242 after 134972 iter, 42808 nodes (gap 0.0%) Improved solution 388.590539884 after 138025 iter, 43974 nodes (gap 0.0%) Improved solution 388.590543526 after 150231 iter, 48288 nodes (gap 0.0%) Improved solution 388.590547168 after 162463 iter, 52670 nodes (gap 0.0%) Improved solution 388.590550806 after 191652 iter, 63526 nodes (gap 0.0%) Improved solution 388.59055081 after 257776 iter, 87562 nodes (gap 0.0%) Improved solution 388.590554448 after 265506 iter, 90922 nodes (gap 0.0%) Improved solution 388.591477902 after 274752 iter, 94662 nodes (gap 0.0%) Improved solution 388.591481552 after 274790 iter, 94674 nodes (gap 0.0%) Improved solution 388.591485202 after 274830 iter, 94688 nodes (gap 0.0%) Improved solution 388.591488852 after 274870 iter, 94702 nodes (gap 0.0%) Improved solution 388.591492502 after 274910 iter, 94716 nodes (gap 0.0%) Improved solution 388.59149615 after 275180 iter, 94796 nodes (gap 0.0%) Improved solution 388.591499796 after 275440 iter, 94878 nodes (gap 0.0%) Improved solution 388.591503442 after 275706 iter, 94960 nodes (gap 0.0%) Improved solution 388.591507088 after 275971 iter, 95042 nodes (gap 0.0%) Improved solution 388.591510734 after 276248 iter, 95125 nodes (gap 0.0%) Improved solution 388.59151438 after 276527 iter, 95205 nodes (gap 0.0%) Improved solution 388.591518026 after 276809 iter, 95289 nodes (gap 0.0%) Improved solution 388.59152167 after 277397 iter, 95462 nodes (gap 0.0%) Improved solution 388.591525312 after 278027 iter, 95660 nodes (gap 0.0%) Improved solution 388.591528954 after 278656 iter, 95858 nodes (gap 0.0%) Improved solution 388.591532596 after 279287 iter, 96058 nodes (gap 0.0%) Improved solution 388.5915326 after 279375 iter, 96086 nodes (gap 0.0%) Improved solution 388.591536242 after 279854 iter, 96268 nodes (gap 0.0%) Improved solution 388.591539884 after 280854 iter, 96670 nodes (gap 0.0%) Improved solution 388.591543526 after 281858 iter, 97072 nodes (gap 0.0%) Improved solution 388.591547168 after 284378 iter, 98010 nodes (gap 0.0%) Improved solution 388.59155081 after 286895 iter, 98948 nodes (gap 0.0%) Improved solution 388.591554448 after 291623 iter, 100712 nodes (gap 0.0%) Improved solution 388.591554452 after 359071 iter, 123094 nodes (gap 0.0%) Improved solution 388.59155809 after 360436 iter, 123682 nodes (gap 0.0%) Improved solution 388.591558094 after 469584 iter, 162432 nodes (gap 0.0%) Improved solution 388.591561732 after 470904 iter, 163046 nodes (gap 0.0%) Improved solution 388.591561736 after 1369935 iter, 515895 nodes (gap 0.0%) Improved solution 388.591565374 after 1371306 iter, 516509 nodes (gap 0.0%) lp_solve optimization was stopped due to time-out. Optimal solution 388.591565374 after 1430691 iter, 538902 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 1430691, 81396 (5.7%) were bound flips. There were 269417 refactorizations, 0 triggered by time and 11 by density. ... on average 5.0 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 9660 NZ entries, 1.1x largest basis. The maximum B&B level was 206, 0.2x MIP order, 156 at the optimal solution. The constraint matrix inf-norm is 8, with a dynamic range of 8000. Time to load data was 0.050 seconds, presolve used 0.029 seconds, ... 7200.026 seconds in simplex solver, in total 7200.105 seconds. Model name: '' - run #1 Objective: Maximize(R0) SUBMITTED Model size: 3242 constraints, 5231 variables, 13493 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 403 iter. Relaxed solution 0 after 1871 iter is B&B base. Feasible solution 0 after 1871 iter, 0 nodes (gap 0.0%) Optimal solution 0 after 1871 iter, 0 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 1871, 0 (0.0%) were bound flips. There were 9 refactorizations, 0 triggered by time and 0 by density. ... on average 207.9 major pivots per refactorization. The largest [LUSOL v2.2.1.0] fact(B) had 7244 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 8, with a dynamic range of 8000. Time to load data was 0.084 seconds, presolve used 0.058 seconds, ... 11.935 seconds in simplex solver, in total 12.077 seconds. Vehicle Type: 0 Num:83 Trip segments:480