The unavoidable travel time variability in transportation networks, resulted from the
widespread supply-side and demand-side uncertainties, makes travel time reliability (TTR) …

Aiming to provide a generic modeling framework for finding reliable paths in dynamic and
stochastic transportation networks, this paper addresses a class of two-stage routing models …

This paper studies the reliable path problem in the form of minimizing the sum of mean and
standard deviation of path travel time. For the case of independent link travel times, we show …

Routing service considering uncertainty is at the core of intelligent transportation systems
and has attracted increasing attention. Existing stochastic shortest path models require the …

Finding a reliable shortest path (RSP) in a stochastic network is a fundamental problem in
transportation science. Link travel time correlation significantly affects path reliability, but …

This paper investigates the reliable shortest path (RSP) problem in Gaussian process (GP)
regulated transportation networks. Specifically, the RSP problem that we are targeting at is …

Railway alignment optimization is difficult due to theoretically infinite possible alternatives,
multiple conflicting and hard-to-quantify objectives, as well as large-scale and highly …

Finding the most reliable path that maximizes the probability of on-time arrival is commonly
encountered by travelers facing travel time uncertainties. However, few exact solution …

Re-optimization technique is an efficient approach for solving the shortest path problem in
dynamic deterministic networks, where link travel times are updated in real-time. However …

This paper proposes a data-driven distributionally robust shortest path (DRSP) model where
the distribution of the travel time in the transportation network can only be partially observed …