{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:10:34Z","timestamp":1767319834790,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":37,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819538294","type":"print"},{"value":"9789819538300","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-3830-0_7","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:08:20Z","timestamp":1767319700000},"page":"101-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fairness-Aware Ride-Sharing Assignment"],"prefix":"10.1007","author":[{"given":"Leshu","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Ting","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianye","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Dian","family":"Ouyang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Asghari, M., Deng, D., Shahabi, C., Demiryurek, U., Li, Y.: Price-aware real-time ride-sharing at scale: an auction-based approach. In: Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 1\u201310 (2016)","DOI":"10.1145\/2996913.2996974"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Baza, M., Lasla, N., Mahmoud, M.M.E.A., Srivastava, G., Abdallah, M.: B-ride: ride sharing with privacy preservation, trust and fair payment atop public blockchain. IEEE Trans. Netw. Sci. Eng. 8(2), 1214\u20131229 (2019)","DOI":"10.1109\/TNSE.2019.2959230"},{"key":"7_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106588","volume":"2024","author":"C Bongiovanni","year":"2024","unstructured":"Bongiovanni, C., Geroliminis, N., Kaspi, M.: A ride timeoriented scheduling algorithm for dial-a-ride problems. Comput. Oper. Res. 2024, 106588 (2024)","journal-title":"Comput. Oper. Res."},{"key":"7_CR4","unstructured":"Charikar, M., Raghavachari, B.: The finite capacity dial-a-ride problem. In: 39th Annual Symposium on Foundations of Computer Science, Proceedings (1998)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Chau, C.-K., Elbassioni, K.: Quantifying inefficiency of fair cost-sharing mechanisms for sharing economy. IEEE Trans. Control Netw. Syst. 5(4), 1809\u20131818 (2017)","DOI":"10.1109\/TCNS.2017.2763747"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Chau, S.C.-K., Shen, S., Zhou, Y.: Decentralized ride-sharing and vehicle-pooling based on fair cost-sharing mechanisms. IEEE Trans. Intell. Transp. Syst. 23(3), 1936\u20131946 (2020)","DOI":"10.1109\/TITS.2020.3030051"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Z., Cheng, P., Chen, L., Lin, X., Shahabi, C.: Fair task assignment in spatial crowdsourcing. Proc. VLDB Endow. 13, 12 (2020)","DOI":"10.14778\/3407790.3407839"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, P., Xin, H., Chen, L.: Utility-aware ridesharing on road networks. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 1197\u20131210 (2017)","DOI":"10.1145\/3035918.3064008"},{"key":"7_CR9","unstructured":"Clewlow, R.R., Mishra, G.S.: Disruptive transportation: the adoption, utilization, and impacts of ride-hailing in the United States (2017)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Cordeau, J.-F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573\u2013586 (2006)","DOI":"10.1287\/opre.1060.0283"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Cordeau, J.-F., Laporte, G.: A Tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. Part B Methodol. 37(6), 579\u2013594 (2003)","DOI":"10.1016\/S0191-2615(02)00045-0"},{"issue":"2022","key":"7_CR12","volume":"103","author":"T Bruce","year":"2022","unstructured":"Bruce, T., da Silva, P., Baptista, C.A., Silva, S., Santos, L.: Assessment of decarbonization alternatives for passenger transportation in Rio de Janeiro, Brazil. Transp. Res. Part D: Transp. Environ. 103(2022), 103161 (2022)","journal-title":"Transp. Res. Part D: Transp. Environ."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Dong, X., Rey, D., Travis Waller, S.: Dial-a-ride problem with users\u2019 accept\/reject decisions based on service utilities. Transp. Res. Rec. 2674(10), 55\u201367 (2020)","DOI":"10.1177\/0361198120940307"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"G\u00f8rtz, I.L., Nagarajan, V., Ravi, R.: Minimum makespan multi-vehicle dial-a-ride. ACM Trans. Algorithms (TALG) 11(3), 1\u201329 (2015)","DOI":"10.1145\/2629653"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Gschwind, T., Drexl, M.: Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem. Transp. Sci. 53(2), 480\u2013491 (2019)","DOI":"10.1287\/trsc.2018.0837"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Gupta, A., Hajiaghayi, M., Nagarajan, V., Ravi, R.: Dial a ride from K-forest. ACM Trans. Algorithms (TALG) 6(2), 1\u201321 (2010)","DOI":"10.1145\/1721837.1721857"},{"issue":"2018","key":"7_CR17","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","volume":"111","author":"SC Ho","year":"2018","unstructured":"Ho, S.C., Szeto, W.Y., Kuo, Y.-H., Leung, J.M.Y., Petering, M., Tou, T.W.H.: A survey of dial-a-ride problems: literature review and recent developments. Transp. Res. Part B Methodol. 111(2018), 395\u2013421 (2018)","journal-title":"Transp. Res. Part B Methodol."},{"key":"7_CR18","unstructured":"Jafari, E., Rambha, T., Khani, A., Boyles, S.D.: The for-profit dial-a-ride problem on dynamic networks. In: the 95th Annual Meeting of the Transportation Research Board, Washington, DC (2016)"},{"key":"7_CR19","unstructured":"Lesmana, N.S., Zhang, X., Bei, X.: Balancing efficiency and fairness in on-demand ridesourcing. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Li, B., Cheng, Y., Yuan, Y., Yang, Y., Jin, Q., Wang, G.: ACTA: autonomy and coordination task assignment in spatial crowdsourcing platforms. Proc. VLDB Endow. 16(5), 1073\u20131085 (2023)","DOI":"10.14778\/3579075.3579082"},{"key":"7_CR21","unstructured":"Li, Y., Li, H., Huang, X., Jianliang, X., Han, Yu., Mingliang, X.: Utility-aware dynamic ridesharing in spatial crowdsourcing. IEEE Trans. Mob. Comput. (2022)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Luo, K., Florio, A.M., Das, S., Guo, X.: A hierarchical grouping algorithm for the multi-vehicle dial-a-ride problem. Proc. VLDB Endow. 16(5), 1195\u20131207 (2023). https:\/\/doi.org\/10.14778\/3579075.3579091","DOI":"10.14778\/3579075.3579091"},{"key":"7_CR23","unstructured":"NYCTLC: New York City Taxi & Limousine Commission trip data (2020). https:\/\/www1.nyc.gov\/site\/tlc\/about\/tlc-trip-record-data.page"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Ong, Y.C., Protopapas, N., Yazdanpanah, V., Gerding, E.H., Stein, S.: Fair and efficient ride-scheduling: a preference-driven approach. J. Simul. (2024)","DOI":"10.1080\/17477778.2024.2334826"},{"key":"7_CR25","unstructured":"OpenStreetMap: San Francisco and New York City street map data (2021). https:\/\/www.openstreetmap.org"},{"key":"7_CR26","unstructured":"Piorkowski, M., Sarafijanovic-Djukic, N., Grossglauser, M.: CRAWDAD dataset EPFL\/mobility (2009). https:\/\/crawdad.org\/epfl\/mobility\/20090224\/cab"},{"issue":"2016","key":"7_CR27","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10479-014-1605-7","volume":"236","author":"U Ritzinger","year":"2016","unstructured":"Ritzinger, U., Puchinger, J., Hartl, R.F.: Dynamic programming based metaheuristics for the dial-a-ride problem. Ann. Oper. Res. 236(2016), 341\u2013358 (2016)","journal-title":"Ann. Oper. Res."},{"key":"7_CR28","unstructured":"Saranow, J.: Carpooling for Grown-Ups \u2014High Gas Prices, New Services Give Ride-Sharing a Boost; Rating Your Fellow Rider. (n. d.)"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Schwartz, B.: Why we work. In: Rethinking Work, pp. 31\u201335. Routledge (2023)","DOI":"10.4324\/9781003272397-7"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"To, H., Shahabi, C., Kazemi, L.: A server-assigned spatial crowdsourcing framework. ACM Trans. Spatial Algorithms Syst. (TSAS) 1(1), 1\u201328 (2015)","DOI":"10.1145\/2729713"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Tong, Y., Zeng, Y., Zhou, Z., Chen, L., Xu, K.: Unified route planning for shared mobility: an insertion-based framework. ACM Trans. Database Syst. (TODS) 47(1), 1\u201348 (2022)","DOI":"10.1145\/3488723"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Tong, Y., Zeng, Y., Zhou, Z., Chen, L., Ye, J., Xu, K.: A unified approach to route planning for shared mobility. Proc. VLDB Endow. 11(11), 1633 (2018)","DOI":"10.14778\/3236187.3236211"},{"issue":"2019","key":"7_CR33","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.trb.2019.07.009","volume":"129","author":"H Wang","year":"2019","unstructured":"Wang, H., Yang, H.: Ridesourcing systems: a framework and review. Transp. Res. Part B Methodol. 129(2019), 122\u2013155 (2019)","journal-title":"Transp. Res. Part B Methodol."},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Xu, Y., Tong, Y., Shi, Y., Tao, Q., Xu, K., Li, W.: An efficient insertion operator in dynamic ridesharing services. IEEE Trans. Knowl. Data Eng. 34(8), 3583\u20133596 (2020)","DOI":"10.1109\/TKDE.2020.3027200"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Zeng, Y., Tong, Y., Song, Y., Chen, L.: The simpler the better: an indexing approach for shared-route planning queries. Proc. VLDB Endow. 13(13), 3517\u20133530 (2020)","DOI":"10.14778\/3424573.3424574"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Zheng, L., Cheng, P., Chen, L.: Auction-based order dispatch and pricing in ridesharing. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 1034\u20131045. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00096"},{"issue":"2023","key":"7_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2023.104326","volume":"156","author":"Z Zhou","year":"2023","unstructured":"Zhou, Z., Roncoli, C., Sipetas, C.: Optimal matching for coexisting ride-hailing and ridesharing services considering pricing fairness and user choices. Transp. Res. Part C Emerg. Technol. 156(2023), 104326 (2023)","journal-title":"Transp. Res. Part C Emerg. Technol."}],"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-981-95-3830-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:08:24Z","timestamp":1767319704000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3830-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819538294","9789819538300"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3830-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2025.github.io","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}