The Meal Delivery Routing Problem

We introduce the Meal Delivery Routing Problem (MDRP) to formalize and study an important emerging class of dynamic delivery operations. We develop optimization-based algorithms tailored to solve the courier assignment (dynamic vehicle routing) and capacity management (offline shift scheduling) problems encountered in meal delivery operations. Extensive computational experiments using instances with realistic size, geography, urgency and dynamism demonstrate that our algorithmic ideas provide solid foundations for real-world implementations.



View The Meal Delivery Routing Problem