{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T05:04:46Z","timestamp":1747890286964,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181196"},{"type":"electronic","value":"9783319181202"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18120-2_14","type":"book-chapter","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T08:08:06Z","timestamp":1428480486000},"page":"226-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Efficient Passenger Assignment for Group Transportation"],"prefix":"10.1007","author":[{"given":"Jiajie","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanfeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengfei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoming","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiming","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,9]]},"reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1287\/mnsc.10.3.578","volume":"10","author":"ML Balinski","year":"1964","unstructured":"Balinski, M.L., Gomory, R.E.: A primal method for the assignment and transportation problems. Management Sci. 10(3), 578\u2013593 (1964)","journal-title":"Management Sci."},{"key":"14_CR2","unstructured":"Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proceedings of VLDB, pp. 853\u2013864 (2005)"},{"key":"14_CR3","first-page":"1180","volume-title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Tobias Brunsch","year":"2013","unstructured":"Brunsch, T., Cornelissen, K., Manthey, B., R\u00f6glin, H.: Smoothed analysis of the successive shortest path algorithm. In: Proceedings of SODA, pp. 1180\u20131189 (2013)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzig","year":"1959","unstructured":"Dantzig, G., Ramser, J.: The truck dispatching problem. Management Science 6, 80\u201391 (1959)","journal-title":"Management Science"},{"issue":"25","key":"14_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0167-9236(98)00090-6","volume":"2","author":"M Desrochers","year":"1999","unstructured":"Desrochers, M., Jones, C., Lenstra, J.K., Savelsbergh, M., Stougie, L.: Towards a model and algorithm management system for vehicle routing and scheduling problems. Decision Support Systems 2(25), 109\u2013133 (1999)","journal-title":"Decision Support Systems"},{"key":"14_CR6","first-page":"1413","volume-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Ran Duan","year":"2012","unstructured":"Duan, R., Su, H.-H.: A scaling algorithm for maximum weight matching in bipartite graphs. In: Proceedings of SODA, pp. 1413\u20131424 (2012)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319\u2013333. Springer, Heidelberg (2008)"},{"key":"14_CR8","unstructured":"Matijevic, D., Sanders, P., Bast, H., Funke, S., Schultes, D.: In transit to constant time shortest-path queries in road networks. In: Proceedings of ALENEX (2007)"},{"issue":"1","key":"14_CR9","first-page":"73","volume":"7","author":"M Kaul","year":"2013","unstructured":"Kaul, M., Wong, R.C.-W., Yang, B., Jensen, C.S.: Finding shortest paths on terrains by killing two birds with one stone. PVLDB 7(1), 73\u201384 (2013)","journal-title":"PVLDB"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Liu, K., Li, Y., He, F., Xu, J., Ding, Z.: Effective map-matching on the most simplified road network. In: Proceedings of ACM SIGSPATIAL GIS, pp. 609\u2013612 (2012)","DOI":"10.1145\/2424321.2424429"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Ma, S., Zheng, Y., Wolfson, O.: T-share: A large-scale dynamic taxi ridesharing service. In: Proceedings of ICDE, pp. 410\u2013421 (2013)","DOI":"10.1109\/ICDE.2013.6544843"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Indust. Appl. Math. 5, 32\u201338 (1957)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Pournajaf, L., Xiong, L., Sunderam, V.S., Goryczka, S.: Spatial task assignment for crowd sensing with cloaked locations. In: Proceedings of MDM, pp. 73\u201382 (2014)","DOI":"10.1109\/MDM.2014.15"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1007\/11841036_71","volume-title":"Algorithms \u2013 ESA 2006","author":"P Sanders","year":"2006","unstructured":"Sanders, P., Schultes, D.: Engineering highway hierarchies. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 804\u2013816. Springer, Heidelberg (2006)"},{"issue":"8","key":"14_CR16","first-page":"1158","volume":"22","author":"J Sankaranarayanan","year":"2010","unstructured":"Sankaranarayanan, J., Samet, H.: Query processing using distance oracles for spatial networks. IEEE TKDE 22(8), 1158\u20131175 (2010)","journal-title":"IEEE TKDE"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00778-009-0144-3","volume":"19","author":"LH U","year":"2010","unstructured":"U, L.H., Mouratidis, K., Mamoulis, N.: Continuous spatial assignment of moving users. VLDBJ 19(2), 141\u2013160 (2010)","journal-title":"VLDBJ"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"U, L.H., Yiu, M.L., Mouratidis, K., Mamoulis, N.: Capacity constrained assignment in spatial databases. In: Proceedings of SIGMOD, pp. 15\u201328 (2008)","DOI":"10.1145\/1376616.1376621"},{"issue":"2","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1735886.1735888","volume":"35","author":"LH U","year":"2010","unstructured":"U, L.H., Yiu, M.L., Mouratidis, K., Mamoulis, N.: Optimal matching between spatial datasets under capacity constraints. ACM TODS 35(2), 1\u201343 (2010)","journal-title":"ACM TODS"},{"key":"14_CR20","unstructured":"Wong, R.C.-W., Tao, Y., Fu, A.W.-C., Xiao, X.: On efficient spatial matching. In: Proceedings of VLDB, pp. 579\u2013590 (2007)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18120-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T00:10:56Z","timestamp":1747872656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18120-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181196","9783319181202"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18120-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}