Least Expected Time Paths in Stochastic Schedule-Based Transit Networks

Algorithm 1

LET-Path search.

Input: the origin , the destination , the departure time , and the universal set of scenarios

Output: the LET - path at time over , where is the realized scenarios at time

()    Create an initial path with the origin node ;

()     for all ;

()    Create label with , , and ;

()    ;

()    ;

()    while do

()      Extract and remove a label from queue ;

()      for do

()       Create a new path ;

()    Depending on the type of , calculate travel time weight , , using one of (7)–(10), and calculate

      transfer weight using (11);

()    Calculate , , using (12), and calculate using (14);

()    Create a new label with , and , ;

()    if label is non-dominated in then

()     Remove all labels dominated by ;

()     ;

()     ;

() Let be the scenarios realized at time ;

() Apply (13) and (15) for the set of non-dominated paths over the set of scenarios to obtain the LET - path;