{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T16:31:31Z","timestamp":1782405091021,"version":"3.54.5"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T00:00:00Z","timestamp":1724025600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T00:00:00Z","timestamp":1724025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41971252"],"award-info":[{"award-number":["41971252"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00500-024-09947-x","type":"journal-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T10:03:08Z","timestamp":1724061788000},"page":"12005-12020","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Multi-rider ridesharing stable matching optimization"],"prefix":"10.1007","volume":"28","author":[{"given":"Hua","family":"Ke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haoyang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,19]]},"reference":[{"key":"9947_CR1","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1016\/j.sbspro.2011.04.530","volume":"17","author":"N Agatz","year":"2011","unstructured":"Agatz N, Erera AL, Savelsbergh M et al (2011) Dynamic ride-sharing: A simulation study in metro atlanta. Proc Social Behav Sci 17:532\u2013550","journal-title":"Proc Social Behav Sci"},{"issue":"2","key":"9947_CR2","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 et al (2012) Optimization for dynamic ride-sharing: A review. Eur J Oper Res 223(2):295\u2013303","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9947_CR3","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/trsc.2018.0840","volume":"53","author":"L Agussurja","year":"2019","unstructured":"Agussurja L, Cheng SF, Lau HC (2019) A state aggregation approach for stochastic multiperiod last-mile ride-sharing problems. Transp Sci 53(1):148\u2013166","journal-title":"Transp Sci"},{"key":"9947_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.trb.2018.12.009","volume":"120","author":"Z Bian","year":"2019","unstructured":"Bian Z, Liu X (2019) Mechanism design for first-mile ridesharing based on personalized requirements part i: Theoretical analysis in generalized scenarios. Transp Res Part B Methodol 120:147\u2013171","journal-title":"Transp Res Part B Methodol"},{"key":"9947_CR5","doi-asserted-by":"crossref","unstructured":"Bistaffa F, Farinelli A, Chalkiadakis G, et\u00a0al. (2015) Recommending fair payments for large-scale social ridesharing. Proceedings of the 9th ACM Conference on Recommender Systems, pp 139\u2013146","DOI":"10.1145\/2792838.2800177"},{"issue":"13","key":"9947_CR6","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1016\/S0305-0548(03)00186-2","volume":"31","author":"RW Calvo","year":"2004","unstructured":"Calvo RW, de Luigi F, Haastrup P et al (2004) A distributed geographic information system for the daily car pooling problem. Comp Oper Res 31(13):2263\u20132278","journal-title":"Comp Oper Res"},{"issue":"2","key":"9947_CR7","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1287\/trsc.2018.0832","volume":"53","author":"W Chen","year":"2019","unstructured":"Chen W, Mes M, Schutten M et al (2019) A ride-sharing problem with meeting points and return restrictions. Transp Sci 53(2):401\u2013426","journal-title":"Transp Sci"},{"key":"9947_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2021.103061","volume":"126","author":"A Fielbaum","year":"2021","unstructured":"Fielbaum A, Bai X, Alonso-Mora J (2021) On-demand ridesharing with optimized pick-up and drop-off walking locations. Transp Res Part C Emerg Technol 126:103061","journal-title":"Transp Res Part C Emerg Technol"},{"key":"9947_CR9","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, Ord\u00f3\u00f1ez F et al (2013) Ridesharing: The state-of-the-art and future directions. Transp Res Part B Methodol 57:28\u201346","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"9947_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Monthly 69(1):9\u201315","journal-title":"Am Math Monthly"},{"key":"9947_CR11","unstructured":"Gopalakrishnan R, Mukherjee K, Tulabandhula T (2016) The costs and benefits of sharing: Sequential individual rationality and sequential fairness. arXiv preprint arXiv:1607.07306"},{"key":"9947_CR12","doi-asserted-by":"crossref","unstructured":"Herbawi W, Weber M (2011) Evolutionary multiobjective route planning in dynamic multi-hop ridesharing. In: European conference on evolutionary computation in combinatorial optimization, Springer, pp 84\u201395","DOI":"10.1007\/978-3-642-20364-0_8"},{"key":"9947_CR13","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.trc.2017.10.020","volume":"85","author":"Z Hong","year":"2017","unstructured":"Hong Z, Chen Y, Mahmassani HS et al (2017) Commuter ride-sharing using topology-based vehicle trajectory clustering: Methodology, application and impact evaluation. Transp Res Part C Emerg Technol 85:573\u2013590","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"19","key":"9947_CR14","doi-asserted-by":"publisher","first-page":"9544","DOI":"10.3390\/app12199544","volume":"12","author":"FS Hsieh","year":"2022","unstructured":"Hsieh FS (2022) Development and comparison of ten differential-evolution and particle swarm-optimization based algorithms for discount-guaranteed ridesharing systems. Appl Sci 12(19):9544","journal-title":"Appl Sci"},{"issue":"4","key":"9947_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.3390\/systems11040187","volume":"11","author":"FS Hsieh","year":"2023","unstructured":"Hsieh FS (2023) Improving acceptability of cost savings allocation in ridesharing systems based on analysis of proportional methods. Systems 11(4):187","journal-title":"Systems"},{"key":"9947_CR16","doi-asserted-by":"crossref","unstructured":"Iwama K, Miyazaki S (2008) A survey of the stable marriage problem and its variants. In: International conference on informatics education and research for knowledge-circulating society (ICKS 2008). IEEE, International conference on informatics education and research for knowledge-circulating society (ICKS 2008), pp 131\u2013136","DOI":"10.1109\/ICKS.2008.7"},{"issue":"4","key":"9947_CR17","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1007\/s00500-022-07377-1","volume":"27","author":"R Khemiri","year":"2023","unstructured":"Khemiri R, Naija M, Exposito E (2023) Dispatching and rebalancing for ride-sharing autonomous mobility-on-demand systems based on a fuzzy multi-criteria approach. Soft Comput 27(4):2041\u20132069","journal-title":"Soft Comput"},{"key":"9947_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2020.102891","volume":"122","author":"P Kumar","year":"2021","unstructured":"Kumar P, Khani A (2021) An algorithm for integrating peer-to-peer ridesharing and schedule-based transit system for first mile\/last mile access. Transp Res Part C Emerg Technol 122:102891","journal-title":"Transp Res Part C Emerg Technol"},{"key":"9947_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2021.102413","volume":"103","author":"Y Li","year":"2021","unstructured":"Li Y, Li X, Zhang S (2021) Optimal pricing of customized bus services and ride-sharing based on a competitive game model. Omega 103:102413","journal-title":"Omega"},{"key":"9947_CR20","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.apenergy.2019.02.003","volume":"240","author":"X Liu","year":"2019","unstructured":"Liu X (2019) A trip-specific model for fuel saving estimation and subsidy policy making of carpooling based on empirical data. Appl Energy 240:295\u2013311","journal-title":"Appl Energy"},{"key":"9947_CR21","doi-asserted-by":"crossref","unstructured":"Lu W, Quadrifoglio L (2019) Fair cost allocation for ridesharing services - modeling, mathematical programming and an algorithm to find the nucleolus. Transp Res Part B Methodol 121:41\u201355","DOI":"10.1016\/j.trb.2019.01.001"},{"key":"9947_CR22","volume":"110","author":"C Luo","year":"2022","unstructured":"Luo C, Zhou X, Lev B (2022) Core, shapley value, nucleolus and nash bargaining solution: A survey of recent developments and applications in operations management. Omgera Int J Mange Sci 110:102638","journal-title":"Omgera Int J Mange Sci"},{"issue":"S1","key":"9947_CR23","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00521-018-3733-5","volume":"31","author":"R Ma","year":"2019","unstructured":"Ma R, Yao L, Song L et al (2019) A novel algorithm for peer-to-peer ridesharing match problem. Neural Comput Appl 31(S1):247\u2013258","journal-title":"Neural Comput Appl"},{"key":"9947_CR24","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.tre.2017.10.009","volume":"108","author":"A Najmi","year":"2017","unstructured":"Najmi A, Rey D, Rashidi TH (2017) Novel dynamic formulations for real-time ride-sharing systems. Transp Res Part E Logis Transp Rev 108:122\u2013140","journal-title":"Transp Res Part E Logis Transp Rev"},{"issue":"12","key":"9947_CR25","doi-asserted-by":"publisher","first-page":"2043","DOI":"10.1109\/JPROC.2003.819610","volume":"91","author":"M Papageorgiou","year":"2003","unstructured":"Papageorgiou M, Diakaki C, Dinopoulou V et al (2003) Review of road traffic control strategies. Proc IEEE 91(12):2043\u20132067","journal-title":"Proc IEEE"},{"issue":"1","key":"9947_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.3141\/2542-15","volume":"2542","author":"C Rodier","year":"2016","unstructured":"Rodier C, Alemi F, Smith D (2016) Dynamic ridesharing: Exploration of potential for reduction in vehicle miles traveled. Transp Res Record 2542(1):120\u2013126","journal-title":"Transp Res Record"},{"issue":"2","key":"9947_CR27","doi-asserted-by":"publisher","first-page":"425","DOI":"10.2307\/1913160","volume":"54","author":"AE Roth","year":"1986","unstructured":"Roth AE (1986) On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econometrica 54(2):425\u2013427","journal-title":"Econometrica"},{"issue":"19","key":"9947_CR28","doi-asserted-by":"publisher","first-page":"6728","DOI":"10.1016\/j.eswa.2015.04.060","volume":"42","author":"DO Santos","year":"2015","unstructured":"Santos DO, Xavier EC (2015) Taxi and ride sharing: A dynamic dial-a-ride problem with money as an incentive. Expert Syst Appl 42(19):6728\u20136737","journal-title":"Expert Syst Appl"},{"key":"9947_CR29","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 (2019) Real-time city-scale ridesharing via linear assignment problems. Transp Res Part C Emerg Technol 101:208\u2013232","journal-title":"Transp Res Part C Emerg Technol"},{"key":"9947_CR30","unstructured":"Sivak M (2013) Effects of vehicle fuel economy, distance travelled, and vehicle load on the amount of fuel used for personal transportation: 1970\u20132010. University of Michigan, Ann Arbor, Transportation Research Institute, Tech. rep"},{"issue":"3","key":"9947_CR31","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1016\/j.ejor.2019.04.044","volume":"278","author":"L Sun","year":"2019","unstructured":"Sun L, Teunter RH, Babai MZ et al (2019) Optimal pricing for ride-sourcing platforms. Eur J Oper Res 278(3):783\u2013795","journal-title":"Eur J Oper Res"},{"key":"9947_CR32","doi-asserted-by":"crossref","unstructured":"Tafreshian A, Masoud N (2020) Trip-based graph partitioning in dynamic ridesharing. Transp Res Part C Emerg Technol 114:532\u2013553","DOI":"10.1016\/j.trc.2020.02.008"},{"key":"9947_CR33","first-page":"51","volume":"51","author":"D Teodorovic","year":"2005","unstructured":"Teodorovic D, Dell\u2019Orco M (2005) Bee colony optimization-a cooperative learning approach to complex transportation problems. Adv OR AI Methods Transp 51:51\u201360","journal-title":"Adv OR AI Methods Transp"},{"key":"9947_CR34","doi-asserted-by":"publisher","first-page":"102829","DOI":"10.1016\/j.trc.2020.102829","volume":"121","author":"B Turan","year":"2020","unstructured":"Turan B, Pedarsani R, Alizadeh M (2020) Dynamic pricing and fleet management for electric autonomous mobility on demand systems. Transp Res Part C Emerg Technol 121:102829","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"4","key":"9947_CR35","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1287\/trsc.2017.0768","volume":"52","author":"X Wang","year":"2018","unstructured":"Wang X, Agatz N, Erera A (2018) Stable matching for dynamic ride-sharing systems. Transp Sci 52(4):850\u2013867","journal-title":"Transp Sci"},{"issue":"4","key":"9947_CR36","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1287\/trsc.2017.0801","volume":"52","author":"X Wang","year":"2018","unstructured":"Wang X, Yang H, Zhu D (2018) Driver-rider cost-sharing strategies and equilibria in a ridesharing program. Transp Sci 52(4):868\u2013881","journal-title":"Transp Sci"},{"key":"9947_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/634926","volume":"2014","author":"G Zhou","year":"2014","unstructured":"Zhou G, Huang K, Mao L (2014) Design of commute carpooling based on fixed time and routes. Int J Vehicular Technol 2014:1\u20138","journal-title":"Int J Vehicular Technol"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09947-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-09947-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09947-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:11:13Z","timestamp":1729631473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-09947-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,19]]},"references-count":37,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["9947"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-09947-x","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3019025\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,19]]},"assertion":[{"value":"21 April 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This study does not violate and does not involve moral and ethical statement.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}