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

被引:63
|
作者
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
相关论文
共 50 条
  • [41] Target Capacity Based Power Allocation Scheme in Radar Network
    Dai Jinhui
    Yan Junkun
    Wang Penghui
    Liu Hongwei
    JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2021, 43 (09) : 2688 - 2694
  • [42] Efficient edge rewiring strategies for enhancement in network capacity
    Kumari, Suchi
    Saroha, Abhishek
    Singh, Anurag
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 545
  • [43] Efficient Capacity Constrained Assignment for Dynamic Network Coverage
    Ao, Eerdemotai
    Xin, Shiqing
    Li, Feng
    Tu, Changhe
    Wang, Wenping
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2024, 23 (05) : 5111 - 5129
  • [44] OPTIMAL NETWORK CAPACITY PLANNING - SHORTEST-PATH SCHEME
    DOULLIEZ, PJ
    RAO, MR
    OPERATIONS RESEARCH, 1975, 23 (04) : 810 - 818
  • [45] An Assessment Scheme for Road Network Capacity under Demand Uncertainty
    Ge, Zhongzhi
    Du, Muqing
    Zhou, Jiankun
    Jiang, Xiaowei
    Shan, Xiaonian
    Zhao, Xing
    APPLIED SCIENCES-BASEL, 2023, 13 (13):
  • [46] A New Scheme for Accounting Based on Vector Network
    Wang, Xue-fen
    Liang, Man-gui
    Zhang, Chao
    ICWMMN 08, PROCEEDINGS, 2008, : 131 - 134
  • [47] A New Graph Drawing Scheme for Social Network
    Wang, Eric Ke
    Zou, Futai
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [48] A NEW TELEPHONE NUMBERING SCHEME FOR THE FRENCH NETWORK
    COLLET, P
    FRAYSSE, D
    VASLIN, B
    ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS, 1987, 42 (7-8): : 416 - 424
  • [49] A new shared protection scheme in optical network
    Sahu, P. P.
    CURRENT SCIENCE, 2006, 91 (09): : 1176 - 1183
  • [50] New Scheme of Retransmission in MAC of Wireless Network
    Zhao Jian-ming
    Yao Nian-min
    Fang De-jian
    2009 INTERNATIONAL CONFERENCE ON NEW TRENDS IN INFORMATION AND SERVICE SCIENCE (NISS 2009), VOLS 1 AND 2, 2009, : 725 - +