Buffering locations in retail deliveries
This research helps a European retailer with its daily goods delivery operations. The challenge is the limited capacity of the transportation network in the Amsterdam area. This leads to very strict requirements for the delivery routing plans. In order to respond to this challenge both an analytical model and a numerical method are proposed. This method is capable of generating routing plans given all the necessary constraints including the cost structure. The model takes into account all incurred costs such as mileage, unsatisfied demand and waiting times; they all are weighted according to their relative importance. Furthermore, in order to reduce waiting times, buffering locations within the Amsterdam area are considered where a truck can park and wait until the loading zone at a store becomes available. The numerical method is approximate in nature and is based on the Column Generation technique. This technique allows iterative explorations of the search space by adding new promising one-truck routes (columns). The Regret construction heuristic is applied to generate an initial solution. New promising columns are generated by means of solving the Pricing Sub-problem which takes into account the duals of the Master problem relaxation. The analysis demonstrates that the buffers help to reduce the waiting times incurred by early arrivals without any drop in the total solution costs. Furthermore, a method is proposed to verify the usefulness of different buffering locations in the model.
|Column Generation, Dynamic Programming, Linear Programming, Local Search, Mathematical Optimization|
|Procedia Computer Science Series|
|International Conference on Ambient Systems, Networks and Technologies|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
Erkin, D, Dugundji, E.R, Koole, G.M, Gromicho, J, & van der Mei, R.D. (2019). Buffering locations in retail deliveries. In 10th International Conference on Ambient Systems, Networks and Technologies (pp. 116–123). doi:10.1016/j.procs.2019.04.019