多乘客共享乘车的稳定匹配优化

IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Hua Ke, Haoyang Li
{"title":"多乘客共享乘车的稳定匹配优化","authors":"Hua Ke, Haoyang Li","doi":"10.1007/s00500-024-09947-x","DOIUrl":null,"url":null,"abstract":"<p>The rapid growth of private car ownership has led to significant issues such as traffic congestion and environmental pollution. Ridesharing has emerged as a promising solution to alleviate the negative impacts associated with private car usage. This paper focuses on the stability of ridesharing systems and establishes a single-driver multiple-rider ridesharing matching model. To solve this model, a filtering algorithm for the pre-matching set and a fast-solving algorithm for stable matching scheme are proposed. Furthermore, we introduce the concept of subsidy distance upper limit into the ridesharing system. Remarkably, our findings indicate that with a limit of 0.1km, the distance saved generated by the subsidy amounts to 560.5% of the total subsidy. To validate our approach, we simulate ridesharing demand data using real taxi data, and design computational experiments to prove the computational efficiency of the filtering algorithm and fast-solving algorithm. The impact of various parameters on ridesharing systems is also explored.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"68 1","pages":""},"PeriodicalIF":3.1000,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-rider ridesharing stable matching optimization\",\"authors\":\"Hua Ke, Haoyang Li\",\"doi\":\"10.1007/s00500-024-09947-x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The rapid growth of private car ownership has led to significant issues such as traffic congestion and environmental pollution. Ridesharing has emerged as a promising solution to alleviate the negative impacts associated with private car usage. This paper focuses on the stability of ridesharing systems and establishes a single-driver multiple-rider ridesharing matching model. To solve this model, a filtering algorithm for the pre-matching set and a fast-solving algorithm for stable matching scheme are proposed. Furthermore, we introduce the concept of subsidy distance upper limit into the ridesharing system. Remarkably, our findings indicate that with a limit of 0.1km, the distance saved generated by the subsidy amounts to 560.5% of the total subsidy. To validate our approach, we simulate ridesharing demand data using real taxi data, and design computational experiments to prove the computational efficiency of the filtering algorithm and fast-solving algorithm. The impact of various parameters on ridesharing systems is also explored.</p>\",\"PeriodicalId\":22039,\"journal\":{\"name\":\"Soft Computing\",\"volume\":\"68 1\",\"pages\":\"\"},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2024-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00500-024-09947-x\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00500-024-09947-x","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

私家车拥有量的快速增长导致了交通拥堵和环境污染等重大问题。为缓解与私家车使用相关的负面影响,共享出行已成为一种前景广阔的解决方案。本文重点研究了共享出行系统的稳定性,并建立了单司机多乘客共享出行匹配模型。为求解该模型,本文提出了预匹配集过滤算法和稳定匹配方案快速求解算法。此外,我们还在共享出行系统中引入了补贴距离上限的概念。值得注意的是,我们的研究结果表明,当距离上限为 0.1 公里时,补贴所节省的距离相当于总补贴的 560.5%。为了验证我们的方法,我们利用真实的出租车数据模拟了共享出行需求数据,并设计了计算实验来证明过滤算法和快速求解算法的计算效率。我们还探讨了各种参数对共享出行系统的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Multi-rider ridesharing stable matching optimization

Multi-rider ridesharing stable matching optimization

The rapid growth of private car ownership has led to significant issues such as traffic congestion and environmental pollution. Ridesharing has emerged as a promising solution to alleviate the negative impacts associated with private car usage. This paper focuses on the stability of ridesharing systems and establishes a single-driver multiple-rider ridesharing matching model. To solve this model, a filtering algorithm for the pre-matching set and a fast-solving algorithm for stable matching scheme are proposed. Furthermore, we introduce the concept of subsidy distance upper limit into the ridesharing system. Remarkably, our findings indicate that with a limit of 0.1km, the distance saved generated by the subsidy amounts to 560.5% of the total subsidy. To validate our approach, we simulate ridesharing demand data using real taxi data, and design computational experiments to prove the computational efficiency of the filtering algorithm and fast-solving algorithm. The impact of various parameters on ridesharing systems is also explored.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Soft Computing
Soft Computing 工程技术-计算机:跨学科应用
CiteScore
8.10
自引率
9.80%
发文量
927
审稿时长
7.3 months
期刊介绍: Soft Computing is dedicated to system solutions based on soft computing techniques. It provides rapid dissemination of important results in soft computing technologies, a fusion of research in evolutionary algorithms and genetic programming, neural science and neural net systems, fuzzy set theory and fuzzy systems, and chaos theory and chaotic systems. Soft Computing encourages the integration of soft computing techniques and tools into both everyday and advanced applications. By linking the ideas and techniques of soft computing with other disciplines, the journal serves as a unifying platform that fosters comparisons, extensions, and new applications. As a result, the journal is an international forum for all scientists and engineers engaged in research and development in this fast growing field.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信