An Enhanced Dynamic User Optimal Passenger Flow Assignment Model for Metro Networks

<table class="table-group" id="tab3"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td class="align_left">Path</td><td class="align_center">Nodes</td><td class="align_center">Transfer nodes</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td class="align_left">1</td><td class="align_center">1-2-3-4-7-8</td><td class="align_center">4</td></tr><tr><td class="align_left">2</td><td class="align_center">1-2-5-6-7-8</td><td class="align_center">2, 7</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Valid paths for given OD pair (Node1-Node 8).

Discrete Dynamics in Nature and Society

tab3

Table 3

Table 3: An Enhanced Dynamic User Optimal Passenger Flow Assignment Model for Metro Networks 