From Co-Routing Prediction to Customer Lock-In: An Anticipatory Framework for E-Grocery Operations
B.L. Holtz (TU Delft - Aerospace Engineering)
A. Bombelli – Mentor (TU Delft - Aerospace Engineering)
P.S.A. Stokkink – Mentor (TU Delft - Technology, Policy and Management)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
E-grocery operators that run their own delivery fleet reconcile warehouse efficiency with routing quality. Multi-customer totes, in which the orders of two or three customers are packed together, improve tote utilisation by filling capacity that individual customers rarely occupy in full. These totes are only assembled after the end-of-day routing solver has determined delivery assignments, which concentrates packing work into a peak immediately after the routing solver has run. Committing pairs to shared totes earlier in the day would spread packing activity across the order-intake window, reducing the post-solve packing peak that currently constrains fulfilment capacity. This paper investigates whether such commitments can be made at an acceptable cost to routing quality. A pair-level co-routing classifier, PACK, is trained to predict the probability that the routing solver will assign two customers to the same trip, using information observable at a snapshot hour on the day before delivery. Its calibrated probabilities drive a lock-in mechanism that commits pairs to shared totes subject to tote-capacity constraints, in either a batch or a sequential mode. The framework is evaluated on 78 dispatch plans for Picnic's Utrecht hub against four alternative locking strategies in a routing simulation. PACK reaches a test ROC-AUC of 0.83 and adds only +1.40% drive time and +1.01% vehicles relative to the unconstrained baseline, operating within 0.07pp of a hindsight oracle. Anticipatory locking imposes no runtime penalty and improves it on the largest plans, showing that tote pre-commitment is achievable at a small, quantified routing cost.
Files
File under embargo until 15-10-2028