Branch and price for the vehicle routing problem with discrete split deliveries and time windows

The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles’ capacity and customer time windows. Each customer can be visited by more than one vehicle since each customer’s demand, discretized in items, can be split in orders, i.e., feasible combinations of items. In this work, we model the DSDVRPTW assuming that all feasible orders are known in advance. Remarkably, service time at customer’s location depends on the delivered combination of items, which is a modeling feature rarely found in literature. We present a flow‐based mixed integer program for the DSDVRPTW, we reformulate it via Dantzig–Wolfe and we apply column generation. The proposed branch‐and‐price algorithm largely outperforms a commercial solver, as shown by computational experiments on Solomon‐based instances. A comparison in terms of complexity between constant service time vs delivery‐dependent service time is presented and potential savings are discussed.