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

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.

[1]  W. Vickrey.  Congestion Theory and Transport Investment , 1969 .

[2]  Yafeng Yin,et al.  Managing rush hour travel choices with tradable credit scheme , 2013 .

[3]  H. Mohring,et al.  Highway Benefits: An Analytical Framework , 2012 .

[4]  W. Vickrey,et al.  Congestion Theory and Transportation Investment , 1969 .

[5]  Yu Nie,et al.  Transaction costs and tradable mobility credits , 2012 .

[6]  Masahisa Fujita,et al.  Urban Economic Theory: Land Use and City Size , 1989 .

[7]  Paul Milgrom,et al.  Putting Auction Theory to Work , 2004 .

[8]  Hai Yang,et al.  Managing network mobility with tradable credits , 2011 .

[9]  Kenneth A. Small,et al.  Optimal Peak-Load Pricing, Investment, and Service Levels on Urban Expressways , 1977, Journal of Political Economy.

[10]  Michael J. Smith,et al.  The Existence of a Time-Dependent Equilibrium Distribution of Arrivals at a Single Bottleneck , 1984, Transp. Sci..

[11]  Pengfei Wang,et al.  Trading mechanisms for bottleneck permits with multiple purchase opportunities , 2018, Transportation Research Part C: Emerging Technologies.

[12]  Masahisa Fujita.  Urban Economic Theory , 1989 .

[13]  Dušan Teodorović,et al.  Highway Space Inventory Control System , 2005 .

[14]  Tom Tietenberg,et al.  Transferable discharge permits and the control of stationary source air pollution: a survey and synthesis , 1980 .

[15]  Hai Yang,et al.  TRIAL-AND-ERROR IMPLEMENTATION OF MARGINAL-COST PRICING ON NETWORKS IN THE ABSENCE OF DEMAND FUNCTIONS , 2004 .

[16]  Masao Kuwahara,et al.  DYNAMIC EQUILIBRIUM ASSIGNMENT WITH QUEUES FOR A ONE-TO-MANY OD PATTERN. , 1993 .

[17]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[18]  Jean-Jacques Laffont.  More on Prices vs. Quantities: Erratum , 1978 .

[19]  Kentaro Wada,et al.  A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control ☆☆ , 2013 .

[20]  William H. Sandholm,et al.  Evolutionary Implementation and Congestion Pricing , 2002 .

[21]  Masao Kuwahara.  A theory and implications on dynamic marginal cost , 2007 .

[22]  Peter Nijkamp,et al.  Tradeable Permits: Their Potential in the Regulation of Road Transport Externalities , 1997 .

[23]  Athanasios K. Ziliaskopoulos,et al.  A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem , 2000, Transp. Sci..

[24]  Hirokazu AKAHANE,et al.  A BASIC STUDY ON TRIP RESERVATION SYSTEMS FOR RECREATIONAL TRIPS ON MOTORWAYS , 1996 .

[25]  Kentaro Wada,et al.  DTA2012 Symposium: Distributed Signal Control Based on Tradable Network Permits: Design and Evolutionary Implementation , 2012 .

[26]  Takashi Akamatsu,et al.  TRADABLE TIME-OF-DAY BOTTLENECK PERMITS FOR MORNING COMMUTERS , 2006 .

[27]  Carlos F. Daganzo,et al.  The Uniqueness of a Time-dependent Equilibrium Distribution of Arrivals at a Single Bottleneck , 1985, Transp. Sci..

[28]  Susan Grant-Muller,et al.  The Role of Tradable Credit Schemes in Road Traffic Congestion Management , 2014 .

[29]  W. Montgomery,et al.  Markets in Licenses and Efficient Pollution Control Programs" Journal of Economic Theory , 1972 .

[30]  Takashi Akamatsu.  An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues , 2001, Transp. Sci..

[31]  Yoav Shoham,et al.  Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.

[32]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[33]  Yu Nie.  A Cell-based Merchant-Nemhauser Model for the System Optimum Dynamic Traffic Assignment Problem , 2010 .

[34]  和田 健太郎.  Distributed and dynamic traffic congestion controls without requiring demand forecasting : tradable network permits and its implementation mechanisms , 2013 .

[35]  Yafeng Yin,et al.  Tradable Credit Scheme to Control Bottleneck Queue Length , 2016 .

[36]  Hai Yang,et al.  Efficiency of a highway use reservation system for morning commute , 2015 .

[37]  Kentaro Wada,et al.  The corridor problem with discrete multiple bottlenecks , 2015 .

[38]  Nathan H. Gartner,et al.  Optimal traffic assignment with elastic demands: A Review , 1980 .

[39]  Shokooh Khajavi,et al.  OPTIMAL PEAK-LOAD PRICING, INVESTMENT, AND SERVICE LEVELS ON URBAN STREETS--A NUMERICAL EXAMPLE , 1981 .

[40]  Hai Yang,et al.  HIGHWAY PRICING AND CAPACITY CHOICE IN A ROAD NETWORK UNDER A BUILD-OPERATE-TRANSFER SCHEME , 2000 .

[41]  Hai Yang,et al.  Congestion pricing in the absence of demand functions , 2009 .

[42]  Satish V. Ukkusuri,et al.  On the existence of pricing strategies in the discrete time heterogeneous single bottleneck model , 2011 .

[43]  R. Arnott,et al.  Financing Capacity in the Bottleneck Model , 1995 .

[44]  William H. Sandholm,et al.  Pigouvian pricing and stochastic evolutionary implementation , 2007, J. Econ. Theory.

[45]  A. Palma,et al.  A STRUCTURAL MODEL OF PEAK-PERIOD CONGESTION: A TRAFFIC BOTTLENECK WITH ELASTIC DEMAND. IN: RECENT DEVELOPMENTS IN TRANSPORT ECONOMICS , 1993 .

[46]  F. シャオ,et al.  Managing bottleneck congestion with tradable credits , 2014 .

[47]  Hai Yang,et al.  Tradable credit schemes for managing bottleneck congestion and modal split with heterogeneous users , 2013 .

[48]  Hai Yang,et al.  A novel permit scheme for managing parking competition and bottleneck congestion , 2014 .

[49]  Kentaro Wada,et al.  AN E-MARKET MECHANISM FOR IMPLEMENTING TRADABLE BOTTLENECK PERMITS , 2010 .

[50]  Marvin Kraus,et al.  Self-Financing of Congestible Facilities in a Growing Economy , 1995 .

[51]  Takashi Akamatsu,et al.  Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks , 2003, Transp. Sci..

[52]  A. Palma,et al.  Economics of a bottleneck , 1986 .

[53]  Masao Kuwahara.  Equilibrium Queueing Patterns at a Two-Tandem Bottleneck during the Morning Peak , 1990, Transp. Sci..

[54]  Kentaro Wada,et al.  Convergence of Day-to-Day Traffic Flow Dynamics Under Tradable Bottleneck Permits , 2008 .

[55]  Wenbo Fan,et al.  Tradable mobility permits in roadway capacity allocation: Review and appraisal , 2013 .

[56]  Ennio Cascetta,et al.  Transportation Systems Engineering: Theory and Methods , 2001 .

[57]  Jinn-Tsai Wong,et al.  Basic concepts for a system for advance booking for highway use , 1997 .

[58]  Malachy Carey,et al.  Externalities, Average and Marginal Costs, and Tolls on Congested Networks with Time-Varying Flows , 1993, Oper. Res..

[59]  Kentaro Wada,et al.  A Hybrid Implementation Mechanism of Tradable Network Permits System Which Obviates Path Enumeration: An Auction Mechanism with Day-to-day Capacity Control , 2013 .

[60]  M. Weitzman.  Prices vs. Quantities , 1974 .

[61]  Hai Yang,et al.  Departure time, route choice and congestion toll in a queuing network with elastic demand , 1998 .

[62]  Masao Kuwahara,et al.  DYNAMIC USER EQUILIBRIUM ASSIGNMENT ON OVERSATURATED ROAD NETWORKS , 1994 .