{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T23:02:05Z","timestamp":1768690925703,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"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":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403353","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:03:59Z","timestamp":1597964639000},"page":"3026-3034","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Delivery Scope"],"prefix":"10.1145","author":[{"given":"Xuetao","family":"Ding","sequence":"first","affiliation":[{"name":"Meituan-Dianping Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Runfeng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Meituan-Dianping Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Mao","sequence":"additional","affiliation":[{"name":"Meituan-Dianping Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Xing","sequence":"additional","affiliation":[{"name":"Meituan-Dianping Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangxiao","family":"Du","sequence":"additional","affiliation":[{"name":"Meituan-Dianping Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingyu","family":"Liu","sequence":"additional","affiliation":[{"name":"Meituan-Dianping Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoxing","family":"Wei","sequence":"additional","affiliation":[{"name":"Meituan-Dianping Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifan","family":"Yin","sequence":"additional","affiliation":[{"name":"Meituan-Dianping Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renqing","family":"He","sequence":"additional","affiliation":[{"name":"Meituan-Dianping Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhizhao","family":"Sun","sequence":"additional","affiliation":[{"name":"Meituan-Dianping Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424348"},{"key":"e_1_3_2_2_2_1","volume-title":"Convex optimization","author":"Boyd Stephen","unstructured":"Stephen Boyd and Lieven Vandenberghe . 2004. Convex optimization . Cambridge university press . Stephen Boyd and Lieven Vandenberghe. 2004. Convex optimization. Cambridge university press."},{"key":"e_1_3_2_2_3_1","unstructured":"Stephen P Bradley Arnoldo C Hax and Thomas L Magnanti. 1977. Applied mathematical programming. (1977).  Stephen P Bradley Arnoldo C Hax and Thomas L Magnanti. 1977. Applied mathematical programming. (1977)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_2_2_5_1","volume-title":"Branch and bound algorithms-principles and examples. Department of Computer Science","author":"Clausen Jens","unstructured":"Jens Clausen . 1999. Branch and bound algorithms-principles and examples. Department of Computer Science , University of Copenhagen (1999) , 1--30. Jens Clausen. 1999. Branch and bound algorithms-principles and examples. Department of Computer Science, University of Copenhagen (1999), 1--30."},{"key":"e_1_3_2_2_6_1","volume-title":"Efficient generation of simple polygons for characterizing the shape of a set of points in the plane. Pattern recognition","author":"Duckham Matt","year":"2008","unstructured":"Matt Duckham , Lars Kulik , Mike Worboys , and Antony Galton . 2008. Efficient generation of simple polygons for characterizing the shape of a set of points in the plane. Pattern recognition , Vol. 41 , 10 ( 2008 ), 3224--3236. Matt Duckham, Lars Kulik, Mike Worboys, and Antony Galton. 2008. Efficient generation of simple polygons for characterizing the shape of a set of points in the plane. Pattern recognition, Vol. 41, 10 (2008), 3224--3236."},{"key":"e_1_3_2_2_7_1","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"Ester Martin","year":"1996","unstructured":"Martin Ester , Hans-Peter Kriegel , J\u00f6rg Sander , Xiaowei Xu , 1996 . A density-based algorithm for discovering clusters in large spatial databases with noise .. In Kdd , Vol. 96. 226 -- 231 . Martin Ester, Hans-Peter Kriegel, J\u00f6rg Sander, Xiaowei Xu, et almbox. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise.. In Kdd, Vol. 96. 226--231.","journal-title":"Kdd"},{"key":"e_1_3_2_2_8_1","unstructured":"Ying Cha Feng Guo Jinghua Hao Renqing He and Zhizhao Sun Huanyu Zheng Shengyao Wang. 2019. A Two-Stage Fast Heuristic for Food Delivery RoutePlanning Problem.  Ying Cha Feng Guo Jinghua Hao Renqing He and Zhizhao Sun Huanyu Zheng Shengyao Wang. 2019. A Two-Stage Fast Heuristic for Food Delivery RoutePlanning Problem."},{"key":"e_1_3_2_2_9_1","volume-title":"Optimization by simulated annealing. science","author":"Kirkpatrick Scott","year":"1983","unstructured":"Scott Kirkpatrick , C Daniel Gelatt , and Mario P Vecchi . 1983. Optimization by simulated annealing. science , Vol. 220 , 4598 ( 1983 ), 671--680. Scott Kirkpatrick, C Daniel Gelatt, and Mario P Vecchi. 1983. Optimization by simulated annealing. science, Vol. 220, 4598 (1983), 671--680."},{"key":"e_1_3_2_2_10_1","volume-title":"Integer programming with a fixed number of variables. Mathematics of operations research","author":"Lenstra Hendrik W","year":"1983","unstructured":"Hendrik W Lenstra Jr . 1983. Integer programming with a fixed number of variables. Mathematics of operations research , Vol. 8 , 4 ( 1983 ), 538--548. Hendrik W Lenstra Jr. 1983. Integer programming with a fixed number of variables. Mathematics of operations research, Vol. 8, 4 (1983), 538--548."},{"key":"e_1_3_2_2_11_1","volume-title":"Matthew Wiener, et almbox","author":"Liaw Andy","year":"2002","unstructured":"Andy Liaw , Matthew Wiener, et almbox . 2002 . Classification and regression by randomForest. R news, Vol. 2 , 3 (2002), 18--22. Andy Liaw, Matthew Wiener, et almbox. 2002. Classification and regression by randomForest. R news, Vol. 2, 3 (2002), 18--22."},{"key":"e_1_3_2_2_12_1","volume-title":"How To Find Your Most Valuable Service Outlets: Measuring Influence Using Network Analysis. Available at SSRN 3366127","author":"Mankad Shawn","year":"2019","unstructured":"Shawn Mankad , Masha Shunko , and Qiuping Yu. 2019. How To Find Your Most Valuable Service Outlets: Measuring Influence Using Network Analysis. Available at SSRN 3366127 ( 2019 ). Shawn Mankad, Masha Shunko, and Qiuping Yu. 2019. How To Find Your Most Valuable Service Outlets: Measuring Influence Using Network Analysis. Available at SSRN 3366127 (2019)."},{"key":"e_1_3_2_2_13_1","volume-title":"Artificial intelligence: a modern approach. Malaysia","author":"Russell Stuart J","unstructured":"Stuart J Russell and Peter Norvig . 2016. Artificial intelligence: a modern approach. Malaysia ; Pearson Education Limited ,. Stuart J Russell and Peter Norvig. 2016. Artificial intelligence: a modern approach. Malaysia; Pearson Education Limited,."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2666310.2666399"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SIBGRA.2003.1240992"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983711"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2019.01.021"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.9986"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313609"}],"event":{"name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event CA USA","acronym":"KDD '20","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 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403353","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:29Z","timestamp":1750195889000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403353"}},"subtitle":["A New Way of Restaurant Retrieval for On-demand Food Delivery Service"],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":19,"alternative-id":["10.1145\/3394486.3403353","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403353","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}