This repository contains an optimized framework for solving the Stochastic On-Time Arrival (SOTA) problem by integrating Successive Approximations and Single Iteration solvers with deterministic Reach and Arc-flags pruning techniques to accelerate reliability-based routing in large-scale networks.
-
Updated
Feb 13, 2026 - Jupyter Notebook