Least Expected Time Paths in Stochastic Schedule-Based Transit Networks

الملخص EN

We consider the problem of determining a least expected time (LET) path that minimizes the number of transfers and the expected total travel time in a stochastic schedule-based transit network.

A time-dependent model is proposed to represent the stochastic transit network where vehicle arrival times are fully stochastically correlated.

An exact label-correcting algorithm is developed, based on a proposed dominance condition by which Bellman’s principle of optimality is valid.

Experimental results, which are conducted on the Ho Chi Minh City bus network, show that the running time of the proposed algorithm is suitable for real-time operation, and the resulting LET paths are robust against uncertainty, such as unknown traffic scenarios.