{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:11:23Z","timestamp":1750824683125,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644677"},{"type":"electronic","value":"9783319644684"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-64468-4_4","type":"book-chapter","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T18:05:18Z","timestamp":1501524318000},"page":"49-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Graph Matching Based Method for Dynamic Passenger-Centered Ridesharing"],"prefix":"10.1007","author":[{"given":"Jia","family":"Shi","sequence":"first","affiliation":[]},{"given":"Yifeng","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Shuigeng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Jihong","family":"Guan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,1]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.ejor.2012.05.028","volume":"223","author":"N Agatz","year":"2012","unstructured":"Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223(2), 295\u2013303 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR2","unstructured":"Amey, A.: Proposed methodology for estimating rideshare viability within an organization: application to the mit community. In: Proceedings of Transportation Research Board Annual Meeting, pp. 1\u201316 (2011)"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"A Attanasio","year":"2004","unstructured":"Attanasio, A., Cordeau, J.F., Ghiani, G., Laporte, G.: Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. 30(3), 377\u2013387 (2004)","journal-title":"Parallel Comput."},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1287\/opre.1030.0106","volume":"52","author":"R Baldacci","year":"2004","unstructured":"Baldacci, R., Maniezzo, V., Mingozzi, A.: An exact method for the car pooling problem based on lagrangean column generation. Oper. Res. 52(3), 422\u2013439 (2004)","journal-title":"Oper. Res."},{"issue":"13","key":"4_CR5","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1016\/S0305-0548(03)00186-2","volume":"31","author":"RW Calvo","year":"2004","unstructured":"Calvo, R.W., De Luigi, F., Haastrup, P., Maniezzo, V.: A distributed geographic information system for the daily car pooling problem. Comput. Oper. Res. 31(13), 2263\u20132278 (2004)","journal-title":"Comput. Oper. Res."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Cici, B., Markopoulou, A., Frias-Martinez, E., Laoutaris, N.: Assessing the potential of ride-sharing using mobile and social data: a tale of four cities. In: Proceedings of the ACM International Joint Conference on Pervasive and Ubiquitous Computing, pp. 201\u2013211 (2014)","DOI":"10.1145\/2632048.2632055"},{"key":"4_CR7","unstructured":"Donovan, B., Work, D.B.: Using coarse GPS data to quantify city-scale transportation system resilience to extreme events. Comput. Sci. (2015)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-319-32049-6_28","volume-title":"Database Systems for Advanced Applications","author":"X Duan","year":"2016","unstructured":"Duan, X., Jin, C., Wang, X., Zhou, A., Yue, K.: Real-time personalized taxi-sharing. In: Navathe, S.B., Wu, W., Shekhar, S., Du, X., Wang, X.S., Xiong, H. (eds.) DASFAA 2016. LNCS, vol. 9643, pp. 451\u2013465. Springer, Cham (2016). doi:10.1007\/978-3-319-32049-6_28"},{"issue":"3","key":"4_CR9","first-page":"361","volume":"17","author":"J Edmonds","year":"2009","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17(3), 361\u2013379 (2009)","journal-title":"Can. J. Math."},{"issue":"5","key":"4_CR10","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/90.958323","volume":"9","author":"P Francis","year":"2001","unstructured":"Francis, P., Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., Zhang, L.: IDMaps: a global internet host distance estimation service. IEEE\/ACM Trans. Netw. 9(5), 525\u2013540 (2001)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"57","key":"4_CR11","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.trb.2013.08.012","volume":"57","author":"M Furuhata","year":"2013","unstructured":"Furuhata, M., Dessouky, M., Ordez, F., Brunet, M.E., Wang, X., Koenig, S.: Ridesharing: the state-of-the-art and future directions. Transp. Res. Part B Methodol. 57(57), 28\u201346 (2013)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/6462.6502","volume":"18","author":"Z Galil","year":"1986","unstructured":"Galil, Z.: Efficient algorithms for finding maximum matching in graphs. ACM Comput. Surv. (CSUR) 18(1), 23\u201338 (1986)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"4_CR13","unstructured":"Geisberger, R., Luxen, D., Neubauer, S., Sanders, P., Volker, L.: Fast detour computation for ride sharing. Comput. Sci. (2009)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-20364-0_8","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"W Herbawi","year":"2011","unstructured":"Herbawi, W., Weber, M.: Evolutionary multiobjective route planning in dynamic multi-hop ridesharing. In: Merz, P., Hao, J.-K. (eds.) EvoCOP 2011. LNCS, vol. 6622, pp. 84\u201395. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-20364-0_8"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Herbawi, W., Weber, M.: Modeling the multihop ridematching problem with time windows and solving it using genetic algorithms. In: Proceedings of the IEEE International Conference on Tools with Artificial Intelligence, pp. 89\u201396 (2012)","DOI":"10.1109\/ICTAI.2012.21"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Herbawi, W., Weber, M.: The ridematching problem with time windows in dynamic ridesharing: a model and a genetic algorithm. In: Proceedings of the ACM Genetic and Evolutionary Computation Conference, pp. 1\u20138 (2012)","DOI":"10.1109\/CEC.2012.6253001"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Ma, S., Zheng, Y., Wolfson, O.: T-share: a large-scale dynamic taxi ridesharing service. In: Proceedings of the IEEE International Conference on Data Engineering, pp. 410\u2013421 (2013)","DOI":"10.1109\/ICDE.2013.6544843"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of the ACM Conference on Information and Knowledge Management, pp. 867\u2013876 (2009)","DOI":"10.1145\/1645953.1646063"},{"issue":"1","key":"4_CR19","first-page":"2","volume":"12","author":"E Pyrga","year":"2008","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient models for timetable information in public transportation systems. J. Exp. Algorithmics 12(1), 2\u20134 (2008)","journal-title":"J. Exp. Algorithmics"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/TKDE.2012.253","volume":"26","author":"M Qiao","year":"2013","unstructured":"Qiao, M., Cheng, H., Chang, L., Yu, J.X.: Approximate shortest distance computing: a query-dependent local landmark scheme. IEEE Trans. Knowl. Data Eng. 26(1), 55\u201368 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-22351-8_16","volume-title":"Scientific and Statistical Database Management","author":"M Qiao","year":"2011","unstructured":"Qiao, M., Cheng, H., Yu, J.X.: Querying shortest path distance with bounded errors in large graphs. In: Bayard Cushing, J., French, J., Bowers, S. (eds.) SSDBM 2011. LNCS, vol. 6809, pp. 255\u2013273. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22351-8_16"},{"key":"4_CR22","unstructured":"Santos, D.O., Xavier, E.C.: Dynamic taxi and ridesharing: a framework and heuristics for the optimization problem. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 2885\u20132891 (2013)"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64468-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T19:12:13Z","timestamp":1750792333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-64468-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644677","9783319644684"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64468-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}