Determining Optimal Link Capacity Expansions in Road Networks Using Cuckoo Search Algorithm with Lévy Flights

<table class="table-group" id="tab1"><tr><td><table class="table"><tr><td class="thead-hr" colspan="4"><hr/></td></tr><tr class="thead"><td align="left">Scenario</td><td align="center"><i>D </i><sub>
										16</sub></td><td align="center"><i>D </i><sub>
										61</sub></td><td align="center">Total demand</td></tr><tr><td class="thead-hr" colspan="4"><hr/></td></tr><tr><td align="left">1</td><td align="center">5</td><td align="center">10</td><td align="center">15</td></tr><tr><td align="left">2</td><td align="center">10</td><td align="center">20</td><td align="center">30</td></tr><tr class="table-tr"><td colspan="4"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Travel demand scenarios for the 16-link network.

Journal of Applied Mathematics

tab1

Table 1

Table 1: Determining Optimal Link Capacity Expansions in Road Networks Using Cuckoo Search Algorithm with Lévy Flights 