{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:56:40Z","timestamp":1742993800270,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030625214"},{"type":"electronic","value":"9783030625221"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-62522-1_40","type":"book-chapter","created":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T00:04:23Z","timestamp":1603929863000},"page":"539-554","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Conceptual Framework for Dynamic Planning of Alternative Routes in Road Networks"],"prefix":"10.1007","author":[{"given":"Sven","family":"Hartmann","sequence":"first","affiliation":[]},{"given":"Jack","family":"Alshami","sequence":"additional","affiliation":[]},{"given":"Hui","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Dietrich","family":"Steinmetz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,29]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2444016.2444019","volume":"18","author":"I Abraham","year":"2013","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Alternative routes in road networks. J. Exp. Algorithmics 18, 1\u201317 (2013)","journal-title":"J. Exp. Algorithmics"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"2129","DOI":"10.1016\/j.artint.2011.07.003","volume":"175","author":"H Aljazzar","year":"2011","unstructured":"Aljazzar, H., Leue, S.: $$\\mathit{K^\\ast }$$: a heuristic search algorithm for finding the k shortest paths. Artif. Intell. 175, 2129\u20132154 (2011)","journal-title":"Artif. Intell."},{"key":"40_CR3","unstructured":"Arroyo, S., Kornhauser, A.L.: Modeling travel time distributions on a road network. TRB (2005)"},{"key":"40_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-49487-6_2","volume-title":"Algorithm Engineering","author":"H Bast","year":"2016","unstructured":"Bast, H., et al.: Route planning in transportation networks. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 19\u201380. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-49487-6_2"},{"key":"40_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-49487-6_4","volume-title":"Algorithm Engineering","author":"A Bulu\u00e7","year":"2016","unstructured":"Bulu\u00e7, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 117\u2013158. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-49487-6_4"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph partitioning with natural cuts. In: IEEE PDPS, pp. 1135\u20131146 (2011)","DOI":"10.1109\/IPDPS.2011.108"},{"key":"40_CR7","unstructured":"Demetrescu, C., Goldberg, A., Johnson, D.: 9th DIMACS implementation challenge. Shortest Path (2006). \nwww.dis.uniroma1.it\/challenge9\/index.shtml"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28, 652\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/265910.265914","volume":"44","author":"D Eppstein","year":"1997","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification-a technique for speeding up dynamic graph algorithms. J. ACM 44, 669\u2013696 (1997)","journal-title":"J. ACM"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trc.2016.09.009","volume":"73","author":"A Faro","year":"2016","unstructured":"Faro, A., Giordano, D.: Algorithms to find shortest and alternative paths in free flow and congested traffic regimes. Transp. Res. C 73, 1\u201329 (2016)","journal-title":"Transp. Res. C"},{"key":"40_CR11","first-page":"293","volume":"45","author":"A Felner","year":"2005","unstructured":"Felner, A.: Finding optimal solutions to the graph partitioning problem with heuristic search. AMAI 45, 293\u2013322 (2005)","journal-title":"AMAI"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/jagm.1999.1048","volume":"34","author":"D Frigioni","year":"2000","unstructured":"Frigioni, D., Marchetti-Spaccamela, F., Nanni, U.: Fully dynamic algorithms for maintaining shortest paths trees. J. Algorithms. 34, 251\u2013281 (2000)","journal-title":"J. Algorithms."},{"key":"40_CR13","unstructured":"Gonzalez, H., Han, J., Li, X., Myslinska, M., Sondag, J.P.: Adaptive fastest path computation on a road network: a traffic mining approach. PVLDB, pp. 794\u2013805 (2007)"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Hassan, M.S., Aref, W.G., Aly, A.M.: Graph indexing for shortest-path finding over dynamic sub-graphs. In: ACM SIGMOD, pp. 1183\u20131197 (2016)","DOI":"10.1145\/2882903.2882933"},{"key":"40_CR15","first-page":"2017","volume":"7","author":"B Huang","year":"2014","unstructured":"Huang, B., Jin, W.: Large scale real-time ridesharing with service guarantee on road networks. PVLDB 7, 2017\u20132028 (2014)","journal-title":"PVLDB"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Huang, W., Jing, N., Rundensteiner, E.: Effective graph clustering for path queries in digital map databases. In: ACM CIKM, pp. 215\u2013222 (1996)","DOI":"10.1145\/238355.238497"},{"key":"40_CR17","unstructured":"Kroge: Comparing k Shortest Paths with reasonable alternative routes. Bachelor thesis, Clausthal University of Technology (2017)"},{"key":"40_CR18","first-page":"547","volume":"24","author":"L Lee","year":"2012","unstructured":"Lee, L., Heng, T.: ROAD: a new spatial object search framework for road networks. IEEE TKDE 24, 547\u2013560 (2012)","journal-title":"IEEE TKDE"},{"key":"40_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-32281-5_29","volume-title":"Web-Age Information Management","author":"X Liu","year":"2012","unstructured":"Liu, X., Wang, H.: Dynamic graph shortest path algorithm. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds.) WAIM 2012. LNCS, vol. 7418, pp. 296\u2013307. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-32281-5_29"},{"key":"40_CR20","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2674395","volume":"19","author":"S Luxen","year":"2015","unstructured":"Luxen, S.: Candidate sets for alternative routes in road networks. ACM J. Exp. Algorithm 19, 2\u20137 (2015)","journal-title":"ACM J. Exp. Algorithm"},{"key":"40_CR21","doi-asserted-by":"publisher","first-page":"29","DOI":"10.3389\/fict.2017.00029","volume":"4","author":"F Neukart","year":"2017","unstructured":"Neukart, F., Compostella, G., Seidel, S., von Dollen, D., Yarkoni, S., Parney, B.: Traffic flow optimization using a quantum Annealer. Front. ICT 4, 29 (2017)","journal-title":"Front. ICT"},{"key":"40_CR22","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-3975(95)00079-8","volume":"158","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. TCS 158, 233\u2013277 (1996)","journal-title":"TCS"},{"key":"40_CR23","first-page":"1109","volume":"10","author":"M Rezaei","year":"2019","unstructured":"Rezaei, M., Noori, H., Mohammadkhani Razlighi, M., Nickray, M.: ReFOCUS+: multi-layers real-time intelligent route guidance system with congestion detection and avoidance. IEEE TITS 10, 1109 (2019)","journal-title":"IEEE TITS"},{"key":"40_CR24","first-page":"61","volume":"10","author":"X Wang","year":"2016","unstructured":"Wang, X., Yang, L.: Effective indexing for approximate constrained shortest path queries on large road networks. PVLDB 10, 61\u201372 (2016)","journal-title":"PVLDB"},{"key":"40_CR25","doi-asserted-by":"crossref","unstructured":"Zheng, B., et al.: Keyword-aware continuous kNN queries on road networks. In: IEEE ICDE, pp. 871\u2013882 (2016)","DOI":"10.1109\/ICDE.2016.7498297"},{"key":"40_CR26","doi-asserted-by":"crossref","unstructured":"Zhong, R., Li, G., Tan, K.L. Zhou, L.: G-tree: an efficient index for kNN search on road networks. In: ACM CIKM, pp. 39\u201348 (2013)","DOI":"10.1145\/2505515.2505749"}],"container-title":["Lecture Notes in Computer Science","Conceptual Modeling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62522-1_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T00:19:35Z","timestamp":1603930775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-62522-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625214","9783030625221"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62522-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ER","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Conceptual Modeling","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"er2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/er2020.big.tuwien.ac.at\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"143","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":"28","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":"16","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":"20% - 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":"5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}