Least Expected Time Paths in Stochastic Schedule-Based Transit Networks

Figure 4

Illustration of vector labels at nodes in the graph shown in Figure 2 after the termination of LET-Path algorithm. In each vector label, each value at is the number of transfers, and each value at each of the scenarios , , is the travel time of path from origin to the current node in that scenario. Each sequence of solid arrows from origin to destination represents - path, and each sequence of dashed-line arrows represents the travel times from origin to intermediate nodes along the path in each scenario.