Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/jat/volume-2018/4295419/figures/4295419.fig.003a.svgz" name="4295419.fig.003a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>The priority factor versus n</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/jat/volume-2018/4295419/figures/4295419.fig.003b.svgz" name="4295419.fig.003b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>The priority factor versus s</td></tr><tr class="fig-image" id="c"><td><object data="https://static.hindawi.com/articles/jat/volume-2018/4295419/figures/4295419.fig.003c.svgz" name="4295419.fig.003c" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(c) </b>The priority factor versus d</td></tr></table>

<div>Performance on the priority factor.</div>

Journal of Advanced Transportation

fig3

Figure 3

Figure 3: Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios 