Optimal Parking Pricing in General Networks with Provision of Occupancy Information

This paper investigates the relations between dynamic parking prices and provision of parking information in a general parking network. Travelers are provided with the real-time occupancy and pricing information to make their parking choices. The authors first formulate the parking choices under the User Equilibrium (UE) conditions using the Variational Inequality (VI) approach. More importantly, the system optimal (SO) parking flow pattern and SO parking prices are also derived and solved efficiently using Linear Programming. Under SO, any two parking lots cannot be used at the same time by travelers between more than one O-D pairs. The SO parking flow pattern is not unique, which offers sufficient flexibility for operators to achieve different management objectives while keeping the flow pattern optimal. The authors show that any optimal flow pattern can be achieved by lot-based parking pricing schemes that only depend on the time or real-time occupancy. The authors finally solve both UE and SO in two numerical examples. The best system performance is usually achieved by the parking prices such that the more preferred (convenient) lot should be used fully up to a certain terminal occupancy of around 85%-95%. This essentially balances the parking congestion (namely cruising time) and the convenience of preferred lots. The authors also obtain the SO prices from the SO solution set, to produce constant arrival rates to each lot. This could mitigate the potential roadway congestion and queuing comparing to intensive arrival rates.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01490302
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Aug 14 2013 1:17PM