Order Fulfillment Cycle Time Estimation for On-Demand Food Delivery

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.

[1]  Yoshua Bengio,et al.  Algorithms for Hyper-Parameter Optimization , 2011, NIPS.

[2]  Yunhao Liu,et al.  Locating in fingerprint space: wireless indoor localization with little human intervention , 2012, Mobicom '12.

[3]  Jieping Ye,et al.  A Unified Approach to Route Planning for Shared Mobility , 2018, Proc. VLDB Endow..

[4]  Gilbert Laporte,et al.  Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows , 2008, INFOR Inf. Syst. Oper. Res..

[5]  Teodor Gabriel Crainic,et al.  Models for Evaluating and Planning City Logistics Systems , 2009, Transp. Sci..

[6]  Tie-Yan Liu,et al.  LightGBM: A Highly Efficient Gradient Boosting Decision Tree , 2017, NIPS.

[7]  Guorui Zhou,et al.  Deep Interest Network for Click-Through Rate Prediction , 2017, KDD.

[8]  Ming-Wei Chang,et al.  BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding , 2019, NAACL.

[9]  Barrett W. Thomas,et al.  Enough Waiting for the Cable Guy - Estimating Arrival Times for Service Vehicle Routing , 2019, Transp. Sci..

[10]  Adriana Felicia Gabor,et al.  The Time Window Assignment Vehicle Routing Problem , 2012, Transp. Sci..

[11]  Wang-Chien Lee,et al.  HTTP: a new framework for bus travel time prediction based on historical trajectories , 2012, SIGSPATIAL/GIS.

[12]  Roberto Roberti,et al.  Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints , 2012, Eur. J. Oper. Res..

[13]  Zheng Wang,et al.  Multi-task Representation Learning for Travel Time Estimation , 2018, KDD.

[14]  Sepp Hochreiter,et al.  Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs) , 2015, ICLR.

[15]  Matteo Salani,et al.  The opportunity cost of time window violations , 2018, EURO J. Transp. Logist..

[16]  Daniel Kifer,et al.  A simple baseline for travel time estimation using large-scale trip data , 2015, SIGSPATIAL/GIS.

[17]  Paul Covington,et al.  Deep Neural Networks for YouTube Recommendations , 2016, RecSys.

[18]  Gao Cong,et al.  Learning Travel Time Distributions with Deep Generative Model , 2019, WWW.

[19]  Yunming Ye,et al.  DeepFM: A Factorization-Machine based Neural Network for CTR Prediction , 2017, IJCAI.

[20]  Cordelia Schmid,et al.  Product Quantization for Nearest Neighbor Search , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Christos D. Tarantilis,et al.  Assessing Customer Service Reliability in Route Planning with Self-Imposed Time Windows and Stochastic Travel Times , 2019, Transp. Sci..

[22]  Jimmy Ba,et al.  Adam: A Method for Stochastic Optimization , 2014, ICLR.

[23]  Nitish Srivastava,et al.  Dropout: a simple way to prevent neural networks from overfitting , 2014, J. Mach. Learn. Res..

[24]  Chrysanthos E. Gounaris,et al.  A Scenario Decomposition Algorithm for Strategic Time Window Assignment Vehicle Routing Problems , 2018, ArXiv.

[25]  Jieping Ye,et al.  Deep Multi-View Spatial-Temporal Network for Taxi Demand Prediction , 2018, AAAI.

[26]  Yoshua Bengio,et al.  Understanding the difficulty of training deep feedforward neural networks , 2010, AISTATS.

[27]  Jeff Johnson,et al.  Billion-Scale Similarity Search with GPUs , 2017, IEEE Transactions on Big Data.

[28]  Xing Xie,et al.  xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems , 2018, KDD.

[29]  Lin Zhu,et al.  A Domain Generalization Perspective on Listwise Context Modeling , 2019, AAAI.

[30]  Zheng Wang,et al.  Learning to Estimate the Travel Time , 2018, KDD.

[31]  Lei Zhao,et al.  Optimal Learning for Urban Delivery Fleet Allocation , 2019, Transp. Sci..

[32]  Tao Xu,et al.  Applying Deep Learning to Airbnb Search , 2018, KDD.

[33]  Gilbert Laporte,et al.  A concise guide to existing and emerging vehicle routing problem variants , 2019, Eur. J. Oper. Res..

[34]  W. Bruce Croft,et al.  From Neural Re-Ranking to Neural Ranking: Learning a Sparse Representation for Inverted Indexing , 2018, CIKM.