Least Expected Time Paths in Stochastic Schedule-Based Transit Networks

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/mpe/volume-2016/7609572/figures/7609572.fig.006a.svgz" name="7609572.fig.006a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Trajectories for one trip in all 400 scenarios</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/mpe/volume-2016/7609572/figures/7609572.fig.006b.svgz" name="7609572.fig.006b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Trajectories for all trips in one scenario from 7:00 am to 4:00 pm</td></tr></table>

<div>Illustration of generated stop times.</div>

Mathematical Problems in Engineering

fig6

Figure 6

Figure 6: Least Expected Time Paths in Stochastic Schedule-Based Transit Networks 