Authors: Bomboi, Federica
Buchheim, Christoph
Pruente, Jonas
Title: On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency
Language (ISO): en
Abstract: Most state-of-the-art algorithms for the Vehicle Routing Problem, such as Branch-and-Price algorithms or meta heuristics, rely on a fast feasibility test for a given route. We devise the first approach to approximately check feasibility in the Stochastic Vehicle Routing Problem with time windows, where travel times are correlated and depend on the time of the day. Assuming jointly normally distributed travel times, we use a chance constraint approach to model feasibility, where two different application scenarios are considered, depending on whether missing a customer makes the rest of the route infeasible or not. The former case may arise, e.g., in drayage applications or in the pickup-and-delivery VRP. In addition, we present an adaptive sampling algorithm that is tailored for our setting and is much faster than standard sampling techniques. We use a case study for both scenarios, based on instances with realistic travel times, to illustrate that taking correlations and time dependencies into account significantly improves the quality of the solutions, i.e., the precision of the feasibility decision. In particular, the nonconsideration of correlations often leads to solutions containing infeasible routes.
Subject Headings: Stochastic VRP
Time windows
Correlated travel times
Dynamic travel times Chance constraints
Chance constraints
Issue Date: 2021-03-12
Rights link:
Appears in Collections:Fakultät für Mathematik

Files in This Item:
File Description SizeFormat 
Bomboi2021_Article_OnTheStochasticVehicleRoutingP.pdf387.88 kBAdobe PDFView/Open

This item is protected by original copyright

This item is licensed under a Creative Commons License Creative Commons