{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:51:24Z","timestamp":1742961084065,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030693763"},{"type":"electronic","value":"9783030693770"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-69377-0_14","type":"book-chapter","created":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T04:59:40Z","timestamp":1612933180000},"page":"166-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Experimental Study on Exact Multi-constraint Shortest Path Finding"],"prefix":"10.1007","author":[{"given":"Xuanyi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2468-3104","authenticated-orcid":false,"given":"Ziyi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8155-4942","authenticated-orcid":false,"given":"Mengxuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1386-767X","authenticated-orcid":false,"given":"Lei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,10]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Li, L., Hua, W., Du, X., Zhou, X.: Minimal on-road time route scheduling on time-dependent graphs. PVLDB 10(11), 1274\u20131285 (2017)","DOI":"10.14778\/3137628.3137638"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Li, L., Zheng, K., Wang, S., Hua, W., Zhou, X.: Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory. VLDB J. 27(3), 321\u2013345 (2018)","DOI":"10.1007\/s00778-018-0499-4"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: SIGMOD, pp. 467\u201347 (2003)","DOI":"10.1145\/872757.872814"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Renz, M., Schubert, M.: Route skyline queries: a multi-preference path planning approach. In: ICDE 2010, pp. 261\u2013272. IEEE (2010)","DOI":"10.1109\/ICDE.2010.5447845"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Gong, Q., Cao, H., Nagarkar, P.: Skyline queries constrained by multi-cost transportation networks. In: ICDE, pp. 926\u2013937. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00087"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-319-91452-7_16","volume-title":"Database Systems for Advanced Applications","author":"D Ouyang","year":"2018","unstructured":"Ouyang, D., Yuan, L., Zhang, F., Qin, L., Lin, X.: Towards efficient path skyline computation in bicriteria networks. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds.) DASFAA 2018. LNCS, vol. 10827, pp. 239\u2013254. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91452-7_16"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Hansen, P.: Bicriterion path problems. In: Multiple Criteria Decision Making Theory and Application, pp. 109\u2013127. Springer (1980). https:\/\/doi.org\/10.1007\/978-3-642-48782-8_9","DOI":"10.1007\/978-3-642-48782-8_9"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Gao, J., Qiu, H., Jiang, X., Wang, T., Yang, D.: Fast top-k simple shortest paths discovery in graphs. In: CIKM, pp. 509\u2013518 (2010)","DOI":"10.1145\/1871437.1871504"},{"key":"14_CR9","unstructured":"Sede\u00f1o-Noda, A., Alonso-Rodr\u00edguez, S.: An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem. Appl. Math. Comput. 265, 602-618 (2015)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Kunath, P., Renz, M., Schmidt, T.: Proximity queries in large traffic networks. In: ACM GIS, pp. 1\u20138 (2007)","DOI":"10.1145\/1341012.1341040"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0022-247X(66)90020-5","volume":"14","author":"HC Joksch","year":"1966","unstructured":"Joksch, H.C.: The shortest route problem with constraints. J. Math. Anal. Appl. 14(2), 191\u2013197 (1966)","journal-title":"J. Math. Anal. Appl."},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"GY Handler","year":"1980","unstructured":"Handler, G.Y., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks 10(4), 293\u2013309 (1980)","journal-title":"Networks"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.cor.2012.07.008","volume":"40","author":"L Lozano","year":"2013","unstructured":"Lozano, L., Medaglia, A.L.: On an exact method for the constrained shortest path problem. Comput. Oper. Res. 40(1), 378\u2013384 (2013)","journal-title":"Comput. Oper. Res."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Zhou, X.: Efficient 2-hop labeling maintenance in dynamic small-world networks. In: ICDE. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00019"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Li, L., Wang, S., Zhou, X.: Fastest path query answering using time-dependent hop-labeling in road network. In: TKDE (2020)","DOI":"10.1109\/TKDE.2020.2981062"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Li, L., Zhang, M., Hua, W., Zhou, X.: Fast query decomposition for batch shortest path processing in road networks. In: ICDE (2020)","DOI":"10.1109\/ICDE48307.2020.00107"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Zhou, X.: Stream processing of shortest path query in dynamic road networks. In: TKDE (2020)","DOI":"10.1109\/TKDE.2020.3010005"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319\u2013333. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68552-4_24"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Storandt, S.: Route planning for bicycles\u2013exact constrained shortest paths made practical via contraction hierarchy. In: ICAPS (2012)","DOI":"10.1609\/icaps.v22i1.13495"},{"issue":"5","key":"14_CR20","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"DH Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28(5), 213\u2013219 (2001)","journal-title":"Oper. Res. Lett."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Juttner, A., Szviatovski, B., M\u00e9cs, I., Rajk\u00f3, Z.: Lagrange relaxation based method for the QoS routing problem. In: INFOCOM, vol. 2, pp. 859\u2013868. IEEE (2001)","DOI":"10.1109\/INFCOM.2001.916277"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/11753810_17","volume-title":"NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems","author":"F Kuipers","year":"2006","unstructured":"Kuipers, F., Orda, A., Raz, D., Van Mieghem, P.: A comparison of exact and $$\\varepsilon $$ -approximation algorithms for constrained routing. In: Boavida, F., Plagemann, T., Stiller, B., Westphal, C., Monteiro, E. (eds.) NETWORKING 2006. LNCS, vol. 3976, pp. 197\u2013208. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11753810_17"},{"issue":"1","key":"14_CR23","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s00224-007-9096-4","volume":"45","author":"G Tsaggouris","year":"2009","unstructured":"Tsaggouris, G., Zaroliagis, C.: Multiobjective optimization: improved FPTAS for shortest paths and non-linear objectives with applications. Theory Comput. Syst. 45(1), 162\u2013186 (2009). https:\/\/doi.org\/10.1007\/s00224-007-9096-4","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"14_CR24","first-page":"61","volume":"10","author":"S Wang","year":"2016","unstructured":"Wang, S., Xiao, X., Yang, Y., Lin, W.: Effective indexing for approximate constrained shortest path queries on large road networks. PVLDB 10(2), 61\u201372 (2016)","journal-title":"PVLDB"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Li, L., Wang, S., Zhou, X.: Time-dependent hop labeling on road network. In: ICDE, pp. 902\u2013913, April 2019","DOI":"10.1109\/ICDE.2019.00085"},{"issue":"2","key":"14_CR26","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","volume":"189","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.-G.: Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189(2), 293\u2013309 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tre.2017.02.002","volume":"101","author":"N Shi","year":"2017","unstructured":"Shi, N., Zhou, S., Wang, F., Tao, Y., Liu, L.: The multi-criteria constrained shortest path problem. Transp. Res. Part E: Logist. Transp. Rev. 101, 13\u201329 (2017)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"14_CR28","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tre.2013.12.012","volume":"65","author":"K Braekers","year":"2014","unstructured":"Braekers, K., Caris, A., Janssens, G.K.: Bi-objective optimization of drayage operations in the service area of intermodal terminals. Transp. Res. Part E: Logist. Transp. Rev. 65, 50\u201369 (2014)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"1","key":"14_CR29","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10288-005-0074-x","volume":"4","author":"X Gandibleux","year":"2006","unstructured":"Gandibleux, X., Beugnies, F., Randriamasy, S.: Martins\u2019 algorithm revisited for multi-objective shortest path problems with a maxmin cost function. 4OR 4(1), 47\u201359 (2006). https:\/\/doi.org\/10.1007\/s10288-005-0074-x","journal-title":"4OR"},{"issue":"3","key":"14_CR30","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1023\/A:1012602011914","volume":"111","author":"F Guerriero","year":"2001","unstructured":"Guerriero, F., Musmanno, R.: Label correcting methods to solve multicriteria shortest path problems. J. Optim. Theory Appl. 111(3), 589\u2013613 (2001)","journal-title":"J. Optim. Theory Appl."},{"issue":"6","key":"14_CR31","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/S0305-0548(99)00037-4","volume":"27","author":"AJ Skriver","year":"2000","unstructured":"Skriver, A.J., Andersen, K.A.: A label correcting approach for solving bicriterion shortest-path problems. Comput. Oper. Res. 27(6), 507\u2013524 (2000)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"14_CR32","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Manage. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manage. Sci."},{"issue":"1","key":"14_CR33","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0196-6774(03)00076-2","volume":"49","author":"U Meyer","year":"2003","unstructured":"Meyer, U., Sanders, P.: $$\\delta $$-stepping: a parallelizable shortest path algorithm. J. Algorithms 49(1), 114\u2013152 (2003)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69377-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T23:27:34Z","timestamp":1724455654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69377-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030693763","9783030693770"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69377-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dunedin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc2021.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","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":"16","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":"76% - 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":"2","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)"}}]}}