Concurrent Order Dispatch for Instant Delivery with Time-Constrained Actor-Critic Reinforcement Learning
Baoshen Guo, Shuai Wang, Yi Ding, Guang Wang, Suining He, Desheng Zhang, Tian He
Abstract
Instant delivery has developed rapidly in recent years and significantly changed the lifestyle of people due to its timeliness and convenience. In instant delivery, the order dispatch process is concurrent. Couriers take new orders continuously and deliver multiple orders in a delivery trip (i.e., a batch). The delivery time of orders in a batch is often overlapped and interlinked with each other. The pickup and delivery sequence of the existing orders in a batch changes dynamically due to time constraints and real-time overdue possibility (i.e., the rate of deliveries that are not finished in promised time). Most of existing order dispatch mechanisms are designed for independent order dispatch or concurrent delivery without strict time constraints, hence are incapable of handling real-time concurrent dispatch with strict time constraints in on-demand instant delivery. To address the challenge, we propose a Time-Constrained Actor- Critic Reinforcement learning based concurrent dispatch system called TCAC-Dispatch to enhance the long-term overall revenue and reduce the overdue rate. Specifically, we design a deep matching network (DMN) with a variable action space, which integrates the state embedding (including route behaviors encoding) and actions embedding features into a long-term matching value. Then the Actor-Critic model tackles the concurrent order dispatch problem considering strict time constraints and stochastic demand-supply in instant delivery. An estimated time-based action pruning module is designed to ensure time constraints guarantee and accelerate the training as well as dispatching processes. We evaluate the TCAC-Dispatch with one-month data involved with 36.48 million orders and 42,000 couriers collected from one of the largest instant delivery companies in China, i.e., Eleme. Empirical experiments are conducted on a data-driven emulator deployed on the development environment of Eleme and results show that our method achieves 22% of the increase in total revenue and reduces the overdue rate by 21.6%.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Related papers
- -SiteRec: Store Site Recommendation under the O2O Model via Multi-graph Attention NetworksHua Yan, Shuai Wang, Yu Yang, Baoshen Guo et al.ICDE 2022 · 26 citations
- NondBREM: Nondeterministic Offline Reinforcement Learning for Large-Scale Order DispatchingHongbo Zhang, Guang Wang, Xu Wang, Zhengyang Zhou et al.AAAI 2024 · 9 citations
- Cooperative Air-Ground Instant Delivery by UAVs and Crowdsourced TaxisJunhui Gao, Qianru Wang, Xin Zhang, Juan Shi et al.ICDE 2024 · 13 citations
- TransLoc: transparent indoor localization with uncertain human participation for instant deliveryYu Yang, Yi Ding, Dengpan Yuan, Guang Wang et al.MobiCom 2020 · 35 citations
- Towards Variance Reduction for Reinforcement Learning of Industrial Decision-making Tasks: A Bi-Critic based Demand-Constraint Decoupling ApproachJianyong Yuan, Jiayi Zhang, Zinuo Cai, Junchi YanKDD 2023 · 4 citations
