{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T07:23:57Z","timestamp":1778570637631,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467068","type":"proceedings-article","created":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T18:21:39Z","timestamp":1628878899000},"page":"2879-2889","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["A Deep Learning Method for Route and Time Prediction in Food Delivery Service"],"prefix":"10.1145","author":[{"given":"Chengliang","family":"Gao","sequence":"first","affiliation":[{"name":"Meituan, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Meituan, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanqun","family":"Wu","sequence":"additional","affiliation":[{"name":"Meituan, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiwan","family":"Hu","sequence":"additional","affiliation":[{"name":"Meituan, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Ru","sequence":"additional","affiliation":[{"name":"Meituan, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinghua","family":"Hao","sequence":"additional","affiliation":[{"name":"Meituan, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renqing","family":"He","sequence":"additional","affiliation":[{"name":"Meituan, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhizhao","family":"Sun","sequence":"additional","affiliation":[{"name":"Meituan, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI.2016.7849919"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403376"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767890"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403353"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/239"},{"key":"e_1_3_2_2_7_1","volume-title":"Long short-term memory. Neural computation","author":"Hochreiter Sepp","year":"1997","unstructured":"Sepp Hochreiter and J\u00fcrgen Schmidhuber . 1997. Long short-term memory. Neural computation , Vol. 9 , 8 ( 1997 ), 1735--1780. Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural computation , Vol. 9, 8 (1997), 1735--1780."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403294"},{"key":"e_1_3_2_2_9_1","volume-title":"et almbox","author":"Jindal Ishan","year":"2017","unstructured":"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). 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)."},{"key":"e_1_3_2_2_10_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba . 2014 . Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465287"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1166"},{"key":"e_1_3_2_2_13_1","volume-title":"Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research","author":"Srivastava Nitish","year":"2014","unstructured":"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. 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."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293318"},{"key":"e_1_3_2_2_15_1","volume-title":"An Effective Iterated Greedy Algorithm for Online Route Planning Problem. In 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, 1--8.","author":"Wang Xing","year":"2020","unstructured":"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. 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."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623656"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219900"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339562"},{"key":"e_1_3_2_2_19_1","volume-title":"A learning algorithm for continually running fully recurrent neural networks. Neural computation","author":"Williams Ronald J","year":"1989","unstructured":"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. 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."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1137"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Hao Wu Ziyang Chen Weiwei Sun Baihua Zheng and Wei Wang. 2017. Modeling trajectories with recurrent neural networks. IJCAI.  Hao Wu Ziyang Chen Weiwei Sun Baihua Zheng and Wei Wang. 2017. Modeling trajectories with recurrent neural networks. IJCAI.","DOI":"10.24963\/ijcai.2017\/430"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939843"},{"key":"e_1_3_2_2_23_1","unstructured":"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).  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)."}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467068","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:11Z","timestamp":1750195511000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":23,"alternative-id":["10.1145\/3447548.3467068","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467068","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}