{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:51:08Z","timestamp":1783702268674,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Shanghai Municipal Science and Technology Major Project","doi-asserted-by":"publisher","award":["[2021SHZDZX0102]"],"award-info":[{"award-number":["[2021SHZDZX0102]"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CCF-DiDi GAIA","award":["[202307]"],"award-info":[{"award-number":["[202307]"]}]},{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["[U23A20309, 62272302, 62172276, 62372296]"],"award-info":[{"award-number":["[U23A20309, 62272302, 62172276, 62372296]"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589335.3648328","type":"proceedings-article","created":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T18:41:21Z","timestamp":1715539281000},"page":"302-310","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Lightweight GCN Encoder and Sequential Decoder for Multi-Candidate Carpooling Route Planning in Road Network"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7155-8250","authenticated-orcid":false,"given":"Yucen","family":"Gao","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5712-2143","authenticated-orcid":false,"given":"Li","family":"Ma","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5967-2532","authenticated-orcid":false,"given":"Zhemeng","family":"Yu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5196-5767","authenticated-orcid":false,"given":"Songjian","family":"Zhang","sequence":"additional","affiliation":[{"name":"Didi Global Inc., Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6083-1234","authenticated-orcid":false,"given":"Jun","family":"Fang","sequence":"additional","affiliation":[{"name":"Didi Global Inc., Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1776-8799","authenticated-orcid":false,"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6934-1685","authenticated-orcid":false,"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"287","article-title":"Some constrained shortest-route problems","volume":"15","author":"Bajaj C. P.","year":"1971","unstructured":"C. P. Bajaj. 1971. Some constrained shortest-route problems. Unternehmensforschung Operations Research 15, 1 (1971), 287--301.","journal-title":"Unternehmensforschung Operations Research"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482272"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2886843"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403356"},{"key":"e_1_3_2_2_6_1","volume-title":"AAAI Conference on Artificial Intelligence (AAAI). 7474--7482","author":"Fu Zhang-Hua","year":"2021","unstructured":"Zhang-Hua Fu, Kai-Bin Qiu, and Hongyuan Zha. 2021. Generalize a Small Pretrained Model to Arbitrarily Large TSP Instances. In AAAI Conference on Artificial Intelligence (AAAI). 7474--7482."},{"key":"e_1_3_2_2_7_1","volume-title":"Urban link travel speed dataset from a megacity road network. Scientific data 6, 1","author":"Guo Feng","year":"2019","unstructured":"Feng Guo, Dongqing Zhang, Yucheng Dong, and Zhaoxia Guo. 2019. Urban link travel speed dataset from a megacity road network. Scientific data 6, 1 (2019), 61."},{"key":"e_1_3_2_2_8_1","unstructured":"William L. Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive Representation Learning on Large Graphs. In Advances in Neural Information Processing Systems (NIPS). 1024--1034."},{"key":"e_1_3_2_2_9_1","unstructured":"William L. Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive Representation Learning on Large Graphs. In Advances in Neural Information Processing Systems (NeurIPS). 1024--1034."},{"key":"e_1_3_2_2_10_1","volume-title":"International Conference on Learning Representations (ICLR). 1--4.","author":"Kool Wouter","year":"2019","unstructured":"Wouter Kool, Herke van Hoof, and Max Welling. 2019. Attention, Learn to Solve Routing Problems!. In International Conference on Learning Representations (ICLR). 1--4."},{"key":"e_1_3_2_2_11_1","volume-title":"Finding Top-k Optimal Sequenced Routes. In IEEE International Conference on Data Engineering (ICDE). IEEE Computer Society, 569--580","author":"Liu Huiping","year":"2018","unstructured":"Huiping Liu, Cheqing Jin, Bin Yang, and Aoying Zhou. 2018. Finding Top-k Optimal Sequenced Routes. In IEEE International Conference on Data Engineering (ICDE). IEEE Computer Society, 569--580."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tra.2020.02.008"},{"key":"e_1_3_2_2_13_1","volume-title":"Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search","author":"Osanlou Kevin","unstructured":"Kevin Osanlou, Andrei Bursuc, Christophe Guettier, Tristan Cazenave, and Eric Jacopin. 2019. Optimal Solving of Constrained Path-Planning Problems with Graph Convolutional Networks and Optimized Tree Search. In IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS). 3519--3525."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0038-6"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2760880"},{"key":"e_1_3_2_2_16_1","unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N. Gomez Lukasz Kaiser and Illia Polosukhin. 2017. Attention is All you Need. In Advances in Neural Information Processing Systems (NeurIPS). 5998-- 6008."},{"key":"e_1_3_2_2_17_1","volume-title":"Graph Attention Networks. In International Conference on Learning Representations (ICLR).","author":"Velickovic Petar","year":"2018","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph Attention Networks. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_2_18_1","unstructured":"Oriol Vinyals Meire Fortunato and Navdeep Jaitly. 2015. Pointer Networks. In Advances in Neural Information Processing Systems (NIPS). 2692--2700."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565849"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539084"},{"key":"e_1_3_2_2_21_1","volume-title":"Efficient Navigation for Constrained Shortest Path with Adaptive Expansion Control. In IEEE International Conference on Data Mining (ICDM). 588--597","author":"Xia Wenwen","year":"2022","unstructured":"Wenwen Xia, Yuchen Li, Wentian Guo, and Shenghong Li. 2022. Efficient Navigation for Constrained Shortest Path with Adaptive Expansion Control. In IEEE International Conference on Data Mining (ICDM). 588--597."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3424573.3424574"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210153"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291014"},{"key":"e_1_3_2_2_25_1","volume-title":"Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem. In AAAI Conference on Artificial Intelligence (AAAI). 12445--12452","author":"Zheng Jiongzhi","year":"2021","unstructured":"Jiongzhi Zheng, Kun He, Jianrong Zhou, Yan Jin, and Chu-Min Li. 2021. Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem. In AAAI Conference on Artificial Intelligence (AAAI). 12445--12452."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539037"}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Companion Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589335.3648328","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589335.3648328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:37:06Z","timestamp":1755823026000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589335.3648328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":26,"alternative-id":["10.1145\/3589335.3648328","10.1145\/3589335"],"URL":"https:\/\/doi.org\/10.1145\/3589335.3648328","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}