Managing rush hour travel choices with tradable credit scheme
详细信息 查看全文
- 作者：Yu (Marco) Niea ; y-nie@northwestern.edu ; Yafeng Yinb
- 关键词：Mobility credits ; Tradable credits scheme ; System optimal ; Peak time window ; Rush hour traffic
- 刊名：Transportation Research Part B: Methodological
- 出版年：2013
- 出版时间：April, 2013
- 年：2013
- 卷：50
- 期：Complete
- 页码：1-19
- 全文大小：960 K
文摘
This paper Analyzes a new tradable credit scheme (TCS) for managing commuters¡¯ travel choices, which seeks to persuade commuters to spread evenly within the rush hour and between primary and alternative routes so that excessive traffic congestion can be alleviated. The scheme defines a peak time window and charges those who use the primary route within that window in the form of mobility credits. Those who avoid the peak-time window, by either traveling outside the peak time window or switching to the alternative route, may be rewarded credits. A market is created such that those who need to pay credits can purchase them from those who acquire them from their rewarding travel choices. A general analytical framework is proposed for a system of two parallel routes. The framework (1) considers a variety of assumptions about commuters¡¯ behavior in response to the discontinuous credit charge introduced at the boundary of the peak-time window, (2) allows modeling congestion effects (or demand elasticity) on the alternative route, and (3) enables both the design of system optimal TCS and the analysis of the efficiency of any given TCS. Our analyses indicate that the proposed TCS not only achieves up to 33 % efficiency gains in the base scenario, but also distributes the benefits among all the commuters directly through the credit trading. The results also suggest that very simple TCS schemes could provide substantial efficiency gains for a wide range of scenarios. Such simplicity and robustness are important to practicability of the proposed scheme. Numerical experiments are conducted to examine the sensitivity of TCS designs to various system parameters.