Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3394486.3403307acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Order Fulfillment Cycle Time Estimation for On-Demand Food Delivery

Published: 20 August 2020 Publication History
  • Get Citation Alerts
  • Abstract

    By providing customers with conveniences such as easy access to an extensive variety of restaurants, effortless food ordering and fast delivery, on-demand food delivery (OFD) platforms have achieved explosive growth in recent years. A crucial machine learning task performed at OFD platforms is prediction of the Order Fulfillment Cycle Time (OFCT), which refers to the amount of time elapsed between a customer places an order and he/she receives the meal. The accuracy of predicted OFCT is important for customer satisfaction, as it needs to be communicated to a customer before he/she places the order, and is considered as a service promise that should be fulfilled as well as possible. As a result, the estimated OFCT also heavily influences planning decisions such as dispatching and routing.
    In this paper, we present the OFCT prediction model that is currently deployed at Ele.me, which is one of the world's largest OFD platforms and delivers over 10 million meals in more than 200 Chinese cities every day. By dissecting the order fulfillment cycle of a meal order, we identify key factors behind OFCT, and capture them with numerous features constructed using a wide range of data sources. These features are fed into a deep neural network (DNN), which further incorporates representations of couriers, restaurants and delivery destinations to enhance prediction efficacy. Finally, a novel post-processing layer is introduced to improve convergence speed by better accounting for the distributional mismatch between the true OFCT values and those predicted by the model at initialization. Extensive offline and online experiments demonstrate the effectiveness of our approach.

    Supplementary Material

    MP4 File (3394486.3403307.mp4)
    A brief description of the model deployed at Ele.me for predicting order fulfillment cycle time (OFCT), which refers to the amount of time elapsed between a customer places an order and he/she receives the meal.

    References

    [1]
    Roberto Baldacci, Aristide Mingozzi, and Roberto Roberti. 2012. Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research, Vol. 218, 1 (2012), 1 -- 6.
    [2]
    James S Bergstra, Rémi Bardenet, Yoshua Bengio, and Balázs Kégl. 2011. Algorithms for hyper-parameter optimization. In NIPS. 2546--2554.
    [3]
    Djork-Arné Clevert, Thomas Unterthiner, and Sepp Hochreiter. 2016. Fast and accurate deep network learning by exponential linear units (elus). In ICLR.
    [4]
    Daxue Consulting. 2019. The food delivery market in Great China in 2019. https://daxueconsulting.com/o2o-food-delivery-market-in-china/ Retrieved September 1, 2019 from
    [5]
    Paul Covington, Jay Adams, and Emre Sargin. 2016. Deep neural networks for youtube recommendations. In RecSys. 191--198.
    [6]
    Teodor Gabriel Crainic, Nicoletta Ricciardi, and Giovanni Storchi. 2009. Models for evaluating and planning city logistics systems. Transportation Science, Vol. 43, 4 (2009), 432--454.
    [7]
    Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In NAACL. 4171--4186.
    [8]
    Uber Eats. 2019. Uber Announces Results for Third Quarter 2019. https://investor.uber.com/news-events/news/press-release-details/2019/Uber-Announces-Results-for-Third-Quarter-2019/ Retrieved December 20, 2019 from
    [9]
    Xavier Glorot and Yoshua Bengio. 2010. Understanding the difficulty of training deep feedforward neural networks. In AISTATS. 249--256.
    [10]
    Huifeng Guo, Ruiming Tang, Yunming Ye, Zhenguo Li, and Xiuqiang He. 2017. DeepFM: a factorization-machine based neural network for CTR prediction. In IJCAI. 1725--1731.
    [11]
    Malay Haldar, Mustafa Abdool, Prashant Ramanathan, Tao Xu, Shulin Yang, Huizhong Duan, Qing Zhang, Nick Barrow-Williams, Bradley C Turnbull, Brendan M Collins, et almbox. 2019. Applying deep learning to Airbnb search. In SIGKDD. 1927--1935.
    [12]
    Yixiao Huang, Lei Zhao, Warren B Powell, Yue Tong, and Ilya O Ryzhov. 2019. Optimal Learning for Urban Delivery Fleet Allocation. Transportation Science, Vol. 53, 3 (2019), 623--641.
    [13]
    Herve Jegou, Matthijs Douze, and Cordelia Schmid. 2010. Product quantization for nearest neighbor search. TPAMI, Vol. 33, 1 (2010), 117--128.
    [14]
    J. Johnson, M. Douze, and H. J??gou. 2020. Billion-scale similarity search with GPUs. IEEE Transactions on Big Data (2020), in press.
    [15]
    Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. 2017. Lightgbm: A highly efficient gradient boosting decision tree. In NIPS. 3146--3154.
    [16]
    Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014).
    [17]
    Wang-Chien Lee, Weiping Si, Ling-Jyh Chen, and Meng Chang Chen. 2012. HTTP: a new framework for bus travel time prediction based on historical trajectories. In SIGSPATIAL. 279--288.
    [18]
    Xiucheng Li, Gao Cong, Aixin Sun, and Yun Cheng. 2019. Learning Travel Time Distributions with Deep Generative Model. In WWW. 1017--1027.
    [19]
    Yaguang Li, Kun Fu, Zheng Wang, Cyrus Shahabi, Jieping Ye, and Yan Liu. 2018. Multi-task representation learning for travel time estimation. In SIGKDD. 1695--1704.
    [20]
    Jianxun Lian, Xiaohuan Zhou, Fuzheng Zhang, Zhongxia Chen, Xing Xie, and Guangzhong Sun. 2018. xdeepfm: Combining explicit and implicit feature interactions for recommender systems. In SIGKDD. 1754--1763.
    [21]
    Vitória Pureza and Gilbert Laporte. 2008. Waiting and buffering strategies for the dynamic pickup and delivery problem with time windows. INFOR, Vol. 46, 3 (2008), 165--175.
    [22]
    Raghav Ramesh. 2018. How DoorDash leverages AI in its world-class on-demand logistics engine. https://conferences.oreilly.com/artificial-intelligence/ai-ny-2018/public/schedule/detail/65038/ Retrieved December 15, 2019 from
    [23]
    Matteo Salani and Maria Battarra. 2018. The opportunity cost of time window violations. EURO Journal on Transportation and Logistics, Vol. 7, 4 (2018), 343--361.
    [24]
    Remy Spliet and Adriana F. Gabor. 2015. The Time Window Assignment Vehicle Routing Problem. Transportation Science, Vol. 49, 4 (2015), 721--731.
    [25]
    Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014. Dropout: a simple way to prevent neural networks from overfitting. JMLR, Vol. 15, 1 (2014), 1929--1958.
    [26]
    Anirudh Subramanyam, Akang Wang, and Chrysanthos E Gounaris. 2018. A scenario decomposition algorithm for strategic time window assignment vehicle routing problems. Transportation Research Part B: Methodological, Vol. 117 (2018), 296--317.
    [27]
    Yongxin Tong, Yuxiang Zeng, Zimu Zhou, Lei Chen, Jieping Ye, and Ke Xu. 2018. A unified approach to route planning for shared mobility. VLDB, Vol. 11, 11 (2018), 1633--1646.
    [28]
    Marlin W. Ulmer and Barrett W. Thomas. 2019. Enough Waiting for the Cable Guy--Estimating Arrival Times for Service Vehicle Routing. Transportation Science, Vol. 53, 3 (2019), 897--916.
    [29]
    Anastasios D Vareias, Panagiotis P Repoussis, and Christos D Tarantilis. 2017. Assessing customer service reliability in route planning with self-imposed time windows and stochastic travel times. Transportation Science, Vol. 53, 1 (2017), 256--281.
    [30]
    Thibaut Vidal, Gilbert Laporte, and Piotr Matl. 2020. A concise guide to existing and emerging vehicle routing problem variants. European Journal of Operational Research, Vol. 286, 2 (2020), 401--416.
    [31]
    Hongjian Wang, Xianfeng Tang, Yu-Hsuan Kuo, Daniel Kifer, and Zhenhui Li. 2019. A simple baseline for travel time estimation using large-scale trip data. ACM Transactions on Intelligent Systems and Technology, Vol. 10, 2 (2019), 19.
    [32]
    Zi Wang. 2019. Time Predictions in Uber Eats. https://www.infoq.com/articles/uber-eats-time-predictions/ Retrieved December 15, 2019 from
    [33]
    Zheng Wang, Kun Fu, and Jieping Ye. 2018. Learning to estimate the travel time. In SIGKDD. 858--866.
    [34]
    Zheng Yang, Chenshu Wu, and Yunhao Liu. 2012. Locating in Fingerprint Space: Wireless Indoor Localization with Little Human Intervention. In MobiCom. 269--280.
    [35]
    Huaxiu Yao, Fei Wu, Jintao Ke, Xianfeng Tang, Yitian Jia, Siyu Lu, Pinghua Gong, Jieping Ye, and Zhenhui Li. 2018. Deep multi-view spatial-temporal network for taxi demand prediction. In AAAI.
    [36]
    Hamed Zamani, Mostafa Dehghani, W. Bruce Croft, Erik Learned-Miller, and Jaap Kamps. 2018. From Neural Re-Ranking to Neural Ranking: Learning a Sparse Representation for Inverted Indexing. In CIKM. 497--506.
    [37]
    Guorui Zhou, Xiaoqiang Zhu, Chenru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, and Kun Gai. 2018. Deep Interest Network for Click-Through Rate Prediction. In SIGKDD. 1059--1068.
    [38]
    Lin Zhu, Yihong Chen, and Bowen He. 2019. A Domain Generalization Perspective on Listwise Context Modeling. In AAAI. 5965--5972.

    Cited By

    View all
    • (2024)Package Arrival Time Prediction via Knowledge Distillation Graph Neural NetworkACM Transactions on Knowledge Discovery from Data10.1145/364303318:5(1-19)Online publication date: 28-Feb-2024
    • (2024)Time-Constrained Actor-Critic Reinforcement Learning for Concurrent Order Dispatch in On-Demand DeliveryIEEE Transactions on Mobile Computing10.1109/TMC.2023.334281523:8(8175-8192)Online publication date: Aug-2024
    • (2024)Multi-source Domain Adaptation Enhanced Warehouse Dwell Time PredictionIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3324656(1-15)Online publication date: 2024
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    KDD '20: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
    August 2020
    3664 pages
    ISBN:9781450379984
    DOI:10.1145/3394486
    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 ACM 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: 20 August 2020

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. neural networks
    2. on-demand food delivery
    3. order fulfillment cycle time estimation

    Qualifiers

    • Research-article

    Conference

    KDD '20
    Sponsor:

    Acceptance Rates

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

    Upcoming Conference

    KDD '24

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)297
    • Downloads (Last 6 weeks)19
    Reflects downloads up to 09 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Package Arrival Time Prediction via Knowledge Distillation Graph Neural NetworkACM Transactions on Knowledge Discovery from Data10.1145/364303318:5(1-19)Online publication date: 28-Feb-2024
    • (2024)Time-Constrained Actor-Critic Reinforcement Learning for Concurrent Order Dispatch in On-Demand DeliveryIEEE Transactions on Mobile Computing10.1109/TMC.2023.334281523:8(8175-8192)Online publication date: Aug-2024
    • (2024)Multi-source Domain Adaptation Enhanced Warehouse Dwell Time PredictionIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3324656(1-15)Online publication date: 2024
    • (2024)Attention Enhanced Package Pick-Up Time Prediction via Heterogeneous Behavior ModelingAlgorithms and Architectures for Parallel Processing10.1007/978-981-97-0862-8_12(189-208)Online publication date: 1-Mar-2024
    • (2023)Short-Term Demand Prediction for On-Demand Food Delivery with Attention-Based Convolutional LSTMSystems10.3390/systems1110048511:10(485)Online publication date: 22-Sep-2023
    • (2023)OPTI: Order Preparation Time Inference for On-demand DeliveryACM Transactions on Sensor Networks10.1145/359261019:4(1-18)Online publication date: 10-Jul-2023
    • (2023)DeepSTA: A Spatial-Temporal Attention Network for Logistics Delivery Timely Rate Prediction in Anomaly ConditionsProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3614671(4916-4922)Online publication date: 21-Oct-2023
    • (2023)Enough Waiting for the Couriers: Learning to Estimate Package Pick-up Arrival Time from Couriers’ Spatial-Temporal BehaviorsACM Transactions on Intelligent Systems and Technology10.1145/358256114:3(1-22)Online publication date: 13-Apr-2023
    • (2023)Uncertainty-Aware Probabilistic Travel Time Prediction for On-Demand Ride-Hailing at DiDiProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599925(4516-4526)Online publication date: 6-Aug-2023
    • (2023)Towards Equitable Assignment: Data-Driven Delivery Zone Partition at Last-mile LogisticsProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599915(4078-4088)Online publication date: 6-Aug-2023
    • Show More Cited By

    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