Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty

摘要

In this paper, we study multiperiod vehicle routing problems where the aim is to determine a minimum cost visit schedule and associated routing plan for each period using capacity-constrained vehicles. In our setting, we allow for customer service requests that are received dynamically over the planning horizon. In order to guarantee the generation of routing plans that can flexibly accommodate potential service requests that have not yet been placed, we model future potential service requests as binary random variables, and we seek to determine a visit schedule that remains feasible for all anticipated realizations of service requests. To that end, the decision-making process can be viewed as a multistage robust optimization problem with binary recourse decisions. We approximate the multistage problem via a nonanticipative two-stage model for which we propose a novel integer programming formulation and a branch-and-cut solution approach. In order to investigate the quality of the solutions we obtain, we also derive a valid lower bound on the multistage problem and present numerical schemes for its computation. Computational experiments on benchmark data sets show that our approach is practically tractable and generates high-quality robust plans that significantly outperform existing approaches in terms of both operational costs and fleet utilization.