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

Takashi Akamatsu, Kentaro Wada

Research output: Contribution to journalArticlepeer-review

39 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)178-195
Number of pages18
JournalTransportation Research Part C: Emerging Technologies
Volume79
DOIs
Publication statusPublished - 2017 Jun 1

Keywords

  • Bottleneck congestion
  • Dynamic traffic assignment
  • ITS
  • Time-space network
  • Tradable permit

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Automotive Engineering
  • Transportation
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Tradable network permits: A new scheme for the most efficient use of network capacity'. Together they form a unique fingerprint.

Cite this