{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:28:26Z","timestamp":1777868906722,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272302"],"award-info":[{"award-number":["62272302"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U23A20309"],"award-info":[{"award-number":["U23A20309"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372296"],"award-info":[{"award-number":["62372296"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["202404"],"award-info":[{"award-number":["202404"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004921","name":"Shanghai Jiao Tong University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004921","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2024YFF0617700"],"award-info":[{"award-number":["2024YFF0617700"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1016\/j.tcs.2025.115428","type":"journal-article","created":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T13:48:17Z","timestamp":1752587297000},"page":"115428","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Algorithms for Shortest Path Tour Problem"],"prefix":"10.1016","volume":"1054","author":[{"given":"Yucen","family":"Gao","sequence":"first","affiliation":[]},{"given":"Zhuoran","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jingyu","family":"He","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Hui","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2025.115428_br0010","series-title":"International ACM SIGIR Conference on Research & Development in Information Retrieval (SIGIR)","first-page":"1041","article-title":"Taxi or hitchhiking: predicting passenger's preferred service on ride sharing platforms","author":"Zhang","year":"2018"},{"issue":"9","key":"10.1016\/j.tcs.2025.115428_br0020","doi-asserted-by":"crossref","first-page":"3513","DOI":"10.1109\/TITS.2018.2876570","article-title":"Multimodal route planning with public transport and carpooling","volume":"20","author":"Huang","year":"2019","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"1","key":"10.1016\/j.tcs.2025.115428_br0030","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1186\/s13634-023-01082-3","article-title":"Efficient and privacy-preserving multi-agent systems for smart city carpooling with k-regret queries and differential privacy","volume":"2023","author":"Chen","year":"2023","journal-title":"EURASIP J. Adv. Signal Process."},{"issue":"13","key":"10.1016\/j.tcs.2025.115428_br0040","doi-asserted-by":"crossref","first-page":"3517","DOI":"10.14778\/3424573.3424574","article-title":"The simpler the better: an indexing approach for shared-route planning queries","volume":"13","author":"Zeng","year":"2020","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.tcs.2025.115428_br0050","doi-asserted-by":"crossref","unstructured":"Y. Gao, L. Ma, Z. Yu, S. Zhang, J. Fang, X. Gao, G. Chen, Lightweight GCN encoder and sequential decoder for multi-candidate carpooling route planning in road network, in: ACM on Web Conference (WWW), pp. 302\u2013310.","DOI":"10.1145\/3589335.3648328"},{"key":"10.1016\/j.tcs.2025.115428_br0060","doi-asserted-by":"crossref","first-page":"225945","DOI":"10.1109\/ACCESS.2020.3045027","article-title":"Coverage path planning for decomposition reconfigurable grid-maps using deep reinforcement learning based travelling salesman problem","volume":"8","author":"Kyaw","year":"2020","journal-title":"IEEE Access"},{"issue":"4","key":"10.1016\/j.tcs.2025.115428_br0070","first-page":"393","article-title":"Solution of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Oper. Res."},{"key":"10.1016\/j.tcs.2025.115428_br0080","series-title":"International Computing and Combinatorics Conference (COCOON), vol. 14423","first-page":"340","article-title":"Algorithms for shortest path tour problem in large-scale road network","author":"Gao","year":"2023"},{"issue":"1","key":"10.1016\/j.tcs.2025.115428_br0090","first-page":"287","article-title":"Some constrained shortest-route problems","volume":"15","author":"Bajaj","year":"1971","journal-title":"Unternehmensforschung"},{"issue":"1","key":"10.1016\/j.tcs.2025.115428_br0100","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s11590-010-0258-y","article-title":"Complexity analysis and optimization of the shortest path tour problem","volume":"6","author":"Festa","year":"2012","journal-title":"Optim. Lett."},{"key":"10.1016\/j.tcs.2025.115428_br0110","series-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"2463","article-title":"Incremental single source shortest paths in sparse digraphs","author":"Chechik","year":"2021"},{"key":"10.1016\/j.tcs.2025.115428_br0120","series-title":"IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","first-page":"3519","article-title":"Optimal solving of constrained path-planning problems with graph convolutional networks and optimized tree search","author":"Osanlou","year":"2019"},{"key":"10.1016\/j.tcs.2025.115428_br0130","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1109\/TRO.2024.3522187","article-title":"FAPP: fast and adaptive perception and planning for uavs in dynamic cluttered environments","volume":"41","author":"Lu","year":"2025","journal-title":"IEEE Trans. Robot."},{"issue":"3","key":"10.1016\/j.tcs.2025.115428_br0140","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.ejor.2013.04.029","article-title":"Solving the shortest path tour problem","volume":"230","author":"Festa","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.tcs.2025.115428_br0150","series-title":"International Conference on Computer Communication and Networks (ICCCN)","first-page":"1","article-title":"Service-concatenation routing with applications to network functions virtualization","author":"Bhat","year":"2017"},{"key":"10.1016\/j.tcs.2025.115428_br0160","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.engappai.2014.01.001","article-title":"Modeling of route planning system based on Q value-based dynamic programming with multi-agent reinforcement learning algorithms","volume":"29","author":"Arokhlo","year":"2014","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.tcs.2025.115428_br0170","series-title":"Smart Cities & Information and Communication Technology (CTTE-FITCE)","first-page":"1","article-title":"Using the viterbi decoding trellis graph approach to find the most effective investment path","author":"Prokopiak","year":"2019"},{"key":"10.1016\/j.tcs.2025.115428_br0180","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"issue":"2","key":"10.1016\/j.tcs.2025.115428_br0190","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TIT.1967.1054010","article-title":"Error bounds for convolutional codes and an asymptotically optimum decoding algorithm","volume":"13","author":"Viterbi","year":"1967","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525003664?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525003664?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T12:51:26Z","timestamp":1777553486000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397525003664"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":19,"alternative-id":["S0304397525003664"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115428","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Algorithms for Shortest Path Tour Problem","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115428","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115428"}}