A GRASP algorithm for the Meal Delivery Routing Problem

TL;DR

This paper presents a GRASP metaheuristic for optimizing courier assignment and routing in meal delivery, improving efficiency in last-mile logistics through real-world case analysis.

Contribution

Introduces a novel GRASP algorithm tailored for the Meal Delivery Routing Problem, addressing dynamic factors and demonstrating competitive performance with real-world data.

Findings

GRASP effectively balances solution quality and computational time.

The algorithm outperforms existing methods in delivery efficiency.

Real-world case studies validate practical applicability.

Abstract

With the escalating demand for meal delivery services, this study delves into the Meal Delivery Routing Problem (MDRP) within the context of last-mile logis-tics. Focusing on the critical aspects of courier allocation and order fulfillment, we introduce a novel approach utilizing a GRASP metaheuristic. The algorithm optimizes the assignment of couriers to orders, considering dynamic factors such as courier availability, order demands, and geographical locations. Real-world in-stances from a Colombian delivery app form the basis of our computational anal-ysis. Calibration of GRASP parameters reveals a delicate trade-off between solu-tion quality and computational time. Comparative results with a simulation-optimization based study underscore GRASP's competitive performance, demon-strating strengths in fulfilling orders and routing efficiency across diverse in-stances. This research enhances operational efficiency in the burgeoning food de-livery industry, shedding light on practical algorithms for last-mile logistics opti-mization.