{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T10:17:50Z","timestamp":1776334670068,"version":"3.51.2"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030648428","type":"print"},{"value":"9783030648435","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-64843-5_46","type":"book-chapter","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:04:24Z","timestamp":1607097864000},"page":"681-696","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Trip-Vehicle Assignment Algorithms for Ride-Sharing"],"prefix":"10.1007","author":[{"given":"Songhua","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor C. S.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,4]]},"reference":[{"issue":"37","key":"46_CR1","doi-asserted-by":"publisher","first-page":"13290","DOI":"10.1073\/pnas.1403657111","volume":"111","author":"P Santi","year":"2014","unstructured":"Santi, P., Resta, G., Szell, M., Sobolevsky, S., Strogatz, S.H., Ratti, C.: Quantifying the benefits of vehicle pooling with shareability networks. Proc. Nat. Acad. Sci. 111(37), 13290\u201313294 (2014)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"46_CR2","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434\u2013443 (1990)"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Zhao, B., Xu, P., Shi, Y., Tong, Y., Zhou, Z., Zeng, Y.: Preference-aware task assignment in on-demand taxi dispatching: an online stable matching approach. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 2245\u20132252 (2019)","DOI":"10.1609\/aaai.v33i01.33012245"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Dickerson, J.P., Sankararaman, K.A., Srinivasan, A., Xu, P.: Allocation problems in ride-sharing platforms: online matching with reusable offline resources. In: Thirty-Second AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.11477"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Bei, X., Zhang, S.: Algorithms for trip-vehicle assignment in ride-sharing. In: Thirty-Second AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.11298"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Lin, Q., Dengt, L., Sun, J., Chen, M.: Optimal demand-aware ride-sharing routing. In: IEEE INFOCOM 2018-IEEE Conference on Computer Communications, pp. 2699\u20132707. IEEE (2018)","DOI":"10.1109\/INFOCOM.2018.8486278"},{"issue":"3","key":"46_CR7","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1073\/pnas.1611675114","volume":"114","author":"J Alonso-Mora","year":"2017","unstructured":"Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E., Rus, D.: On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proc. Nat. Acad. Sci. 114(3), 462\u2013467 (2017)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"12","key":"46_CR8","doi-asserted-by":"publisher","first-page":"1053","DOI":"10.14778\/2994509.2994523","volume":"9","author":"Y Tong","year":"2016","unstructured":"Tong, Y., She, J., Ding, B., Chen, L., Wo, T., Xu, K.: Online minimum matching in real-time spatial data: experiments and analysis. Proc. VLDB Endow. 9(12), 1053\u20131064 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"46_CR9","unstructured":"Huang, T., Fang, B., Bei, X., Fang, F.: Dynamic trip-vehicle dispatch with scheduled and on-demand requests. In: Conference on Uncertainty in Artificial Intelligence (2019)"},{"key":"46_CR10","unstructured":"Lesmana, N. S., Zhang, X., Bei, X.: Balancing efficiency and fairness in on-demand ride-sourcing. In: Advances in Neural Information Processing Systems, pp. 5309\u20135319 (2019)"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Lowalekar, M., Varakantham, P., Jaillet, P.: ZAC: a zone path construction approach for effective real-time ridesharing. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 29, no. 1, pp. 528\u2013538 (2019)","DOI":"10.1609\/icaps.v29i1.3519"},{"key":"46_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-35389-6_10","volume-title":"Web and Internet Economics","author":"M Curry","year":"2019","unstructured":"Curry, M., Dickerson, J.P., Sankararaman, K.A., Srinivasan, A., Wan, Y., Xu, P.: Mix and match: Markov chains and mixing times for matching in rideshare. In: Caragiannis, I., Mirrokni, V., Nikolova, E. (eds.) WINE 2019. LNCS, vol. 11920, pp. 129\u2013141. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35389-6_10"},{"issue":"3","key":"46_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3390890","volume":"67","author":"Z Huang","year":"2020","unstructured":"Huang, Z., Kang, N., Tang, Z.G., Wu, X., Zhang, Y., Zhu, X.: Fully online matching. J. ACM (JACM) 67(3), 1\u201325 (2020)","journal-title":"J. ACM (JACM)"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 352\u2013358 (1990)","DOI":"10.1145\/100216.100262"},{"key":"46_CR15","unstructured":"Lowalekar, M., Varakantham, P., Jaillet, P.: Competitive ratios for online multi-capacity ridesharing. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, pp. 771\u2013779 (2020)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64843-5_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T12:04:28Z","timestamp":1669982668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64843-5_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648428","9783030648435"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64843-5_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2020\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","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":"55","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":"0","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":"53% - 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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}