Chengliang Gao
ABSTRACT
Online food ordering and delivery service has widely served people's daily demands worldwide, e.g., it has reached a number of 34.9 million online orders per day in Q3 of 2020 in Meituan food delivery platform. For the food delivery service, accurate estimation of the driver's delivery route and time, defined as the FD-RTP task, is very significant to customer satisfaction and driver experience. In the paper, we apply deep learning to the FD-RTP task for the first time, and propose a deep network named FDNET. Different from traditional heuristic search algorithms, we predict the probability of each feasible location the driver will visit next, through mining a large amount of food delivery data. Guided by the probabilities, FDNET greatly reduces the search space in delivery route generation, and the calculation times of time prediction. As a result, various kinds of information can be fully utilized in FDNET within the limited computation time. Careful consideration of the factors having effect on the driver's behaviors and introduction of more abundant spatiotemporal information both contribute to the improvements. Offline experiments over the large-scale real-world dataset, and online A/B test demonstrate the effectiveness of our proposed FDNET.
Supplemental Material
- Abdulrahman Al-Molegi, Mohammed Jabreel, and Baraq Ghaleb. 2016. STF-RNN: Space Time Features-based Recurrent Neural Network for predicting people next location. In 2016 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, 1--7.Google Scholar
Cross Ref
- Richard Barnes, Senaka Buthpitiya, James Cook, Alex Fabrikant, Andrew Tomkins, and Fangzhou Xu. 2020. BusTr: Predicting Bus Travel Times from Real-Time Traffic. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . 3243--3251.Google ScholarDigital Library
- Tianqi Chen and Carlos Guestrin. 2016. Xgboost: A scalable tree boosting system. In Proceedings of the 22nd acm sigkdd international conference on knowledge discovery and data mining . 785--794.Google ScholarDigital Library
- Zaiben Chen, Heng Tao Shen, and Xiaofang Zhou. 2011. Discovering popular routes from trajectories. In 2011 IEEE 27th International Conference on Data Engineering. IEEE, 900--911.Google ScholarDigital Library
- Xuetao Ding, Runfeng Zhang, Zhen Mao, Ke Xing, Fangxiao Du, Xingyu Liu, Guoxing Wei, Feifan Yin, Renqing He, and Zhizhao Sun. 2020. Delivery Scope: A New Way of Restaurant Retrieval for On-demand Food Delivery Service. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . 3026--3034.Google ScholarDigital Library
- Huifeng Guo, Ruiming Tang, Yunming Ye, Zhenguo Li, and Xiuqiang He. 2017. DeepFM: a factorization-machine based neural network for CTR prediction. In Proceedings of the 26th International Joint Conference on Artificial Intelligence . 1725--1731.Google ScholarCross Ref
- Sepp Hochreiter and Jürgen Schmidhuber. 1997. Long short-term memory. Neural computation , Vol. 9, 8 (1997), 1735--1780.Google Scholar
- Huiting Hong, Yucheng Lin, Xiaoqing Yang, Zang Li, Kung Fu, Zheng Wang, Xiaohu Qie, and Jieping Ye. 2020. HetETA: Heterogeneous information network embedding for estimating time of arrival. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2444--2454.Google ScholarDigital Library
- Ishan Jindal, Xuewen Chen, Matthew Nokleby, Jieping Ye, et almbox. 2017. A unified neural network approach for estimating travel time and distance for a taxi trip. arXiv preprint arXiv:1710.04350 (2017).Google Scholar
- Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014).Google Scholar
- Wuman Luo, Haoyu Tan, Lei Chen, and Lionel M Ni. 2013. Finding time period-based most frequent path in big trajectory data. In Proceedings of the 2013 ACM SIGMOD international conference on management of data . 713--724.Google ScholarDigital Library
- Minh-Thang Luong, Hieu Pham, and Christopher D Manning. 2015. Effective Approaches to Attention-based Neural Machine Translation. In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing . 1412--1421.Google ScholarCross Ref
- Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014. Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research , Vol. 15, 1 (2014), 1929--1958.Google Scholar
- 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 (TIST) , Vol. 10, 2 (2019), 1--22.Google ScholarDigital Library
- Xing Wang, Shengyao Wang, Ling Wang, Huanyu Zheng, Jinghua Hao, Renqing He, and Zhizhao Sun. 2020. An Effective Iterated Greedy Algorithm for Online Route Planning Problem. In 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, 1--8.Google Scholar
- Yilun Wang, Yu Zheng, and Yexiang Xue. 2014. Travel time estimation of a path using sparse trajectories. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining . 25--34.Google ScholarDigital Library
- Zheng Wang, Kun Fu, and Jieping Ye. 2018. Learning to estimate the travel time. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining . 858--866.Google ScholarDigital Library
- Ling-Yin Wei, Yu Zheng, and Wen-Chih Peng. 2012. Constructing popular routes from uncertain trajectories. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining . 195--203.Google ScholarDigital Library
- Ronald J Williams and David Zipser. 1989. A learning algorithm for continually running fully recurrent neural networks. Neural computation , Vol. 1, 2 (1989), 270--280.Google Scholar
- Sam Wiseman and Alexander M Rush. 2016. Sequence-to-Sequence Learning as Beam-Search Optimization. In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing . 1296--1306.Google ScholarCross Ref
- Hao Wu, Ziyang Chen, Weiwei Sun, Baihua Zheng, and Wei Wang. 2017. Modeling trajectories with recurrent neural networks. IJCAI.Google Scholar
- Hao Wu, Jiangyun Mao, Weiwei Sun, Baihua Zheng, Hanyuan Zhang, Ziyang Chen, and Wei Wang. 2016. Probabilistic robust route recovery with spatio-temporal dynamics. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1915--1924.Google ScholarDigital Library
- Huanyu Zheng, Shengyao Wang, Ying Cha, Feng Guo, Jinghua Hao, Renqing He, and Zhizhao Sun. 2019. A Two-Stage Fast Heuristic for Food Delivery Route Planning Problem. (2019).Google Scholar
Index Terms
- A Deep Learning Method for Route and Time Prediction in Food Delivery Service
Recommendations
Machine Learning based Batching Prediction System for Food Delivery
CODS-COMAD '21: Proceedings of the 3rd ACM India Joint International Conference on Data Science & Management of Data (8th ACM IKDD CODS & 26th COMAD)Delivery time estimates are an important factor for online food delivery platforms. These platforms also depend on batching - delivering two orders together - to increase efficiency and reduce cost. In this paper we propose a novel system for enhanced ...
Contents Delivery Method Using Route Prediction in Traffic Offloading by V2X
INCOS '15: Proceedings of the 2015 International Conference on Intelligent Networking and Collaborative SystemsCurrently, there are ongoing research and development efforts directed to data offloading. Data offloading allows load distribution by suitably allocating data communication traffic to other systems, such as wireless LANs or vehicle-to-vehicle ...
Food Delivery Service and Restaurant: Friend or Foe?
With food delivery services, customers can hire delivery workers to pick up food on their behalf. To investigate the long-term impact of food delivery services on the restaurant industry, we model a restaurant serving food to customers as a stylized ...
Comments