CARMA:通过不可交易的 "业力信用 "实现公平高效的瓶颈拥堵管理

IF 4.4 2区 工程技术 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Transportation Science Pub Date : 2024-09-11 DOI:10.1287/trsc.2023.0323
Ezzat Elokda, Carlo Cenedese, Kenan Zhang, Andrea Censi, John Lygeros, Emilio Frazzoli, Florian Dörfler
{"title":"CARMA:通过不可交易的 \"业力信用 \"实现公平高效的瓶颈拥堵管理","authors":"Ezzat Elokda, Carlo Cenedese, Kenan Zhang, Andrea Censi, John Lygeros, Emilio Frazzoli, Florian Dörfler","doi":"10.1287/trsc.2023.0323","DOIUrl":null,"url":null,"abstract":"This paper proposes a nonmonetary traffic demand management scheme, named CARMA, as a fair solution to the morning commute congestion. We consider heterogeneous commuters traveling through a single bottleneck that differ in both the desired arrival time and value of time (VOT). We consider a generalized notion of VOT by allowing it to vary dynamically on each day (e.g., according to trip purpose and urgency) rather than being a static characteristic of each individual. In our CARMA scheme, the bottleneck is divided into a fast lane that is kept in free flow and a slow lane that is subject to congestion. We introduce a nontradable mobility credit, named karma, that is used by commuters to bid for access to the fast lane. Commuters who get outbid or do not participate in the CARMA scheme instead use the slow lane. At the end of each day, karma collected from the bidders is redistributed, and the process repeats day by day. We model the collective commuter behaviors under CARMA as a dynamic population game (DPG), in which a stationary Nash equilibrium (SNE) is guaranteed to exist. Unlike existing monetary schemes, CARMA is demonstrated, both analytically and numerically, to achieve (a) an equitable traffic assignment with respect to heterogeneous income classes and (b) a strong Pareto improvement in the long-term average travel disutility with respect to no policy intervention. With extensive numerical analysis, we show that CARMA is able to retain the same congestion reduction as an optimal monetary tolling scheme under uniform karma redistribution and even outperform tolling under a well-designed redistribution scheme. We also highlight the privacy-preserving feature of CARMA, that is, its ability to tailor to the private preferences of commuters without centrally collecting the information.History: This paper has been accepted for the Transportation Science Special Issue on TSL Conference 2023.Funding: This work was supported by NCCR Automation, a National Centre of Competence in Research, funded by the Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung [Grant 180545].Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2023.0323 .","PeriodicalId":51202,"journal":{"name":"Transportation Science","volume":"2016 1","pages":""},"PeriodicalIF":4.4000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"CARMA: Fair and Efficient Bottleneck Congestion Management via Nontradable Karma Credits\",\"authors\":\"Ezzat Elokda, Carlo Cenedese, Kenan Zhang, Andrea Censi, John Lygeros, Emilio Frazzoli, Florian Dörfler\",\"doi\":\"10.1287/trsc.2023.0323\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a nonmonetary traffic demand management scheme, named CARMA, as a fair solution to the morning commute congestion. We consider heterogeneous commuters traveling through a single bottleneck that differ in both the desired arrival time and value of time (VOT). We consider a generalized notion of VOT by allowing it to vary dynamically on each day (e.g., according to trip purpose and urgency) rather than being a static characteristic of each individual. In our CARMA scheme, the bottleneck is divided into a fast lane that is kept in free flow and a slow lane that is subject to congestion. We introduce a nontradable mobility credit, named karma, that is used by commuters to bid for access to the fast lane. Commuters who get outbid or do not participate in the CARMA scheme instead use the slow lane. At the end of each day, karma collected from the bidders is redistributed, and the process repeats day by day. We model the collective commuter behaviors under CARMA as a dynamic population game (DPG), in which a stationary Nash equilibrium (SNE) is guaranteed to exist. Unlike existing monetary schemes, CARMA is demonstrated, both analytically and numerically, to achieve (a) an equitable traffic assignment with respect to heterogeneous income classes and (b) a strong Pareto improvement in the long-term average travel disutility with respect to no policy intervention. With extensive numerical analysis, we show that CARMA is able to retain the same congestion reduction as an optimal monetary tolling scheme under uniform karma redistribution and even outperform tolling under a well-designed redistribution scheme. We also highlight the privacy-preserving feature of CARMA, that is, its ability to tailor to the private preferences of commuters without centrally collecting the information.History: This paper has been accepted for the Transportation Science Special Issue on TSL Conference 2023.Funding: This work was supported by NCCR Automation, a National Centre of Competence in Research, funded by the Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung [Grant 180545].Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2023.0323 .\",\"PeriodicalId\":51202,\"journal\":{\"name\":\"Transportation Science\",\"volume\":\"2016 1\",\"pages\":\"\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Science\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1287/trsc.2023.0323\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Science","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1287/trsc.2023.0323","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种名为 CARMA 的非货币交通需求管理方案,作为解决早上通勤拥堵问题的公平方案。我们考虑了通过单一瓶颈路段的异质乘客,他们的期望到达时间和时间价值(VOT)各不相同。我们考虑了 VOT 的广义概念,允许它在每天动态变化(例如,根据出行目的和紧迫性),而不是每个人的静态特征。在我们的 CARMA 方案中,瓶颈路段被分为保持畅通的快车道和拥堵的慢车道。我们引入了一种名为 "业力 "的不可交易的流动信用,通勤者可以用它来竞标快车道的使用权。投标失败或不参与 CARMA 计划的乘客则使用慢车道。每天结束时,从竞标者那里收集的 "卡玛 "将被重新分配,这一过程每天重复进行。我们将 CARMA 下的集体通勤行为建模为动态人口博弈(DPG),其中保证存在静态纳什均衡(SNE)。与现有的货币方案不同,CARMA 可通过分析和数值计算实现:(a) 不同收入阶层的公平交通分配;(b) 与无政策干预相比,长期平均出行效用的帕累托改进。通过大量的数值分析,我们表明 CARMA 能够在统一业力再分配条件下保持与最优货币收费方案相同的拥堵缓解效果,甚至优于精心设计的再分配方案下的收费效果。我们还强调了 CARMA 的隐私保护特性,即它能够在不集中收集信息的情况下,根据乘客的私人偏好量身定制:本文已被 2023 年 TSL 会议交通科学专刊录用:这项工作得到了国家研究能力中心 NCCR Automation 的支持,该中心由 Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung [Grant 180545] 资助:在线附录见 https://doi.org/10.1287/trsc.2023.0323 。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
CARMA: Fair and Efficient Bottleneck Congestion Management via Nontradable Karma Credits
This paper proposes a nonmonetary traffic demand management scheme, named CARMA, as a fair solution to the morning commute congestion. We consider heterogeneous commuters traveling through a single bottleneck that differ in both the desired arrival time and value of time (VOT). We consider a generalized notion of VOT by allowing it to vary dynamically on each day (e.g., according to trip purpose and urgency) rather than being a static characteristic of each individual. In our CARMA scheme, the bottleneck is divided into a fast lane that is kept in free flow and a slow lane that is subject to congestion. We introduce a nontradable mobility credit, named karma, that is used by commuters to bid for access to the fast lane. Commuters who get outbid or do not participate in the CARMA scheme instead use the slow lane. At the end of each day, karma collected from the bidders is redistributed, and the process repeats day by day. We model the collective commuter behaviors under CARMA as a dynamic population game (DPG), in which a stationary Nash equilibrium (SNE) is guaranteed to exist. Unlike existing monetary schemes, CARMA is demonstrated, both analytically and numerically, to achieve (a) an equitable traffic assignment with respect to heterogeneous income classes and (b) a strong Pareto improvement in the long-term average travel disutility with respect to no policy intervention. With extensive numerical analysis, we show that CARMA is able to retain the same congestion reduction as an optimal monetary tolling scheme under uniform karma redistribution and even outperform tolling under a well-designed redistribution scheme. We also highlight the privacy-preserving feature of CARMA, that is, its ability to tailor to the private preferences of commuters without centrally collecting the information.History: This paper has been accepted for the Transportation Science Special Issue on TSL Conference 2023.Funding: This work was supported by NCCR Automation, a National Centre of Competence in Research, funded by the Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung [Grant 180545].Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2023.0323 .
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Transportation Science
Transportation Science 工程技术-运筹学与管理科学
CiteScore
8.30
自引率
10.90%
发文量
111
审稿时长
12 months
期刊介绍: Transportation Science, published quarterly by INFORMS, is the flagship journal of the Transportation Science and Logistics Society of INFORMS. As the foremost scientific journal in the cross-disciplinary operational research field of transportation analysis, Transportation Science publishes high-quality original contributions and surveys on phenomena associated with all modes of transportation, present and prospective, including mainly all levels of planning, design, economic, operational, and social aspects. Transportation Science focuses primarily on fundamental theories, coupled with observational and experimental studies of transportation and logistics phenomena and processes, mathematical models, advanced methodologies and novel applications in transportation and logistics systems analysis, planning and design. The journal covers a broad range of topics that include vehicular and human traffic flow theories, models and their application to traffic operations and management, strategic, tactical, and operational planning of transportation and logistics systems; performance analysis methods and system design and optimization; theories and analysis methods for network and spatial activity interaction, equilibrium and dynamics; economics of transportation system supply and evaluation; methodologies for analysis of transportation user behavior and the demand for transportation and logistics services. Transportation Science is international in scope, with editors from nations around the globe. The editorial board reflects the diverse interdisciplinary interests of the transportation science and logistics community, with members that hold primary affiliations in engineering (civil, industrial, and aeronautical), physics, economics, applied mathematics, and business.
期刊最新文献
CARMA: Fair and Efficient Bottleneck Congestion Management via Nontradable Karma Credits Genetic Algorithms with Neural Cost Predictor for Solving Hierarchical Vehicle Routing Problems On-Demand Meal Delivery: A Markov Model for Circulating Couriers Physics-Informed Machine Learning for Calibrating Macroscopic Traffic Flow Models Heatmap Design for Probabilistic Driver Repositioning in Crowdsourced Delivery
×
引用
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