Home
Scholarly Works
Optimizing order bundling and dispatching in...
Journal article

Optimizing order bundling and dispatching in online food delivery for enhanced delivery efficiency

Abstract

The online food delivery industry is undergoing a rapid global expansion, making it an easily accessible service for a growing number of consumers. With a simple swipe on a smartphone, customers can conveniently order food from a wide range of restaurants through online food delivery platforms such as Uber Eats, Grubhub, Meituan, and Eleme. The core functionality of these platforms is their algorithmic approach to order dispatching, which is the focus of our study. The objective is to optimize the courier-order matching process, thereby minimizing delivery time and distance, enhancing the efficiency and effectiveness of the service. In contrast to the conventional approach of matching a single order to each courier, our study explores a one-to-many courier-order matching process, which we term a concurrent order dispatching process optimizing order bundling, courier matching and route planning jointly. Our study proposes a comprehensive framework that intricately models the concurrent order dispatching process in great detail. Specifically, we construct a mixed-integer programming model and develop a hybrid heuristic algorithm to address the issue in an efficient manner. We introduce a novel order-bundling closeness measurement value to strategically dispatch multiple orders concurrently to each single courier during a designated decision time window. To assess the model’s and algorithm’s efficacy, we conducted experiments on both small-scale synthetic instances and large-scale real cases, utilizing data from a prominent online food delivery platform in China. The computational results demonstrate that our proposed approach yields solutions that are very close to the optimum in small-scale cases, and achieves significant improvements in terms of average delay time reduction and average distance savings in large-scale cases. In particular, our approach can save the average distance per order by 1.8 km and reduce the average delay time per order from 35 min to 10 min, in comparison to existing policies. We seek to ensure that a significant portion of orders are delivered on time, even with a limited number of couriers.

Authors

Zhu S; Hu X; Zhuang Y; Yuan Y; Wang W; Wang Z

Journal

Computers & Operations Research, Vol. 189, ,

Publisher

Elsevier

Publication Date

May 1, 2026

DOI

10.1016/j.cor.2026.107387

ISSN

0305-0548

Contact the Experts team