当前位置: X-MOL 学术arXiv.cs.GT › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Managing network congestion with tradable credit scheme: a trip-based MFD approach
arXiv - CS - Computer Science and Game Theory Pub Date : 2020-09-15 , DOI: arxiv-2009.06965
Renming Liu (1), Siyu Chen (2), Yu Jiang (1), Ravi Seshadri (3), Moshe E. Ben-Akiva (2), Carlos Lima Azevedo (1) ((1) DTU Management, Technical University of Denmark, Denmark, (2) CEE, Massachusetts Institute of Technology, United States, (3) Singapore-MIT Alliance for Research and Technology, Singapore)

This study investigates the efficiency and effectiveness of area-based tradable credit scheme (TCS) based on the trip-based Macroscopic Fundamental Diagram model for the morning commute problem. In the proposed tradable credit scheme, the regulator distributes initial credits to all travelers and designs a time-varying and trip length specific credit tariff. Credits are traded between travelers and the regulator, and the credit price is determined by the demand and supply of credits. The heterogeneity of travelers is considered in terms of desired arrival time, trip length and departure-time choice preferences. The TCS is incorporated into a day-to-day modelling framework to examine the travelers' learning process and the evolution of network and credit market properties. The existence of the equilibrium solution and the uniqueness of the credit price at equilibrium state are established analytically. Furthermore, a open-source simulation framework is developed to showcase the analytical properties of the proposed TCS and compare it with alternative control strategies in terms of mobility, network and social welfare performance. Bayesian optimization is then adopted to optimize the credit toll scheme. The numerical results demonstrate that the proposed TCS outperforms the no-control case and matches the performance of the time-of-day pricing strategy, while maintaining its revenue-neutral nature.

中文翻译:

使用可交易信用方案管理网络拥塞:基于行程的 MFD 方法

本研究基于基于出行的宏观基本图模型研究了基于区域的可交易信贷计划 (TCS) 的效率和有效性,用于解决早晨通勤问题。在提议的可交易信用计划中,监管机构将初始信用分配给所有旅行者,并设计随时间变化和旅行长度特定的信用关税。积分在旅行者和监管机构之间进行交易,积分价格由积分的供需决定。从期望到达时间、旅行长度和出发时间选择偏好方面考虑旅行者的异质性。TCS 被纳入日常建模框架,以检查旅行者的学习过程以及网络和信用市场属性的演变。分析建立了均衡解的存在性和均衡状态下信用价格的唯一性。此外,开发了一个开源模拟框架来展示所提出的 TCS 的分析特性,并将其与在移动性、网络和社会福利性能方面的替代控制策略进行比较。然后采用贝叶斯优化来优化信用收费方案。数值结果表明,所提出的 TCS 优于无控制情况,并与一天中的时间定价策略的性能相匹配,同时保持其收入中性的性质。开发了一个开源模拟框架来展示所提出的 TCS 的分析特性,并将其与在移动性、网络和社会福利性能方面的替代控制策略进行比较。然后采用贝叶斯优化来优化信用收费方案。数值结果表明,所提出的 TCS 优于无控制情况,并与一天中的时间定价策略的性能相匹配,同时保持其收入中性的性质。开发了一个开源模拟框架来展示所提出的 TCS 的分析特性,并将其与在移动性、网络和社会福利性能方面的替代控制策略进行比较。然后采用贝叶斯优化来优化信用收费方案。数值结果表明,所提出的 TCS 优于无控制情况,并与一天中的时间定价策略的性能相匹配,同时保持其收入中性的性质。
更新日期:2020-09-16
down
wechat
bug