{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:25:15Z","timestamp":1778606715295,"version":"3.51.4"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030876715","type":"print"},{"value":"9783030876722","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87672-2_20","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:02:46Z","timestamp":1632258166000},"page":"299-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Real-Time Dispatching with Local Search Improvement for Dynamic Ride-Sharing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9258-719X","authenticated-orcid":false,"given":"Martin","family":"Pouls","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6380-1348","authenticated-orcid":false,"given":"Anne","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0670-6269","authenticated-orcid":false,"given":"Katharina","family":"Glock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"issue":"3","key":"20_CR1","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. Natl. Acad. Sci. 114(3), 462\u2013467 (2017). https:\/\/doi.org\/10.1073\/pnas.1611675114","journal-title":"Proc. Natl. Acad. Sci."},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Alonso-Mora, J., Wallar, A., Rus, D.: Predictive routing for autonomous mobility-on-demand systems with ride-sharing. In: 2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 3583\u20133590. IEEE, Vancouver (September 2017). https:\/\/doi.org\/10.1109\/IROS.2017.8206203","DOI":"10.1109\/IROS.2017.8206203"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G Berbeglia","year":"2010","unstructured":"Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1), 8\u201315 (2010). https:\/\/doi.org\/10.1016\/j.ejor.2009.04.024","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1938","DOI":"10.14778\/3229863.3236229","volume":"11","author":"L Chen","year":"2018","unstructured":"Chen, L., Gao, Y., Liu, Z., Xiao, X., Jensen, C.S., Zhu, Y.: PTrider: a price-and-time-aware ridesharing system. Proc. VLDB Endow. 11(12), 1938\u20131941 (2018). https:\/\/doi.org\/10.14778\/3229863.3236229","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29\u201346 (2007). https:\/\/doi.org\/10.1007\/s10479-007-0170-8","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2886843","volume":"21","author":"J Dibbelt","year":"2016","unstructured":"Dibbelt, J., Strasser, B., Wagner, D.: Customizable contraction hierarchies. J. Exp. Algorithmics 21(1), 1\u201349 (2016). https:\/\/doi.org\/10.1145\/2886843","journal-title":"J. Exp. Algorithmics"},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10732-005-1997-2","volume":"11","author":"B Funke","year":"2005","unstructured":"Funke, B., Gr\u00fcnert, T., Irnich, S.: Local search for vehicle routing and scheduling problems: review and conceptual integration. J. Heuristic 11(4), 267\u2013306 (2005). https:\/\/doi.org\/10.1007\/s10732-005-1997-2","journal-title":"J. Heuristic"},{"issue":"14","key":"20_CR8","doi-asserted-by":"publisher","first-page":"2017","DOI":"10.14778\/2733085.2733106","volume":"7","author":"Y Huang","year":"2014","unstructured":"Huang, Y., Bastani, F., Jin, R., Wang, X.S.: Large scale real-time ridesharing with service guarantee on road networks. Proc. VLDB Endow. 7(14), 2017\u20132028 (2014). https:\/\/doi.org\/10.14778\/2733085.2733106","journal-title":"Proc. VLDB Endow."},{"key":"20_CR9","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":"20_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1613\/jair.1.11998","volume":"70","author":"M Lowalekar","year":"2021","unstructured":"Lowalekar, M., Varakantham, P., Jaillet, P.: Zone pAth Construction (ZAC) based approaches for effective real-time ridesharing. J. Artif. Intell. Res. 70, 119\u2013167 (2021). https:\/\/doi.org\/10.1613\/jair.1.11998","journal-title":"J. Artif. Intell. Res."},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Ma, S., Zheng, Y., Wolfson, O.: T-share: a large-scale dynamic taxi ridesharing service. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), Brisbane, QLD, pp. 410\u2013421. IEEE(April 2013). https:\/\/doi.org\/10.1109\/ICDE.2013.6544843","DOI":"10.1109\/ICDE.2013.6544843"},{"issue":"7","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1782","DOI":"10.1109\/TKDE.2014.2334313","volume":"27","author":"S Ma","year":"2015","unstructured":"Ma, S., Zheng, Y., Wolfson, O.: Real-time city-scale taxi ridesharing. IEEE Trans. Knowl. Data Eng. 27(7), 1782\u20131795 (2015). https:\/\/doi.org\/10.1109\/TKDE.2014.2334313","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1\u20132","key":"20_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10479-017-2525-0","volume":"259","author":"Y Molenbruch","year":"2017","unstructured":"Molenbruch, Y., Braekers, K., Caris, A.: Typology and literature review for dial-a-ride problems. Ann. Oper. Res. 259(1\u20132), 295\u2013325 (2017). https:\/\/doi.org\/10.1007\/s10479-017-2525-0","journal-title":"Ann. Oper. Res."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-030-59747-4_33","volume-title":"Computational Logistics","author":"M Pouls","year":"2020","unstructured":"Pouls, M., Meyer, A., Ahuja, N.: Idle vehicle repositioning for dynamic ride-sharing. In: Lalla-Ruiz, E., Mes, M., Vo\u00df, S. (eds.) ICCL 2020. LNCS, vol. 12433, pp. 507\u2013521. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59747-4_33"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-030-19212-9_31","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"C Riley","year":"2019","unstructured":"Riley, C., Legrain, A., Van Hentenryck, P.: Column generation for real-time ride-sharing operations. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 472\u2013487. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_31"},{"issue":"01","key":"20_CR16","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1609\/aaai.v34i01.5388","volume":"34","author":"S Shah","year":"2020","unstructured":"Shah, S., Lowalekar, M., Varakantham, P.: Neural approximate dynamic programming for on-demand ride-pooling. Proc. AAAI Conf. Artif. Intell. 34(01), 507\u2013515 (2020). https:\/\/doi.org\/10.1609\/aaai.v34i01.5388","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"20_CR17","unstructured":"Uber: Uberpool (2021). https:\/\/www.uber.com\/us\/en\/ride\/uberpool. Accessed 08 Jan 2021"}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87672-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T21:55:22Z","timestamp":1673301322000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87672-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876715","9783030876722"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87672-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2021.nl\/","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":"111","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":"42","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":"38% - 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":"2.5","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":"2","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)"}}]}}