Dynamic journeying under uncertainty

► We present a model for stochastic journey planning in scheduled transport networks. ► An algorithm for maximizing the on-time arrival probability is proposed. ► The complexity is reduced by assuming history independence or unconditionality. ► The exact and approximate models are compared by means of analysis and experiments.