A Unifying Framework for the Capacitated Vehicle Routing Problem under Risk and Ambiguity

We propose a generic model for the capacitated vehicle routing problem (CVRP) under demand uncertainty. By combining risk measures or disutility functions with complete or partial characterizations of the probability distribution governing the demands, our formulation bridges the popular but often independently studied paradigms of stochastic programming and distributionally robust optimization. We characterize when an … Read more

A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Costs

We investigate a robust approach for solving the Capacitated Vehicle Routing Problem (CVRP) with uncertain travel times. It is based on the concept of K-adaptability, which allows to calculate a set of k feasible solutions in a preprocessing phase before the scenario is revealed. Once a scenario occurs, the corresponding best solution may be picked … Read more