共享出行系统的停车激励分配问题

IF 7.6 1区 工程技术 Q1 TRANSPORTATION SCIENCE & TECHNOLOGY Transportation Research Part C-Emerging Technologies Pub Date : 2024-07-31 DOI:10.1016/j.trc.2024.104782
{"title":"共享出行系统的停车激励分配问题","authors":"","doi":"10.1016/j.trc.2024.104782","DOIUrl":null,"url":null,"abstract":"<div><p>Ridesharing occurs when people with similar schedules and itineraries travel together to reduce their commuting costs. In this paper, we study how parking spaces can be used to incentivize drivers to participate in ridesharing systems. We develop a Parking Incentive Allocation (PIA) system to promote and allocate parking lots to ridesharing drivers in a stochastic and dynamic environment. The optimization problem is formulated at each period as a multi-stage stochastic decision-dependent program. To overcome the complexity of the model, we propose one greedy policy, and three approximations including two stochastic policies and an expected-value policy. We evaluate the effectiveness of the four policies on the data generated from GPS information collected by the MTL Trajet project, which studies residents’ travel patterns throughout the city of Montreal. The computational results indicate that on average, the approximate policies can improve the total distance saving by more than 20% over various problem settings. Additionally, the results show that the performance of the PIA system is significantly influenced by the attractiveness of the parking incentive to drivers.</p></div>","PeriodicalId":54417,"journal":{"name":"Transportation Research Part C-Emerging Technologies","volume":null,"pages":null},"PeriodicalIF":7.6000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A parking incentive allocation problem for ridesharing systems\",\"authors\":\"\",\"doi\":\"10.1016/j.trc.2024.104782\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Ridesharing occurs when people with similar schedules and itineraries travel together to reduce their commuting costs. In this paper, we study how parking spaces can be used to incentivize drivers to participate in ridesharing systems. We develop a Parking Incentive Allocation (PIA) system to promote and allocate parking lots to ridesharing drivers in a stochastic and dynamic environment. The optimization problem is formulated at each period as a multi-stage stochastic decision-dependent program. To overcome the complexity of the model, we propose one greedy policy, and three approximations including two stochastic policies and an expected-value policy. We evaluate the effectiveness of the four policies on the data generated from GPS information collected by the MTL Trajet project, which studies residents’ travel patterns throughout the city of Montreal. The computational results indicate that on average, the approximate policies can improve the total distance saving by more than 20% over various problem settings. Additionally, the results show that the performance of the PIA system is significantly influenced by the attractiveness of the parking incentive to drivers.</p></div>\",\"PeriodicalId\":54417,\"journal\":{\"name\":\"Transportation Research Part C-Emerging Technologies\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.6000,\"publicationDate\":\"2024-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part C-Emerging Technologies\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0968090X24003036\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"TRANSPORTATION SCIENCE & TECHNOLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part C-Emerging Technologies","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0968090X24003036","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TRANSPORTATION SCIENCE & TECHNOLOGY","Score":null,"Total":0}
引用次数: 0

摘要

当日程安排和行程相似的人为了降低通勤成本而结伴出行时,就会出现共享乘车。在本文中,我们研究了如何利用停车位来激励司机参与共享出行系统。我们开发了一个停车激励分配(PIA)系统,用于在随机和动态环境中促进和分配停车场给共享汽车司机。每个阶段的优化问题都是一个多阶段随机决策依赖程序。为了克服模型的复杂性,我们提出了一种贪婪策略和三种近似策略,包括两种随机策略和一种期望值策略。我们利用 MTL Trajet 项目收集的 GPS 信息生成的数据评估了四种策略的有效性,该项目研究了蒙特利尔市居民的出行模式。计算结果表明,在不同的问题设置下,近似策略平均可将总路程节省率提高 20% 以上。此外,计算结果还表明,PIA 系统的性能受到停车奖励对驾驶员吸引力的显著影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A parking incentive allocation problem for ridesharing systems

Ridesharing occurs when people with similar schedules and itineraries travel together to reduce their commuting costs. In this paper, we study how parking spaces can be used to incentivize drivers to participate in ridesharing systems. We develop a Parking Incentive Allocation (PIA) system to promote and allocate parking lots to ridesharing drivers in a stochastic and dynamic environment. The optimization problem is formulated at each period as a multi-stage stochastic decision-dependent program. To overcome the complexity of the model, we propose one greedy policy, and three approximations including two stochastic policies and an expected-value policy. We evaluate the effectiveness of the four policies on the data generated from GPS information collected by the MTL Trajet project, which studies residents’ travel patterns throughout the city of Montreal. The computational results indicate that on average, the approximate policies can improve the total distance saving by more than 20% over various problem settings. Additionally, the results show that the performance of the PIA system is significantly influenced by the attractiveness of the parking incentive to drivers.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
15.80
自引率
12.00%
发文量
332
审稿时长
64 days
期刊介绍: Transportation Research: Part C (TR_C) is dedicated to showcasing high-quality, scholarly research that delves into the development, applications, and implications of transportation systems and emerging technologies. Our focus lies not solely on individual technologies, but rather on their broader implications for the planning, design, operation, control, maintenance, and rehabilitation of transportation systems, services, and components. In essence, the intellectual core of the journal revolves around the transportation aspect rather than the technology itself. We actively encourage the integration of quantitative methods from diverse fields such as operations research, control systems, complex networks, computer science, and artificial intelligence. Join us in exploring the intersection of transportation systems and emerging technologies to drive innovation and progress in the field.
期刊最新文献
An environmentally-aware dynamic planning of electric vehicles for aircraft towing considering stochastic aircraft arrival and departure times Network-wide speed–flow estimation considering uncertain traffic conditions and sparse multi-type detectors: A KL divergence-based optimization approach Revealing the impacts of COVID-19 pandemic on intercity truck transport: New insights from big data analytics MATNEC: AIS data-driven environment-adaptive maritime traffic network construction for realistic route generation A qualitative AI security risk assessment of autonomous vehicles
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1