We propose a new approach for the vehicle routing problem with stochastic customer demands revealed before vehicles are dispatched. We combine ideas from vehicle routing and manufacturing process flexibility to propose overlapped routing strategies with customer sharing. We characterize the...

This paper addresses the capacitated vehicle routing problem with unsplittable stochastic demand (UCVRP), in the limited information regime. We integrate ideas from region partitioning and online bin packing to propose a provably near-optimal and scalable algorithm. Our algorithm performs double...