Tradable network permits: A new scheme for the most efficient use of network capacity

被引:64
作者
Akamatsu, Takashi [1 ]
Wada, Kentaro [2 ]
机构
[1] Tohoku Univ, Grad Sch Informat Sci, Aoba Ku, Aramaki Aoba 6-3-09, Sendai, Miyagi 9808579, Japan
[2] Univ Tokyo, Inst Ind Sci, Meguro Ku, Komaba 4-6-1, Tokyo 1538505, Japan
关键词
Bottleneck congestion; Dynamic traffic assignment; Time-space network; Tradable permit; ITS; DEPENDENT EQUILIBRIUM DISTRIBUTION; TRAFFIC ASSIGNMENT; CONGESTION; BOTTLENECK; TIME; IMPLEMENTATION; SYSTEM; EXISTENCE; POLLUTION; ARRIVALS;
D O I
10.1016/j.trc.2017.03.009
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Akamatsu et al. (2006) proposed a new transportation demand management scheme called "tradable bottleneck permits" (TBP), and proved its efficiency properties for a single bottleneck model. This paper explores the properties of a TBP system for general networks. An equilibrium model is first constructed to describe the states under the TBP system with a single OD pair. It is proved that equilibrium resource allocation is efficient in the sense that the total transportation cost in a network is minimized. It is also shown that the "self-financing principle" holds for the TBP system. Furthermore, theoretical relationships between TBP and congestion pricing (CP) are discussed. It is demonstrated that TBP has definite advantages over CP when demand information is not perfect, whereas both TBP and CP are equivalent for the perfect information case. Finally, it is shown that the efficiency result also holds for more general demand conditions. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:178 / 195
页数:18
相关论文
共 61 条