{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T19:43:54Z","timestamp":1765568634263,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,3]]},"DOI":"10.1145\/3748636.3764605","type":"proceedings-article","created":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T19:07:30Z","timestamp":1765566450000},"page":"748-757","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Alternative Path Generation in Time-Dependent A*"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8961-3553","authenticated-orcid":false,"given":"Oussama","family":"Dhifallah","sequence":"first","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0893-3975","authenticated-orcid":false,"given":"Michael R.","family":"Evans","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4509-3222","authenticated-orcid":false,"given":"Dragomir","family":"Yankov","sequence":"additional","affiliation":[{"name":"Microsoft, Mountain View, California, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7939-1408","authenticated-orcid":false,"given":"Antonios","family":"Karatzoglou","sequence":"additional","affiliation":[{"name":"Microsoft, Mountain View, California, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7926-4413","authenticated-orcid":false,"given":"Florin","family":"Sabau","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3068-2454","authenticated-orcid":false,"given":"Goran","family":"Predovic","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,12,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Werneck","author":"Abraham Ittai","year":"2013","unstructured":"Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. 2013. Alternative Routes in Road Networks. ACM J. Exp. Algorithmics (2013)."},{"key":"e_1_3_2_1_2_1","volume-title":"Dynamic Time-Dependent Route Planning in Road Networks with User Preferences","author":"Baum Moritz","unstructured":"Moritz Baum, Julian Dibbelt, Thomas Pajor, and Dorothea Wagner. 2016. Dynamic Time-Dependent Route Planning in Road Networks with User Preferences. In Experimental Algorithms, Andrew V. Goldberg and Alexander S. Kulikov (Eds.). Springer International Publishing, Cham, 33\u201349."},{"key":"e_1_3_2_1_3_1","unstructured":"Cambridge Vehicle Information Technology CAMVIT. 2005. Choice Routing. http:\/\/www.camvit.com\/camvit-technical-english\/Camvit-Choice-Routing-Explanation-english.pdf."},{"key":"e_1_3_2_1_4_1","volume-title":"Andrew V. Goldberg.","author":"Thomas Pajor","year":"2015","unstructured":"Thomas Pajor Renato F. Werneck Daniel Delling, Andrew V. Goldberg. 2015. Customizable Route Planning in Road Networks. Transportation Science, 566\u2013591."},{"key":"e_1_3_2_1_5_1","volume-title":"Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks","author":"Delling Daniel","unstructured":"Daniel Delling and Giacomo Nannicini. 2008. Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. In Algorithms and Computation, Seok-Hee Hong, Hiroshi Nagamochi, and Takuro Fukunaga (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 812\u2013823."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2886843"},{"key":"e_1_3_2_1_7_1","volume-title":"A note on two problems in connexion with graphs. Numer. Math. 1, 1","author":"Dijkstra E. W.","year":"1959","unstructured":"E. W. Dijkstra. 1959. A note on two problems in connexion with graphs. Numer. Math. 1, 1 (1959)."},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Andrew","unstructured":"Andrew V. Goldberg and Chris Harrelson. 2005. Computing the shortest path: A search meets graph theory. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Vancouver, British Columbia) (SODA '05). Society for Industrial and Applied Mathematics."},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Andrew","unstructured":"Andrew V. Goldberg and Chris Harrelson. 2005. Computing the shortest path: A* search meets graph theory. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Vancouver, British Columbia) (SODA '05). Society for Industrial and Applied Mathematics, USA, 156\u2013165."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_11_1","unstructured":"Cambridge Vehicle Information Technology Ltd. 2005. Choice Routing. Available at http:\/\/www.camvit.com."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551863"},{"key":"e_1_3_2_1_13_1","volume-title":"Experimental Algorithms","author":"Nannicini Giacomo","unstructured":"Giacomo Nannicini, Daniel Delling, Leo Liberti, and Dominik Schultes. 2008. Bidirectional A* Search for Time-Dependent Fast Paths. In Experimental Algorithms, Catherine C. McGeoch (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 334\u2013346."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2530531"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.3390\/a14030090"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3678717.3691305"}],"event":{"name":"SIGSPATIAL '25: 33rd ACM International Conference on Advances in Geographic Information Systems","location":"The Graduate Hotel Minneapolis Minneapolis MN USA","acronym":"SIGSPATIAL '25","sponsor":["SIGSPATIAL ACM Special Interest Group on Spatial Information"]},"container-title":["Proceedings of the 33rd ACM International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3748636.3764605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T19:07:31Z","timestamp":1765566451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3748636.3764605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,3]]},"references-count":16,"alternative-id":["10.1145\/3748636.3764605","10.1145\/3748636"],"URL":"https:\/\/doi.org\/10.1145\/3748636.3764605","relation":{},"subject":[],"published":{"date-parts":[[2025,11,3]]},"assertion":[{"value":"2025-12-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}