Optimizing routing and delivery patterns with multi-compartment vehicles

Kurzfassung/Abstract

Retailers usually apply repetitive weekly delivery patterns when scheduling the workforce for shelf replenishment, defining cyclic transportation routes and managing warehouse capacities. In doing so, all logistics subsystems are jointly scheduled. Grocery products require different temperature zones. As long as transport was in separated vehicles due to temperature requirements, it was not possible to coordinate deliveries across different temperature zones. The recent introduction of multi-compartment trucks has changed this and allows joint deliveries. This simultaneous delivery of multiple product segments impacts repetitive weekly delivery patterns as, for example, low volume segments can be delivered more frequently if they are transported together with high volume segments.

We address the problem of defining delivery patterns for delivery with multi-compartment vehicles. After deriving decision-relevant costs, we propose a novel model that defines the Periodic Multi-Compartment Vehicle Routing Problem. The model is solved by an integrated framework that determines delivery patterns within an Adaptive Large Neighborhood Search in combination with a Large Neighborhood Search for solving the routing problem. We analyze the impact of selecting delivery patterns across product segments and show the efficiency of our integrated planning approach using numerical studies. Joint planning generates cost savings of up to 15%. Furthermore, we show that the algorithm provided can also improve single-segment problems by 3% compared to a state-of-the art benchmark. Beyond that we demonstrate the applicability and advantage of our approach in a case study with a large German grocery retailer.