We study the problem of determining the target inventory level of stations in a bike-sharing system, when bikes can be rebalanced later during the day. We propose a two-stage stochastic programming formulation, where the target inventory decisions are made at the first stage, while the recourse...

Rollout algorithms are effective heuristics for the single vehicle routing problem with stochastic demands (VRPSD), a prototypical model of logistics under uncertainty. However, they can be computational intensive. To reduce their run time, we introduce a novel approach to approximate the...