Research Article
Determining Optimal Link Capacity Expansions in Road Networks Using Cuckoo Search Algorithm with Lévy Flights
Table 7
The equilibrium link flows and travel times from solving 16-link network.
| | Scenario 1 | Scenario 2 |
| | 1 | | 0 | | 1 | | 0 | | 2.3125 | | 5 | | 3.0961 | | 10 | | 3.5915 | | 6.0287 | | 4.291 | | 15.3514 | | 4 | | 0 | | 4 | | 0 | | 5 | | 0 | | 5 | | 0 | | 3.9215 | | 3.9713 | | 3.2153 | | 4.6486 | | 1 | | 0 | | 1 | | 0 | | 1.0625 | | 5 | | 1.7944 | | 10 | | 2.0025 | | 6.0287 | | 2.1081 | | 15.3514 | | 3 | | 0 | | 3 | | 0 | | 9 | | 0 | | 9 | | 0 | | 5.9805 | | 3.9713 | | 7.633 | | 4.6486 | | 4.0043 | | 5.0101 | | 4.2827 | | 14.3194 | | 2.1289 | | 5 | | 3.5986 | | 10 | | 9.0335 | | 1.0186 | | 9.8617 | | 1.032 | | 6.3125 | | 8.9814 | | 6.3622 | | 18.968 |
|
|
