{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:04:30Z","timestamp":1725865470018},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319458168"},{"type":"electronic","value":"9783319458175"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45817-5_7","type":"book-chapter","created":{"date-parts":[[2016,9,17]],"date-time":"2016-09-17T16:16:04Z","timestamp":1474128964000},"page":"85-97","source":"Crossref","is-referenced-by-count":0,"title":["Spica: A Path Bundling Model for Rational Route Recommendation"],"prefix":"10.1007","author":[{"given":"Lei","family":"Lv","sequence":"first","affiliation":[]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xiaohui","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,18]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"KL Cooke","year":"1966","unstructured":"Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. J. Math. Anal. Appl. 14(3), 493\u2013498 (1966)","journal-title":"J. Math. Anal. Appl."},{"key":"7_CR2","unstructured":"Dean, B.C.: Continuous-time dynamic shortest path algorithms. Ph.D. thesis, Massachusetts Institute of Technology (1999)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: A case for time-dependent shortest path computation in spatial networks, pp. 474\u2013477. ACM (2010)","DOI":"10.1145\/1869790.1869865"},{"issue":"3","key":"7_CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"SE Dreyfus","year":"1969","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395\u2013412 (1969)","journal-title":"Oper. Res."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Ge, Y., Xiong, H., Liu, C., Zhou, Z.-H.: A taxi driving fraud detection system, pp. 181\u2013190. IEEE (2011)","DOI":"10.1109\/ICDM.2011.18"},{"key":"7_CR6","unstructured":"Gonzalez, H., Han, J., Li, X., Myslinska, M., Sondag, J.P.: Adaptive fastest path computation on a road network: a traffic mining approach, pp. 794\u2013805. VLDB Endowment (2007)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Kanoulas, E., Yang, D., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns, p. 10. IEEE (2006)","DOI":"10.1109\/ICDE.2006.71"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","first-page":"20","volume-title":"Advances in Spatial and Temporal Databases","author":"C-C Lee","year":"2007","unstructured":"Lee, C.-C., Wu, Y.-H., Chen, A.L.P.: Continuous evaluation of fastest path queries on road networks. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 20\u201337. Springer, Heidelberg (2007)"},{"issue":"3","key":"7_CR9","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM (JACM) 37(3), 607\u2013625 (1990)","journal-title":"J. ACM (JACM)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks, pp. 867\u2013876. ACM (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Tian, Y., Lee, K.C., Lee, W.-C.: Monitoring minimum cost paths on road networks, pp. 217\u2013226. ACM (2009)","DOI":"10.1145\/1653771.1653803"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Tretyakov, K., Armas-Cervantes, A., Garc\u00eda-Ba\u00f1uelos, L., Vilo, J., Dumas, M.: Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs, pp. 1785\u20131794. ACM (2011)","DOI":"10.1145\/2063576.2063834"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Veloso, M., Phithakkitnukoon, S., Bento, C.: Urban mobility study using taxi traces, pp. 23\u201330. ACM (2011)","DOI":"10.1145\/2030080.2030086"},{"key":"7_CR14","unstructured":"Veloso, M., Phithakkitnukoon, S., Bento, C., Fonseca, N., Olivier, P.: Exploratory study of urban flow using taxi traces (2011)"},{"issue":"5","key":"7_CR15","doi-asserted-by":"crossref","first-page":"406","DOI":"10.14778\/2140436.2140438","volume":"5","author":"L Wu","year":"2012","unstructured":"Wu, L., Xiao, X., Deng, D., Cong, G., Zhu, A.D., Zhou, S.: Shortest path and distance queries on road networks: an experimental evaluation. Proc. VLDB Endowment 5(5), 406\u2013417 (2012)","journal-title":"Proc. VLDB Endowment"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Yuan, J., Zheng, Y., Xie, X., Sun, G.: Driving with knowledge from the physical world, pp. 316\u2013324. ACM (2011)","DOI":"10.1145\/2020408.2020462"},{"issue":"1","key":"7_CR17","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/TKDE.2011.200","volume":"25","author":"Y Jing Yuan","year":"2013","unstructured":"Jing Yuan, Y., Zheng, X.X., Sun, G.: T-drive: enhancing driving directions with taxi drivers\u2019 intelligence. IEEE Trans. Knowl. Data Eng. 25(1), 220\u2013232 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Yuan, J., Zheng, Y., Zhang, L., Xie, X. and Sun, G.: Where to find my next passenger, pp. 109\u2013118. ACM (2011)","DOI":"10.1145\/2030112.2030128"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Zheng, X., Liang, X., Ke, X.: Where to wait for a taxi? pp. 149\u2013156. ACM (2012)","DOI":"10.1145\/2346496.2346520"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45817-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T23:03:12Z","timestamp":1498345392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45817-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458168","9783319458175"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45817-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}