skip to main content
10.1145/3637528.3671643acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Harvesting Efficient On-Demand Order Pooling from Skilled Couriers: Enhancing Graph Representation Learning for Refining Real-time Many-to-One Assignments

Published: 24 August 2024 Publication History

Abstract

The recent past has witnessed a notable surge in on-demand food delivery (OFD) services, offering delivery fulfillment within dozens of minutes after an order is placed. In OFD, pooling multiple orders for simultaneous delivery in real-time order assignment is a pivotal efficiency source, which may in turn extend delivery time. Constructing high-quality order pooling to harmonize platform efficiency with the experiences of consumers and couriers, is crucial to OFD platforms. However, the complexity and real-time nature of order assignment, making extensive calculations impractical, significantly limit the potential for order consolidation. Moreover, offline environment is frequently riddled with unknown factors, posing challenges for the platform's perceptibility and pooling decisions.
Nevertheless, delivery behaviors of skilled couriers (SCs) who know the environment well, can improve system awareness and effectively inform decisions. Hence a SC delivery network (SCDN) is constructed, based on an enhanced attributed heterogeneous network embedding approach tailored for OFD. It aims to extract features from rich temporal and spatial information, and uncover the latent potential for order combinations embedded within SC trajectories. Accordingly, the vast search space of order assignment can be effectively pruned through scalable similarity calculations of low-dimensional vectors, making comprehensive and high-quality pooling outcomes more easily identified in real time. In addition, the acquired embedding outcomes highlight promising subspaces embedded within this space, i.e., scale-effect hotspot areas, which can offer significant potential for elevating courier efficiency. SCDN has now been deployed in Meituan dispatch system. Online tests reveal that with SCDN, the pooling quality and extent have been greatly improved. And our system can boost couriers' efficiency by 45-55% during noon peak hours, while upholding the timely delivery commitment.

Supplemental Material

MP4 File - kdd_ads_823_video
2 min Video about the paper ""Harvesting Efficient On-Demand Order Pooling from Skilled Couriers: Enhancing Graph Representation Learning for Refining Real-time Many-to-One Assignments"

References

[1]
Olivier Briant, Hadrien Cambazard, Diego Cattaruzza, Nicolas Catusse, Anne-Laure Ladier, and Maxime Ogier. 2020. An efficient and general approach for the joint order batching and picker routing problem. European journal of operational research, Vol. 285, 2 (2020), 497--512.
[2]
Yukuo Cen, Xu Zou, Jianwei Zhang, Hongxia Yang, Jingren Zhou, and Jie Tang. 2019. Representation learning for attributed multiplex heterogeneous network. In Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. 1358--1368.
[3]
Jing-Fang Chen, Ling Wang, Hao Ren, Jize Pan, Shengyao Wang, Jie Zheng, and Xing Wang. 2022. An imitation learning-enhanced iterated matching algorithm for on-demand food delivery. IEEE Transactions on Intelligent Transportation Systems, Vol. 23, 10 (2022), 18603--18619.
[4]
Peng Cui, Xiao Wang, Jian Pei, and Wenwu Zhu. 2018. A survey on network embedding. IEEE transactions on knowledge and data engineering, Vol. 31, 5 (2018), 833--852.
[5]
Tao Feng, Huan Yan, Huandong Wang, Wenzhen Huang, Yuyang Han, Hongsen Liao, Jinghua Hao, and Yong Li. 2023. ILRoute: A Graph-based Imitation Learning Method to Unveil Riders' Routing Strategies in Food Delivery Service. In Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 4024--4034.
[6]
Mihajlo Grbovic and Haibin Cheng. 2018. Real-time personalization using embeddings for search ranking at airbnb. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. 311--320.
[7]
Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. 855--864.
[8]
Qingbo Hu, Sihong Xie, Jiawei Zhang, Qiang Zhu, Songtao Guo, and Philip S Yu. 2016. HeteroSales: Utilizing heterogeneous social networks to identify the next enterprise customer. In Proceedings of the 25th International Conference on World Wide Web. 41--50.
[9]
Shenggong Ji, Yu Zheng, Zhaoyuan Wang, and Tianrui Li. 2019. Alleviating users' pain of waiting: Effective task grouping for online-to-offline food delivery services. In The World Wide Web Conference. 773--783.
[10]
Manas Joshi, Arshdeep Singh, Sayan Ranu, Amitabha Bagchi, Priyank Karia, and Puneet Kala. 2021. Batching and matching for food delivery in dynamic road networks. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 2099--2104.
[11]
Manas Joshi, Arshdeep Singh, Sayan Ranu, Amitabha Bagchi, Priyank Karia, and Puneet Kala. 2022. FoodMatch: Batching and Matching for Food Delivery in Dynamic Road Networks. ACM Transactions on Spatial Algorithms and Systems (TSAS), Vol. 8, 1 (2022), 1--25.
[12]
Krishnaram Kenthapadi, Benjamin Le, and Ganesh Venkataraman. 2017. Personalized job recommendation system at linkedin: Practical challenges and lessons learned. In Proceedings of the eleventh ACM conference on recommender systems. 346--347.
[13]
Shima Khoshraftar and Aijun An. 2022. A survey on graph representation learning methods. arXiv preprint arXiv:2204.01855 (2022).
[14]
Yile Liang, Donghui Li, Jiuxia Zhao, Xuetao Ding, Huanjia Lian, Jinghua Hao, and Renqing He. 2023. Enhancing Dynamic On-demand Food Order Dispatching via Future-informed and Spatial-temporal Extended Decisions. In Proceedings of the 32nd ACM International Conference on Information and Knowledge Management. 4702--4708.
[15]
Vittorio Maniezzo, Thomas St�tzle, and Stefan Vo�. 2021. Matheuristics. Springer.
[16]
Eva-Marie Meemken, Marc F Bellemare, Thomas Reardon, and Carolina M Vargas. 2022. Research and policy for the food-delivery revolution. Science, Vol. 377, 6608 (2022), 810--813.
[17]
Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Corrado, and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality. Advances in neural information processing systems, Vol. 26 (2013).
[18]
Seyedali Mirjalili and Seyedali Mirjalili. 2019. Genetic algorithm. Evolutionary Algorithms and Neural Networks: Theory and Applications (2019), 43--55.
[19]
Eduardo G Pardo, Sergio Gil-Borr�s, Antonio Alonso-Ayuso, and Abraham Duarte. 2023. Order Batching Problems: taxonomy and literature review. European Journal of Operational Research (2023).
[20]
Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. 701--710.
[21]
Rohan Ramanath, Hakan Inan, Gungor Polatkan, Bo Hu, Qi Guo, Cagri Ozcaglar, Xianren Wu, Krishnaram Kenthapadi, and Sahin Cem Geyik. 2018. Towards deep and representation learning for talent search at linkedin. In Proceedings of the 27th ACM international conference on information and knowledge management. 2253--2261.
[22]
Damian Reyes, Alan Erera, Martin Savelsbergh, Sagar Sahasrabudhe, and Ryan O'Neil. 2018. The meal delivery routing problem. Optimization Online, Vol. 6571 (2018).
[23]
Akhil Shetty, Junjie Qin, Kameshwar Poolla, and Pravin Varaiya. 2022. The Value of Pooling in Last-Mile Delivery. In 2022 IEEE 61st Conference on Decision and Control (CDC). IEEE, 531--538.
[24]
Michele D Simoni and Matthias Winkenbach. 2023. Crowdsourced on-demand food delivery: An order batching and assignment algorithm. Transportation Research Part C: Emerging Technologies, Vol. 149 (2023), 104055.
[25]
Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, and Qiaozhu Mei. 2015. Line: Large-scale information network embedding. In Proceedings of the 24th international conference on world wide web. 1067--1077.
[26]
Lei Tang, Zihang Liu, Rongguo Zhang, Zongtao Duan, and Yunji Liang. 2021. Who Will Travel With Me? Personalized Ranking Using Attributed Network Embedding for Pooling. IEEE Transactions on Intelligent Transportation Systems, Vol. 23, 8 (2021), 12311--12327.
[27]
Lei Tang, Zihang Liu, Yaling Zhao, Zongtao Duan, and Jingchi Jia. 2020. Efficient ridesharing framework for ride-matching via heterogeneous network embedding. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 14, 3 (2020), 1--24.
[28]
Jizhe Wang, Pipei Huang, Huan Zhao, Zhibo Zhang, Binqiang Zhao, and Dik Lun Lee. 2018. Billion-scale commodity embedding for e-commerce recommendation in alibaba. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining. 839--848.
[29]
Xing Wang, Ling Wang, Shengyao Wang, Yang Yu, Jing-fang Chen, and Jie Zheng. 2021. Solving online food delivery problem via an effective hybrid algorithm with intelligent batching strategy. In International Conference on Intelligent Computing. Springer, 340--354.
[30]
Jianglong Yang, Li Zhou, and Huwei Liu. 2021. Hybrid genetic algorithm-based optimisation of the batch order picking in a dense mobile rack warehouse. Plos one, Vol. 16, 4 (2021), e0249543.
[31]
Baris Yildiz and Martin Savelsbergh. 2019. Provably high-quality solutions for the meal delivery routing problem. Transportation Science, Vol. 53, 5 (2019), 1372--1388.
[32]
Yang Yu, Qingte Zhou, Shenglin Yi, Huanyu Zheng, Shengyao Wang, Jinghua Hao, Renqing He, and Zhizhao Sun. 2021. Delay to group in food delivery system: A prediction approach. In International Conference on Intelligent Computing. Springer, 540--551.
[33]
Lingyu Zhang, Tao Hu, Yue Min, Guobin Wu, Junying Zhang, Pengcheng Feng, Pinghua Gong, and Jieping Ye. 2017. A taxi order dispatch model based on combinatorial optimization. In Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining. 2151--2159.
[34]
Jie Zheng, Ling Wang, Li Wang, Shengyao Wang, Jing-Fang Chen, and Xing Wang. 2022. Solving stochastic online food delivery problem via iterated greedy algorithm with decomposition-based strategy. IEEE Transactions on Systems, Man, and Cybernetics: Systems, Vol. 53, 2 (2022), 957--969.
[35]
Qingte Zhou, Huanyu Zheng, Shengyao Wang, Jinghua Hao, Renqing He, Zhizhao Sun, Xing Wang, and Ling Wang. 2020. Two fast heuristics for online order dispatching. In 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, 1--8.
[36]
Yida Zhu, Liying Chen, Daping Xiong, Shuiping Chen, Fangxiao Du, Jinghua Hao, Renqing He, and Zhizhao Sun. 2023. C-AOI: Contour-based Instance Segmentation for High-Quality Areas-of-Interest in Online Food Delivery Platform. In Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 5750--5759.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '24: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
August 2024
6901 pages
ISBN:9798400704901
DOI:10.1145/3637528
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 August 2024

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. graph representation learning
  2. many-to-one assignment problem
  3. on-demand food delivery
  4. order pooling

Qualifiers

  • Research-article

Conference

KDD '24
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 61
    Total Downloads
  • Downloads (Last 12 months)61
  • Downloads (Last 6 weeks)47
Reflects downloads up to 16 Oct 2024

Other Metrics

Citations

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media