{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T09:29:24Z","timestamp":1781774964148,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Science and Technology Innovation 2030 - Major Project","award":["2021ZD0114202"],"award-info":[{"award-number":["2021ZD0114202"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272098"],"award-info":[{"award-number":["62272098"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599915","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:13:58Z","timestamp":1691172838000},"page":"4078-4088","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Towards Equitable Assignment: Data-Driven Delivery Zone Partition at Last-mile Logistics"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7435-8238","authenticated-orcid":false,"given":"Baoshen","family":"Guo","sequence":"first","affiliation":[{"name":"Southeast University & JD Logistics, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6838-1151","authenticated-orcid":false,"given":"Shuai","family":"Wang","sequence":"additional","affiliation":[{"name":"Southeast University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9783-6389","authenticated-orcid":false,"given":"Haotian","family":"Wang","sequence":"additional","affiliation":[{"name":"JD Logistics, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1180-8078","authenticated-orcid":false,"given":"Yunhuai","family":"Liu","sequence":"additional","affiliation":[{"name":"Peking University & JD Logistics, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8020-1358","authenticated-orcid":false,"given":"Fanshuo","family":"Kong","sequence":"additional","affiliation":[{"name":"JD Logistics, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9307-8736","authenticated-orcid":false,"given":"Desheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Rutgers University, Piscataway, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6062-2619","authenticated-orcid":false,"given":"Tian","family":"He","sequence":"additional","affiliation":[{"name":"JD Logistics, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2022. Polsby-Popper test. https:\/\/en.wikipedia.org\/wiki\/Polsby-Popper_test.  2022. Polsby-Popper test. https:\/\/en.wikipedia.org\/wiki\/Polsby-Popper_test."},{"key":"e_1_3_2_2_2_1","unstructured":"2022. Well-known text representation of geometry. https:\/\/en.wikipedia.org\/ wiki\/Well-known_text_representation_of_geometry.  2022. Well-known text representation of geometry. https:\/\/en.wikipedia.org\/ wiki\/Well-known_text_representation_of_geometry."},{"key":"e_1_3_2_2_3_1","volume-title":"Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263","author":"van den Berg Rianne","year":"2017","unstructured":"Rianne van den Berg , Thomas N Kipf , and Max Welling . 2017. Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263 ( 2017 ). Rianne van den Berg, Thomas N Kipf, and Max Welling. 2017. Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263 (2017)."},{"key":"e_1_3_2_2_4_1","first-page":"0","article-title":"Constrained k-means clustering","volume":"20","author":"Bradley Paul S","year":"2000","unstructured":"Paul S Bradley , Kristin P Bennett , and Ayhan Demiriz . 2000 . Constrained k-means clustering . Microsoft Research, Redmond , Vol. 20 , 0 (2000), 0 . Paul S Bradley, Kristin P Bennett, and Ayhan Demiriz. 2000. Constrained k-means clustering. Microsoft Research, Redmond, Vol. 20, 0 (2000), 0.","journal-title":"Microsoft Research, Redmond"},{"key":"e_1_3_2_2_5_1","volume-title":"Random forests. Machine learning","author":"Breiman Leo","year":"2001","unstructured":"Leo Breiman . 2001. Random forests. Machine learning , Vol. 45 ( 2001 ), 5--32. Leo Breiman. 2001. Random forests. Machine learning, Vol. 45 (2001), 5--32."},{"key":"e_1_3_2_2_6_1","unstructured":"Cainiao. 2022. Cainiao. hrefhttps:\/\/global.cainiao.com\/https:\/\/global.cainiao.com\/.  Cainiao. 2022. Cainiao. hrefhttps:\/\/global.cainiao.com\/https:\/\/global.cainiao.com\/."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_2_2_8_1","volume-title":"Adjunct Proceedings of the 2022 ACM International Joint Conference on Pervasive and Ubiquitous Computing and the 2022 ACM International Symposium on","author":"Chen Xuecheng","unstructured":"Xuecheng Chen , Haoyang Wang , Zuxin Li , Wenbo Ding , Fan Dang , Chengye Wu , and Xinlei Chen . 2023. DeliverSense: Efficient Delivery Drone Scheduling for Crowdsensing with Deep Reinforcement Learning . In Adjunct Proceedings of the 2022 ACM International Joint Conference on Pervasive and Ubiquitous Computing and the 2022 ACM International Symposium on Wearable Computers (Cambridge, United Kingdom ) (UbiComp\/ISWC '22 Adjunct). Association for Computing Machinery , New York, NY, USA, 403--408. https:\/\/doi.org\/10.1145\/3544793.3560412 10.1145\/3544793.3560412 Xuecheng Chen, Haoyang Wang, Zuxin Li, Wenbo Ding, Fan Dang, Chengye Wu, and Xinlei Chen. 2023. DeliverSense: Efficient Delivery Drone Scheduling for Crowdsensing with Deep Reinforcement Learning. In Adjunct Proceedings of the 2022 ACM International Joint Conference on Pervasive and Ubiquitous Computing and the 2022 ACM International Symposium on Wearable Computers (Cambridge, United Kingdom) (UbiComp\/ISWC '22 Adjunct). Association for Computing Machinery, New York, NY, USA, 403--408. https:\/\/doi.org\/10.1145\/3544793.3560412"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2968375"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3474717.3483919"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403353"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3172077.3172127"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539024"},{"key":"e_1_3_2_2_14_1","unstructured":"JD Logistics. 2022. JD Logistics. hrefhttps:\/\/www.jdl.com\/https:\/\/www.jdl.com\/.  JD Logistics. 2022. JD Logistics. hrefhttps:\/\/www.jdl.com\/https:\/\/www.jdl.com\/."},{"key":"e_1_3_2_2_15_1","volume-title":"Alleviating Users' Pain of Waiting: Effective Task Grouping for Online-to-Offline Food Delivery Services. In The World Wide Web Conference","author":"Ji Shenggong","year":"2019","unstructured":"Shenggong Ji , Yu Zheng , Zhaoyuan Wang , and Tianrui Li . 2019 . Alleviating Users' Pain of Waiting: Effective Task Grouping for Online-to-Offline Food Delivery Services. In The World Wide Web Conference ( San Francisco, CA, USA) (WWW '19). Association for Computing Machinery, New York, NY, USA, 773--783. https:\/\/doi.org\/10.1145\/3308558.3313464 10.1145\/3308558.3313464 Shenggong Ji, Yu Zheng, Zhaoyuan Wang, and Tianrui Li. 2019. Alleviating Users' Pain of Waiting: Effective Task Grouping for Online-to-Offline Food Delivery Services. In The World Wide Web Conference (San Francisco, CA, USA) (WWW '19). Association for Computing Machinery, New York, NY, USA, 773--783. https:\/\/doi.org\/10.1145\/3308558.3313464"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.140"},{"key":"e_1_3_2_2_17_1","volume-title":"Variational graph auto-encoders. arXiv preprint arXiv:1611.07308","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 ( 2016 ). Thomas N Kipf and Max Welling. 2016. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)."},{"key":"e_1_3_2_2_18_1","volume-title":"Deep learning. nature","author":"LeCun Yann","year":"2015","unstructured":"Yann LeCun , Yoshua Bengio , and Geoffrey Hinton . 2015. Deep learning. nature , Vol. 521 , 7553 ( 2015 ), 436--444. Yann LeCun, Yoshua Bengio, and Geoffrey Hinton. 2015. Deep learning. nature, Vol. 521, 7553 (2015), 436--444."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330968"},{"key":"e_1_3_2_2_20_1","first-page":"301","article-title":"The third criterion: Compactness as a procedural safeguard against partisan gerrymandering","volume":"9","author":"Polsby Daniel D","year":"1991","unstructured":"Daniel D Polsby and Robert D Popper . 1991 . The third criterion: Compactness as a procedural safeguard against partisan gerrymandering . Yale L. & Pol'y Rev. , Vol. 9 (1991), 301 . Daniel D Polsby and Robert D Popper. 1991. The third criterion: Compactness as a procedural safeguard against partisan gerrymandering. Yale L. & Pol'y Rev., Vol. 9 (1991), 301.","journal-title":"Yale L. & Pol'y Rev."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539027"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403332"},{"key":"e_1_3_2_2_23_1","unstructured":"sf-express. 2022. sf-express. hrefhttps:\/\/www.sf-express.com\/chn\/schttps:\/\/www.sf-express.com.  sf-express. 2022. sf-express. hrefhttps:\/\/www.sf-express.com\/chn\/schttps:\/\/www.sf-express.com."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00214"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301774"},{"key":"e_1_3_2_2_26_1","volume-title":"An end-to-end predict-then-optimize clustering method for intelligent assignment problems in express systems. arXiv preprint arXiv:2202.10937","author":"Zhang Jinlei","year":"2022","unstructured":"Jinlei Zhang , Ergang Shan , Lixia Wu , Lixing Yang , Ziyou Gao , and Haoyuan Hu. 2022. An end-to-end predict-then-optimize clustering method for intelligent assignment problems in express systems. arXiv preprint arXiv:2202.10937 ( 2022 ). Jinlei Zhang, Ergang Shan, Lixia Wu, Lixing Yang, Ziyou Gao, and Haoyuan Hu. 2022. An end-to-end predict-then-optimize clustering method for intelligent assignment problems in express systems. arXiv preprint arXiv:2202.10937 (2022)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2604806"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403307"}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA","acronym":"KDD '23","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 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599915","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:41Z","timestamp":1750178261000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599915"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":28,"alternative-id":["10.1145\/3580305.3599915","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599915","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}