{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T20:51:11Z","timestamp":1754599871435,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49193-1_26","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"340-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for\u00a0Shortest Path Tour Problem in\u00a0Large-Scale Road Network"],"prefix":"10.1007","author":[{"given":"Yucen","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingqian","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiale","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songjian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Zhang, W.A., Yuan, C., Zhang, Y., Ye, J.: Taxi or hitchhiking: predicting passenger\u2019s preferred service on ride sharing platforms. In: ACM SIGIR Conference on Research & Development in Information Retrieval (SIGIR), pp. 1041\u20131044 (2018)","DOI":"10.1145\/3209978.3210153"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Zeng, Y., Tong, Y., Song, Y., Chen,L.: The simpler the better: An indexing approach for shared-route planning queries. In: Proceedings of the VLDB Endowment, vol. 13, pp. 3517\u20133530 (2020)","DOI":"10.14778\/3424573.3424574"},{"issue":"4","key":"26_CR3","first-page":"393","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G.B., Ray Fulkerson, D., Johnson, S.M.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2(4), 393\u2013410 (1954)","journal-title":"Oper. Res."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Bajajm, C.P.: Some constrained shortest-route problems. In: Unternehmensforschung, vol. 15(1), pp. 287\u2013301 (1971)","DOI":"10.1007\/BF01939836"},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s11590-010-0258-y","volume":"6","author":"P Festa","year":"2012","unstructured":"Festa, P.: Complexity analysis and optimization of the shortest path tour problem. Optimiz. Lett. 6(1), 163\u2013175 (2012)","journal-title":"Optimiz. Lett."},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Osanlou, K., Bursuc, A., Guettier, C., Cazenave, T., Jacopin, E.: Optimal solving of constrained path-planning problems with graph convolutional networks and optimized tree search. In: International Conference on Intelligent Robots and Systems (IROS), pp. 3519\u20133525 (2019)","DOI":"10.1109\/IROS40897.2019.8968113"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.ejor.2013.04.029","volume":"230","author":"P Festa","year":"2013","unstructured":"Festa, P., Guerriero, F., Lagan\u00e0, D., Musmanno, R.: Solving the shortest path tour problem. Euro. J. Oper. Res. 230(3), 464\u2013474 (2013)","journal-title":"Euro. J. Oper. Res."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Bhat, S., Rouskas, G.N.: Service-concatenation routing with applications to network functions virtualization. In: International Conference on Computer Communication and Networks (ICCCN), pp. 1\u20139 (2017)","DOI":"10.1109\/ICCCN.2017.8038463"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Prokopiak, R.: Using the Viterbi decoding trellis graph approach to find the most effective investment path. In: Smart Cities & Information and Communication Technology (CTTE-FITCE), pp. 1\u20136 (2019)","DOI":"10.1109\/CTTE-FITCE.2019.8894815"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Viterbi, A.J.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inform. Theory IT-13, 260\u2013269 (1967)","DOI":"10.1109\/TIT.1967.1054010"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49193-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:07:09Z","timestamp":1702026429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}