Solving large-scale dynamic vehicle routing problems with stochastic requests

Jian Zhang, Kelin Luo, Alexandre M. Florio, Tom Van Woensel

Abstract: Highlights•Solves the Dynamic Vehicle Routing Problem with Stochastic Customer Requests.•Accurate and efficient knapsack-based approximations of the reward-to-go.•Offline plans and online scheduling policies based on knapsack approximations.•Computational study showing the superiority of the proposed methods over benchmarks.