For all unassigned passenger-trips, select a path from the passenger-trip’s pathset based on probabilities calculated from a path-choice model and pathset costs and summarize vehicle loads.

The process of initializing the label stop queue, updating, and then finalizing the stop states. The origin or destination state now has a label that has a cost that encapsulates the costs of all the trip links and transfers, but with inaccuracies regarding the timing of the non-transit links, which must be updated using path enumeration.

Probabilistic assignment of passengers to paths in their pathset based on costs. Update of pathset feasibility.

Walk the labeled hyperpath and generate all of the actual, realizable paths from it. At this point, we can fix the timing of the walk links and therefore have actual wait times. The path costs here are used to calculate the probability of each of these paths. The output of this process is a pathset.

Flag passenger trips that are not on a valid path due to missed transfers or overcapacity vehicles based on capacity priority rules.

The process of initializing the label stop queue, updating, and then finalizing the stop states. The origin or destination state now has a label that has a cost that encapsulates the costs of all the trip links and transfers, but with inaccuracies regarding the timing of the non-transit links, which must be updated using path enumeration.

Update pathset paths based on transit vehicle trajectory cost updates and path feasibility.

When all stops are removed from the label stop queue, the final costs for the destination (in forward-shortest-path) or origin (in backward-shortest-path) is finalized based on the cost labels of the emanating egress or access links.

The first step of a shortest-path algorithm. Stop labels should be initialized to be greater-than or equal to their final cost and should allow for the greatest number of emanating links (i.e. for a walk access link in a forward-shortest-path, assume it is as early as possible). All stops are added to the label stop queue.

Updating stop states when a stop is removed from the label stop queue.

If the results of the passenger assignment have an effect on transit vehicle timings (i.e. boarding and alighting activity at stop that affect vehicle dwell times), update the transit vehicle trajectories to reflect it.

Passengers with no valid paths in the simulation loop, see if any new paths can be generated based on updated costs and available paths.