Speedup Techniques for the Stochastic on-time Arrival Problem

Authors Samitha Samaranayake, Sebastien Blandin, Alex Bayen

Thumbnail PDF


  • Filesize: 1.5 MB
  • 15 pages

Document Identifiers

Author Details

Samitha Samaranayake
Sebastien Blandin
Alex Bayen

Cite AsGet BibTex

Samitha Samaranayake, Sebastien Blandin, and Alex Bayen. Speedup Techniques for the Stochastic on-time Arrival Problem. In 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 25, pp. 83-96, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


We consider the stochastic on-time arrival (SOTA) routing problem of finding a routing policy that maximizes the probability of reaching a given destination within a pre-specified time budget in a road network with probabilistic link travel-times. The goal of this work is to provide a theoretical understanding of the SOTA problem and present efficient computational techniques to enable the development of practical applications for stochastic routing. We present multiple speedup techniques that include a label-setting algorithm based on the existence of a minimal link travel-time on each road link, advanced convolution methods centered on the Fast Fourier Transform and the idea of zero-delay convolution, and localization techniques for determining an optimal order of policy computation. We describe the algorithms for each speedup technique and analyze their impact on computation time. We also analyze the behavior of the algorithms as a function of the network topology and present numerical results to demonstrate this. Finally, experimental results are provided for the San Francisco Bay Area arterial road network to show how the algorithms would work in an operational setting.
  • Stochastic routing
  • Dynamic programming
  • Traffic information systems


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads