{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T18:35:52Z","timestamp":1768070152066,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,2,23]],"date-time":"2008-02-23T00:00:00Z","timestamp":1203724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s10589-008-9172-y","type":"journal-article","created":{"date-parts":[[2008,2,22]],"date-time":"2008-02-22T14:57:08Z","timestamp":1203692228000},"page":"143-158","source":"Crossref","is-referenced-by-count":21,"title":["Fast paths in large-scale dynamic road networks"],"prefix":"10.1007","volume":"45","author":[{"given":"Giacomo","family":"Nannicini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Baptiste","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Barbier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Krob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,2,23]]},"reference":[{"issue":"4","key":"9172_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1002\/net.10072","volume":"41","author":"R. Ahuja","year":"2003","unstructured":"Ahuja, R., Orlin, J., Pallottino, S., Scutell\u00e0, M.: Dynamic shortest paths minimizing travel times and costs. Networks 41(4), 197\u2013205 (2003)","journal-title":"Networks"},{"key":"9172_CR2","author":"L. Buriol","year":"2008","unstructured":"Buriol, L., Resende, M., Thorup, M.: Speeding up dynamic shortest path algorithms. INFORMS J. Comput. (2008). DOI: 10.1287\/ijoc.1070.0231","journal-title":"INFORMS J. Comput."},{"key":"9172_CR3","doi-asserted-by":"crossref","first-page":"170","DOI":"10.3141\/1645-21","volume":"1645","author":"I. Chabini","year":"1998","unstructured":"Chabini, I.: Discrete dynamic shortest path problems in transportation applications: complexity and algorithms with optimal run time. Transp. Res. Rec. 1645, 170\u2013175 (1998)","journal-title":"Transp. Res. Rec."},{"issue":"1","key":"9172_CR4","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/6979.994796","volume":"3","author":"I. Chabini","year":"2002","unstructured":"Chabini, I., Shan, L.: Adaptations of the A * algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks. IEEE Trans. Intell. Transp. Syst. 3(1), 60\u201374 (2002)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"9172_CR5","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/512161.512197","volume-title":"GIS\u201901: Proceedings of the 9th ACM International Symposium on Advances in Geographic Information Systems","author":"E. Chan","year":"2001","unstructured":"Chan, E., Zhang, N.: Finding shortest paths in large network systems. In: GIS\u201901: Proceedings of the 9th ACM International Symposium on Advances in Geographic Information Systems, pp. 160\u2013166. Assoc. Comput. Mach., New York (2001)"},{"key":"9172_CR6","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"K. Cooke","year":"1966","unstructured":"Cooke, K., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. 14, 493\u2013498 (1966)","journal-title":"J. Math. Anal. Appl."},{"key":"9172_CR7","unstructured":"Dean, B.: Shortest paths in FIFO time-dependent networks: theory and algorithms. Technical Report, MIT, Cambridge, MA (2004)"},{"key":"9172_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"WEA 2007\u2014Workshop on Experimental Algorithms","author":"D. Delling","year":"2007","unstructured":"Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: Demetrescu, C. (ed.) WEA 2007\u2014Workshop on Experimental Algorithms. Lecture Notes in Computer Science, vol. 4525. Springer, New York (2007)"},{"key":"9172_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"3","key":"9172_CR10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S. Dreyfus","year":"1969","unstructured":"Dreyfus, S.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395\u2013412 (1969)","journal-title":"Oper. Res."},{"key":"9172_CR11","unstructured":"Flatberg, T., Hasle, G., Kloster, O., Nilssen, E., Riise, A.: Dynamic and stochastic aspects in vehicle routing\u2014a literature survey. Technical Report STF90A05413, SINTEF, Oslo, Norway (2005)"},{"key":"9172_CR12","volume-title":"ALENEX 2005","author":"A. Goldberg","year":"2005","unstructured":"Goldberg, A., Kaplan, H., Werneck, R.: Reach for A * : Efficient point-to-point shortest path algorithms. In: Demetrescu, C., Sedgewick, R., Tamassia, R. (eds.) ALENEX 2005. SIAM, Philadelphia (2005)"},{"key":"9172_CR13","series-title":"Lecture Notes in Computer Science","first-page":"156","volume-title":"Proceedings of the 8th Workshop on Algorithm Engineering","author":"M. Holzer","year":"2006","unstructured":"Holzer, M., Schulz, F., Wagner, D.: Engineering multi-level overlay graphs for shortest-path queries. In: Proceedings of the 8th Workshop on Algorithm Engineering. Lecture Notes in Computer Science, vol. 129, pp. 156\u2013170. SIAM, Philadelphia (2006)"},{"key":"9172_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-40986-1","volume-title":"The Physics of Traffic","author":"B.S. Kerner","year":"2004","unstructured":"Kerner, B.S.: The Physics of Traffic. Springer, Berlin (2004)"},{"key":"9172_CR15","unstructured":"NV, T.: Tele Atlas Multinet ShapeFile 4.3.1 Format Specifications. TeleAtlas NV, May 2005"},{"key":"9172_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1007\/11561071_51","volume-title":"ESA","author":"P. Sanders","year":"2005","unstructured":"Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: St\u00f8lting Brodal, G., Leonardi, S. (eds.) ESA. Lecture Notes in Computer Science, vol. 3669, pp. 568\u2013579. Springer, Berlin (2005)"},{"key":"9172_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1007\/11841036_71","volume-title":"ESA 2006","author":"P. Sanders","year":"2006","unstructured":"Sanders, P., Schultes, D.: Engineering highway hierarchies. In: ESA 2006. Lecture Notes in Computer Science, vol. 4168, pp. 804\u2013816. Springer, Berlin (2006)"},{"key":"9172_CR18","series-title":"Lecture Notes in Computer Science","first-page":"66","volume-title":"WEA 2007\u2014Workshop on Experimental Algorithms","author":"P. Sanders","year":"2007","unstructured":"Sanders, P., Schultes, D.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) WEA 2007\u2014Workshop on Experimental Algorithms. Lecture Notes in Computer Science, vol. 4525, pp. 66\u201379. Springer, New York (2007)"},{"key":"9172_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-540-72845-0_2","volume-title":"WEA 2007\u2014Workshop on Experimental Algorithms","author":"P. Sanders","year":"2007","unstructured":"Sanders, P., Schultes, D.: Engineering fast route planning algorithms. In: Demetrescu, C. (ed.) WEA 2007\u2014Workshop on Experimental Algorithms. Lecture Notes in Computer Science, vol. 4525, pp.\u00a023\u201336. Springer, New York (2007)"},{"key":"9172_CR20","unstructured":"Schultes, D.: Fast and exact shortest path queries using highway hierarchies. Master Thesis, Informatik, Universit\u00e4t des Saarlandes, June 2005"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9172-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-008-9172-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9172-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T15:32:19Z","timestamp":1630769539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-008-9172-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,23]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["9172"],"URL":"https:\/\/doi.org\/10.1007\/s10589-008-9172-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,23]]}}}