{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T19:37:37Z","timestamp":1715888257010},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2016,4,1]]},"DOI":"10.1109\/tkde.2015.2507581","type":"journal-article","created":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T19:09:12Z","timestamp":1449774552000},"page":"951-964","source":"Crossref","is-referenced-by-count":18,"title":["Efficient Cache-Supported Path Planning on Roads"],"prefix":"10.1109","volume":"28","author":[{"given":"Ying","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yu-Ling","family":"Hsueh","sequence":"additional","affiliation":[]},{"given":"Wang-Chien","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Yi-Hao","family":"Jhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","year":"0"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424426"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"65","DOI":"10.3233\/KES-2007-11105","article-title":"Dynamic route planning for car navigation systems using virus genetic algorithms","volume":"11","author":"kanoh","year":"2007","journal-title":"Int J Knowl -Based Intell Eng Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.13"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"ref12","first-page":"26","article-title":"Proximity search in aatabases","author":"goldman","year":"0","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/238355.238550"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/69.687976"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22922-0_7"},{"key":"ref16","first-page":"794","article-title":"Adaptive fastest path computation on a road network: A traffic mining approach","author":"gonzalez","year":"0","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213872"},{"key":"ref18","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(00)00308-X"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066212"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687763"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59179-2_15"},{"key":"ref29","first-page":"643","article-title":"SEA-CNN: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases","author":"xiong","year":"0","journal-title":"Proc IEEE 21st Int Conf Data Eng"},{"key":"ref5","first-page":"33","article-title":"Exact and approximate distances in graphs – a survey","volume":"2161","author":"zwick","year":"0","journal-title":"Proceedings of the 9th Annual European Symposium on Algorithms"},{"key":"ref8","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","author":"goldberg","year":"0","journal-title":"Proc ACM\/SIAM Symp on Discrete Algorithms"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref2","first-page":"1376","article-title":"Bayesian hierarchical modelling of traffic flow - With application to Malta's road network","author":"zammit","year":"0","journal-title":"Proc Int IEEE Conf Intell Transp Syst"},{"key":"ref9","first-page":"100","article-title":"Reach-based routing: A new approach to shortest path algorithms optimized for road networks","author":"gutman","year":"0","journal-title":"Proc Workshop Algorithm Eng Experiments"},{"key":"ref1","article-title":"Shared execution of path queries on road networks","volume":"abs 1210 6746","author":"mahmud","year":"2012","journal-title":"Clinical Orthopaedics and Related Research"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1961659.1961663"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39984-1_5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277775"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367710"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2010.12.007"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060785"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526768"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7426466\/7352325.pdf?arnumber=7352325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:48:13Z","timestamp":1642006093000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7352325\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,1]]},"references-count":32,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2015.2507581","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2016,4,1]]}}}