کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
480329 | 1446096 | 2011 | 8 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Branch and price for the vehicle routing problem with discrete split deliveries and time windows Branch and price for the vehicle routing problem with discrete split deliveries and time windows](/preview/png/480329.png)
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.
► We model a vehicle routing problem with time windows and split deliveries.
► Demand is discrete and delivered in orders (predetermined fractions of demand).
► Service time depends on delivered quantity (comparison with fixed service time).
► The problem is reformulated via Dantzig-Wolfe and solved via column generation.
► Our branch-and-price implementation largely outperforms commercial solvers.
Journal: European Journal of Operational Research - Volume 213, Issue 3, 16 September 2011, Pages 470–477