{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:07Z","timestamp":1725544027737},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540341666"},{"type":"electronic","value":"9783540341680"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_49","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T20:17:13Z","timestamp":1146169033000},"page":"487-497","source":"Crossref","is-referenced-by-count":0,"title":["A Shortest Path Algorithm Based on Limited Search Heuristics"],"prefix":"10.1007","author":[{"given":"Feng","family":"Lu","sequence":"first","affiliation":[]},{"given":"Poh-Chin","family":"Lai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/net.3230140208","volume":"4","author":"N. Deo","year":"1984","unstructured":"Deo, N., Pang, C.Y.: Shortest-path algorithms: taxonomy and annotation. Networks\u00a04, 275\u2013323 (1984)","journal-title":"Networks"},{"key":"49_CR2","first-page":"129","volume":"73","author":"B.V. Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Mathematical Programming\u00a073, 129\u2013174 (1996)","journal-title":"Mathematical Programming"},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-1-4615-5757-9_11","volume-title":"Equilibrium and advanced transportation modeling","author":"S. Pallottino","year":"1998","unstructured":"Pallottino, S., Scutell\u00e0, M.G.: Shortest path algorithms in transportation models: classical and innovative aspects. In: Marcotte, P., Nguyen, S. (eds.) Equilibrium and advanced transportation modeling, pp. 245\u2013281. Kluwer, Norwell, MA (1998)"},{"key":"49_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195123944.001.0001","volume-title":"Geographic Information Systems for Transportation: Principles and Applications","author":"H.J. Miller","year":"2001","unstructured":"Miller, H.J., Shaw, S.L.: Geographic Information Systems for Transportation: Principles and Applications. Oxford University Press, New York (2001)"},{"key":"49_CR5","unstructured":"Goldberg, A.V., Tarjan, R.E.: Expected performance of Dijkstra\u2019s shortest path algorithm. Technical Report No. PRINCETONCS\/\/TR-530-96, Princeton University (1996)"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1287\/trsc.32.1.65","volume":"32","author":"F.B. Zhan","year":"1998","unstructured":"Zhan, F.B., Noon, C.E.: Shortest path algorithms: an evaluation using real road networks. Transportation Science\u00a032, 65\u201373 (1998)","journal-title":"Transportation Science"},{"key":"49_CR7","volume-title":"Vehicle Location and Navigation Systems","author":"Y.L. Zhao","year":"1997","unstructured":"Zhao, Y.L.: Vehicle Location and Navigation Systems. Artech House Publishers, Boston (1997)"},{"key":"49_CR8","volume-title":"Artificial Intelligence: A New Synthesis","author":"N.J. Nilsson","year":"1998","unstructured":"Nilsson, N.J.: Artificial Intelligence: A New Synthesis. Morgan Kaufmann Publishers, San Francisco (1998)"},{"key":"49_CR9","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/0098-3004(90)90002-B","volume":"16","author":"P.F. Fisher","year":"1990","unstructured":"Fisher, P.F.: A primer of geographic search using artificial intelligence. Computers and Geosciences\u00a016, 753\u2013776 (1990)","journal-title":"Computers and Geosciences"},{"key":"49_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-24838-5_20","volume-title":"Experimental and Efficient Algorithms","author":"M. Holzer","year":"2004","unstructured":"Holzer, M., Schulz, F., Willhalm, T.: Combining Speed-Up Techniques for Shortest-Path Computations. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 269\u2013284. Springer, Heidelberg (2004)"},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01933251","volume":"9","author":"S. Nordbeck","year":"1969","unstructured":"Nordbeck, S., Rystedt, B.: Computer cartography \u2014 range map. BIT\u00a09, 157\u2013166 (1969)","journal-title":"BIT"},{"key":"49_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1007\/978-3-540-25944-2_124","volume-title":"Computational Science - ICCS 2004","author":"F. Lu","year":"2004","unstructured":"Lu, F., Guan, Y.: An optimum vehicular path solution with multi-heuristics. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol.\u00a03039, pp. 964\u2013971. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,4]],"date-time":"2024-02-04T01:41:39Z","timestamp":1707010899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11753728_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}