Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery Service

Recently on-demand food delivery service has become very popular in China. More than 30 million orders are placed by eaters of Meituan-Dianping everyday. Delicacies are delivered to eaters in 30 minutes on average. To fully leverage the ability of our couriers and restaurants, delivery scope is proposed as an infrastructure product for on-demand food delivery area. A delivery scope based retrieval system is designed and built on our platform. In order to draw suitable delivery scopes for millions of restaurant partners, we propose a pioneering delivery scope generation framework. In our framework, a single delivery scope generation algorithm is proposed by using spatial computational techniques and data mining techniques. Moreover, a scope scoring algorithm and decision algorithm are proposed by utilizing machine learning models and combinatorial optimization techniques. Specifically, we propose a novel delivery scope sample generation method and use the scope related features to estimate order numbers and average delivery time in a period of time for each delivery scope. Then we formalize the candidate scopes selection process as a binary integer programming problem. Both branch&bound algorithm and a heuristic search algorithm are integrated in our system. Results of online experiments show that scopes generated by our new algorithm significantly outperform manual generated ones. Our algorithm brings more orders without hurt of users' experience. After deployed online, our system has saved thousands of hours for operation staff, and it is considered to be one of the most useful operation tools to balance demand of eaters and supply of restaurants and couriers.

[1]  M. Shunko,et al.  How To Find Your Most Valuable Service Outlets: Measuring Influence Using Network Analysis , 2019, SSRN Electronic Journal.

[2]  Andy Liaw,et al.  Classification and Regression by randomForest , 2007 .

[3]  Martin W. P. Savelsbergh,et al.  Service and capacity planning in crowd-sourced delivery , 2019, Transportation Research Part C: Emerging Technologies.

[4]  Christian S. Jensen,et al.  Top-k point of interest retrieval using standard indexes , 2014, SIGSPATIAL/GIS.

[5]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[6]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[7]  Shin-Ting Wu,et al.  A non-self-intersection Douglas-Peucker algorithm , 2003, 16th Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2003).

[8]  Kunpeng Zhang,et al.  Adversarial Point-of-Interest Recommendation , 2019, WWW.

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  Thomas L. Magnanti,et al.  Applied Mathematical Programming , 1977 .

[11]  Mohamed F. Mokbel,et al.  Location-based and preference-aware recommendation using sparse geo-social networking data , 2012, SIGSPATIAL/GIS.

[12]  Michael R. Lyu,et al.  STELLAR: Spatial-Temporal Latent Ranking for Successive Point-of-Interest Recommendation , 2016, AAAI.

[13]  Tianqi Chen,et al.  XGBoost: A Scalable Tree Boosting System , 2016, KDD.

[14]  Weitong Chen,et al.  Learning Graph-based POI Embedding for Location-based Recommendation , 2016, CIKM.

[15]  Antony Galton,et al.  Efficient generation of simple polygons for characterizing the shape of a set of points in the plane , 2008, Pattern Recognit..

[16]  J. Clausen,et al.  Branch and Bound Algorithms-Principles and Examples , 2003 .