{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:56:22Z","timestamp":1726059382275},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030352301"},{"type":"electronic","value":"9783030352318"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35231-8_54","type":"book-chapter","created":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T19:30:38Z","timestamp":1573846238000},"page":"737-749","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Multi-request Route Planning Framework Based on Grid Index and Heuristic Function"],"prefix":"10.1007","author":[{"given":"Jiajia","family":"Li","sequence":"first","affiliation":[]},{"given":"Jiahui","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Vladislav","family":"Engel","sequence":"additional","affiliation":[]},{"given":"Chuanyu","family":"Zong","sequence":"additional","affiliation":[]},{"given":"Xiufeng","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,15]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadi, E., Nascimento, M.A.: A mixed breadth-depth first search strategy for sequenced group trip planning queries. In: IEEE International Conference on Mobile Data Management (2015)","DOI":"10.1109\/MDM.2015.49"},{"key":"54_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-18123-3_12","volume-title":"Database Systems for Advanced Applications","author":"S Aljubayrin","year":"2015","unstructured":"Aljubayrin, S., He, Z., Zhang, R.: Skyline trips of multiple POIs categories. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9050, pp. 189\u2013206. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-18123-3_12"},{"issue":"11","key":"54_CR3","first-page":"6637","volume":"11","author":"L Chen","year":"2013","unstructured":"Chen, L., Qin, G.: K nearest neighbor path queries based on road networks. TELKOMNIKA Indones. J. Electr. Eng. 11(11), 6637\u20136644 (2013)","journal-title":"TELKOMNIKA Indones. J. Electr. Eng."},{"key":"54_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-12038-1_20","volume-title":"Databases in Networked Information Systems","author":"U Demiryurek","year":"2010","unstructured":"Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: Towards K-nearest neighbor search in time-dependent spatial network databases. In: Kikuchi, S., Sachdeva, S., Bhalla, S. (eds.) DNIS 2010. LNCS, vol. 5999, pp. 296\u2013310. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-12038-1_20"},{"key":"54_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-642-15364-8_36","volume-title":"Database and Expert Systems Applications","author":"U Demiryurek","year":"2010","unstructured":"Demiryurek, U., Shahabi, C., Banaei-Kashani, F.: Efficient K-nearest neighbor search in time-dependent spatial networks. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010. LNCS, vol. 6261, pp. 432\u2013449. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15364-8_36"},{"key":"54_CR6","doi-asserted-by":"crossref","unstructured":"Komai, Y., Nguyen, D.H., Hara, T., Nishio, S.: kNN search utilizing index of the minimum road travel time in time-dependent road networks. In: Proceedings of the IEEE Symposium on Reliable Distributed Systems, pp. 131\u2013137 (2014)","DOI":"10.1109\/SRDSW.2014.17"},{"issue":"3","key":"54_CR7","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1109\/TKDE.2010.243","volume":"24","author":"KC Lee","year":"2012","unstructured":"Lee, K.C., Lee, W., Zheng, B., Tian, Y.: ROAD: a new spatial object search framework for road networks. IEEE Trans. Knowl. Data Eng. 24(3), 547\u2013560 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"54_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11535331_16","volume-title":"Advances in Spatial and Temporal Databases","author":"F Li","year":"2005","unstructured":"Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On trip planning queries in spatial databases. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273\u2013290. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11535331_16"},{"issue":"11","key":"54_CR9","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.14778\/3137628.3137638","volume":"10","author":"L Li","year":"2017","unstructured":"Li, L., et al.: Minimal on-road time route scheduling on time-dependent graphs. Proc. VLDB Endow. 10(11), 1274\u20131285 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"99","key":"54_CR10","first-page":"1","volume":"PP","author":"EHC Lu","year":"2017","unstructured":"Lu, E.H.C., Chen, H.S., Tseng, V.S.: An efficient framework for multirequest route planning in urban environments. IEEE Trans. Intell. Transp. Syst. PP(99), 1\u201311 (2017)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"54_CR11","unstructured":"Menger, K.: Das botenproblem. In: Ergebnisse eines mathematischen kolloquiums, vol. 2, pp. 11\u201312 (1932)"},{"key":"54_CR12","unstructured":"Roy, S.B., Das, G., Amer-Yahia, S., Yu, C.: Interactive itinerary planning. In: 2011 IEEE 27th International Conference on Data Engineering, pp. 15\u201326. IEEE (2011)"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Wu, H., Huang, Y., Cheng, J., Li, J., Ke, Y.: Reachability and time-based path queries in temporal graphs. In: IEEE International Conference on Data Engineering, pp. 145\u2013156 (2016)","DOI":"10.1109\/ICDE.2016.7498236"},{"issue":"9","key":"54_CR14","doi-asserted-by":"publisher","first-page":"673","DOI":"10.14778\/2732939.2732941","volume":"7","author":"Y Yang","year":"2014","unstructured":"Yang, Y., Gao, H., Yu, J.X., Li, J.: Finding the cost-optimal path with time constraint over time-dependent graphs. Proc. VLDB Endow. 7(9), 673\u2013684 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"54_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-18120-2_16","volume-title":"Database Systems for Advanced Applications","author":"C Zhu","year":"2015","unstructured":"Zhu, C., Xu, J., Liu, C., Zhao, P., Liu, A., Zhao, L.: Efficient trip planning for maximizing user satisfaction. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9049, pp. 260\u2013276. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-18120-2_16"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35231-8_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T19:41:59Z","timestamp":1573846919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35231-8_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030352301","9783030352318"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35231-8_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dalian","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/adma2019.neusoft.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}