We consider stochastic vehicle routing problems on a network with random travel and service times. A fleet of one or more vehicles is available to be routed through the network to service each node. Two versions of the model are developed based on alternative objective functions. We provide bounds on optimal objective function values and conditions under which reductions to simpler models can b...

We consider stochastic networks in which link travel times are dependent, discrete random variables. We present methods for computing bounds on path travel times using stochastic dominance relationships among link travel times, and discuss techniques for controlling tightness of the bounds. We apply these methods to shortest-path problems, show that the proposed algorithm can provide bounds on ...

Travel times in urban road networks are highly stochastic. However, most existing travel time estimation methods only estimate the mean travel times, while ignoring travel time variances. To this end, this paper proposes a robust travel time distribution estimation method to estimate both the mean and variance of travel times by using emerging low-frequency floating car data. Different from the...

How to model traveler’s perception of travel time is always an important issue in the development of traffic assignment models. Since travelers rarely have perfect knowledge of the road network or of the traveling conditions, they choose routes based on their perceived travel times. Traditionally, travelers’ perceived travel times are treated as random variables, leading to the stochastic traff...

Abstract We address the stochastic scheduled service network design problem with quality targets and uncertainty on travel times. This important problem, raising in tactical planning process of consolidation-based freight carriers, has been little studied up to now. define considering for on-time operation services delivery demand loads destinations. introduce a two-stage mixed-integer model de...