Journal
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
Volume 79, Issue -, Pages 178-195Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trc.2017.03.009
Keywords
Bottleneck congestion; Dynamic traffic assignment; Time-space network; Tradable permit; ITS
Categories
Funding
- JSPS [18656142]
- ISSR (Institute of Systems Science Research) Kometani-Sasaki Research Grant
- Grants-in-Aid for Scientific Research [25249070, 16H02368, 18656142, 15H04053, 17H03320] Funding Source: KAKEN
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available