go-v.orgdoi

FoodMatch: Batching and Matching for Food Delivery in Dynamic Road Networks

Manas Joshi, Arshdeep Singh, Sayan Ranu, Amitabha Bagchi, Priyank Karia, Puneet Kala · ACM Transactions on Spatial Algorithms and Systems · 2022

  • DOI 10.1145/3494530
  • Publisher Association for Computing Machinery
  • Type article
  • Issued 2022

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

ACM Transactions on Spatial Algorithms and Systems · Association for Computing Machinery · article · 2022

Abstract

Food delivery, today, is a multi-billion dollar industry. Minimizing food delivery time is a key contributor towards building positive customer experiences. More precisely, given a stream of food orders and available delivery vehicles, how should orders be assigned to vehicles so the delivery time is minimized? Several decisions have to be made: (1) assignment of orders to vehicles, (2) grouping orders into batches to cope with limited vehicle availability, (3) adapting to dynamic positions of delivery vehicles, and (4) ensuring scalability to the demands of real-world workloads. We show that the minimization problem is not only NP-hard but inapproximable in polynomial time.

To mitigate this computational bottleneck, we develop an algorithm called FoodMatch , which maps the vehicle assignment problem to that of minimum weight perfect matching on a bipartite graph. To further reduce the quadratic construction cost of the bipartite graph, we deploy best-first search to only compute a subgraph that is highly likely to contain the minimum matching. The solution quality is further enhanced by reducing batching to a graph batching problem and anticipating dynamic positions of vehicles through angular distance . We perform extensive experiments on real food-delivery data from large metropolitan cities.

Our results establish that FoodMatch imparts substantial improvements over baseline strategies across a host of metrics such as food delivery time, waiting time at restaurants, and orders delivered per kilometer. Furthermore, FoodMatch is efficient enough to handle real-world workloads.

Open the resolved locator · 10.1145/3494530

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-19 23:25 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://doi.org/10.1145/3494530
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.