{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:57:35Z","timestamp":1743112655120,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496103"},{"type":"electronic","value":"9783031496110"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49611-0_26","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"366-379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for\u00a0the\u00a0Ridesharing with\u00a0Profit Constraint Problem"],"prefix":"10.1007","author":[{"given":"Qian-Ping","family":"Gu","sequence":"first","affiliation":[]},{"given":"Jiajian Leo","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"26_CR1","unstructured":"Ahuja R., Magnanti T., Orlin J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Hoboken (1993)"},{"issue":"3","key":"26_CR2","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1073\/pnas.1611675114","volume":"114","author":"J Alonso-Mora","year":"2017","unstructured":"Alonso-Mora, J., Samitha, 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."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.trf.2018.02.025","volume":"55","author":"Y Amirkiaee","year":"2018","unstructured":"Amirkiaee, Y., Evangelopoulos, N.: Why do people rideshare? An experimental study. Transport. Res. F: Traffic Psychol. Behav. 55, 9\u201324 (2018)","journal-title":"Transport. Res. F: Traffic Psychol. Behav."},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-44985-X_19","volume-title":"Algorithm Theory - SWAT 2000","author":"P Berman","year":"2000","unstructured":"Berman, P.: A d\/2 approximation for maximum weight independent set in d-claw free graphs. In: SWAT 2000. LNCS, vol. 1851, pp. 214\u2013219. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44985-X_19"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1287\/mnsc.2020.3622","volume":"67","author":"O Besbes","year":"2021","unstructured":"Besbes, O., Castro, F., Lobel, I.: Surge pricing and its spatial supply response. Manage. Sci. 67(3), 1350\u20131367 (2021)","journal-title":"Manage. Sci."},{"issue":"7","key":"26_CR6","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/j.trd.2009.07.008","volume":"14","author":"B Caulfield","year":"2009","unstructured":"Caulfield, B.: Estimating the environmental benefits of ride-sharing: a case study of Dublin. Transp. Res. Part D: Transp. Environ. 14(7), 527\u2013531 (2009)","journal-title":"Transp. Res. Part D: Transp. Environ."},{"key":"26_CR7","unstructured":"Center for Sustainable Systems, University of Michigan: Personal Transportation Factsheet (2022)"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1006\/jagm.2000.1155","volume":"39","author":"B Chandra","year":"2001","unstructured":"Chandra, B., Halld\u00f3rsson, M.: Greedy local improvement and weighted set packing approximation. J. Algorithms 39(2), 223\u2013240 (2001)","journal-title":"J. Algorithms"},{"key":"26_CR9","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms, Third Edition. The MIT Press, Cambridge (2009)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1038\/s41893-020-00678-z","volume":"4","author":"M Diao","year":"2021","unstructured":"Diao, M., Kong, H., Jinhua, Z.: Impacts of transportation network companies on urban mobility. Nat. Sustain. 4, 494\u2013500 (2021)","journal-title":"Nat. Sustain."},{"key":"26_CR11","unstructured":"European Environment Agency: Greenhouse gas emissions from transport in Europe (2019)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"103061","DOI":"10.1016\/j.trc.2021.103061","volume":"126","author":"A Fielbaum","year":"2021","unstructured":"Fielbaum, A., Bai, X., Alonso-Mora, J.: On-demand ridesharing with optimized pick-up and drop-off walking locations. Transp. Res. Part C: Emerg. Technol. 126, 103061 (2021)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-319-09174-7_35","volume-title":"Combinatorial Optimization","author":"M F\u00fcrer","year":"2014","unstructured":"F\u00fcrer, M., Yu, H.: Approximating the $$k$$-set packing problem by local improvements. In: Fouilhoux, P., Gouveia, L.E.N., Mahjoub, A.R., Paschos, V.T. (eds.) ISCO 2014. LNCS, vol. 8596, pp. 408\u2013420. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09174-7_35"},{"key":"26_CR14","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H, Freeman and Company (1979)"},{"key":"26_CR15","unstructured":"Gu Q., Liang J.: Multimodal transportation with ridesharing of personal vehicles. In: 32nd International Symposium on Algorithms and Computation, vol. 212, pp. 1\u201316 (2021)"},{"key":"26_CR16","unstructured":"Gu Q., Liang J.: Algorithms for the ridesharing with profit constraint problem. https:\/\/doi.org\/10.48550\/arXiv.2310.04933"},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","volume":"255","author":"A Gunawan","year":"2016","unstructured":"Gunawan, A., Lau, H.C., Vansteenwegen, P.: Orienteering Problem: a survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255(2), 315\u2013332 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"26_CR18","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Comput. Complex. 15(1), 20\u201339 (2006)","journal-title":"Comput. Complex."},{"key":"26_CR19","first-page":"2173","volume":"49","author":"A Henao","year":"2011","unstructured":"Henao, A., Marshall, W.: The impact of ride-hailing on vehicle miles traveled. Transportation 49, 2173\u20132194 (2011)","journal-title":"Transportation"},{"issue":"10","key":"26_CR20","doi-asserted-by":"publisher","first-page":"590","DOI":"10.3390\/ijgi9100590","volume":"9","author":"F-S Hsieh","year":"2020","unstructured":"Hsieh, F.-S.: A comparative study of several metaheuristic algorithms to optimize monetary incentive in ridesharing systems. ISPRS Int. J. Geo Inf. 9(10), 590 (2020)","journal-title":"ISPRS Int. J. Geo Inf."},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"102631","DOI":"10.1016\/j.tre.2022.102631","volume":"159","author":"M Li","year":"2022","unstructured":"Li, M., Jiang, G., Lo, H.K.: Pricing strategy of ride-sourcing services under travel time variability. Transp. Res. Part E: Logist. Transp. Rev. 159, 102631 (2022)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"107080","DOI":"10.1016\/j.cie.2020.107080","volume":"153","author":"L Martins","year":"2021","unstructured":"Martins, L., de la Torre, R., Corlu, C., Juan, A., Masmoudi, M.: Optimizing ride-sharing operations in smart sustainable cities: challenges and the need for agile algorithms. Comput. Ind. Eng. 153, 107080 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.trb.2019.02.003","volume":"123","author":"A Mourad","year":"2019","unstructured":"Mourad, A., Puchinger, J., Chengbin, C.C.: A survey of models and algorithms for optimizing shared mobility. Transp. Res. Part B: Methodol. 123, 323\u2013346 (2019)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"26_CR24","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.trb.2017.03.001","volume":"103","author":"X Qian","year":"2017","unstructured":"Qian, X., Zhang, W., Ukkusuri, S., Yang, C.: Optimal assignment and incentive design in the taxi group ride problem. Transp. Res. Part B: Methodol. 103, 208\u2013226 (2017)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"19","key":"26_CR25","doi-asserted-by":"publisher","first-page":"6728","DOI":"10.1016\/j.eswa.2015.04.060","volume":"42","author":"D Santos","year":"2015","unstructured":"Santos, D., Xavier, E.: Taxi and ride sharing: a dynamic dial-a-ride problem with money as an incentive. Expert Syst. Appl. 42(19), 6728\u20136737 (2015)","journal-title":"Expert Syst. Appl."},{"key":"26_CR26","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.trc.2019.01.019","volume":"101","author":"A Simonetto","year":"2019","unstructured":"Simonetto, A., Monteil, J., Gambella, C.: Real-time city-scale ridesharing via linear assignment problems. Transp. Res. Part C: Emerg. Technol. 101, 208\u2013232 (2019)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"26_CR27","unstructured":"Statistics Canada, Census: Main mode of commuting (2016)"},{"issue":"2\u20133","key":"26_CR28","first-page":"41","volume":"12","author":"A Tafreshian","year":"2020","unstructured":"Tafreshian, A., Masoud, N., Yin, Y.: Frontiers in service science: ride matching for peer-to-peer ride sharing: a review and future directions. Serv. Sci. 12(2\u20133), 41\u201360 (2020)","journal-title":"Serv. Sci."},{"key":"26_CR29","doi-asserted-by":"publisher","first-page":"102923","DOI":"10.1016\/j.trd.2021.102923","volume":"97","author":"I Tikoudis","year":"2021","unstructured":"Tikoudis, I., Martinez, L., Farrow, K., Bouyssou, C.G., Petrik, O., Oueslati, W.: Ridesharing services and urban transport CO2 emissions: simulation-based evidence from 247 cities. Transp. Res. Part D: Transp. Environ. 97, 102923 (2021)","journal-title":"Transp. Res. Part D: Transp. Environ."},{"issue":"3","key":"26_CR30","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1080\/15568318.2018.1539146","volume":"14","author":"A Tirachini","year":"2020","unstructured":"Tirachini, A., Andres, G.-L.A.: Does ride-hailing increase or decrease vehicle kilometers traveled (VKT)? A simulation approach for Santiago de Chile. Int. J. Sustain. Transp. 14(3), 187\u2013204 (2020)","journal-title":"Int. J. Sustain. Transp."},{"key":"26_CR31","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, 122\u2013155 (2019)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"26_CR32","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1002\/nav.21872","volume":"67","author":"C Yan","year":"2020","unstructured":"Yan, C., Zhu, H., Korolko, N., Woodard, D.: Dynamic pricing and matching in ride-hailing platforms. Nav. Res. Logist. 67, 705\u2013724 (2020)","journal-title":"Nav. Res. Logist."},{"key":"26_CR33","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.trb.2021.07.001","volume":"151","author":"K Zhang","year":"2021","unstructured":"Zhang, K., Nie, Y.: To pool or not to pool: Equilibrium, pricing and regulation. Transp. Res. Part B: Methodol. 151, 59\u201390 (2021)","journal-title":"Transp. Res. Part B: Methodol."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49611-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:08:31Z","timestamp":1707556111000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49611-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496103","9783031496110"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49611-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","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":"Hawai, HI","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","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":"73","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":"62% - 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":"6","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)"}}]}}