Optimal dynamic parking pricing for morning commute considering expected cruising time

This paper investigates how recurrent parking demand can be managed by dynamic parking pricing and information provision in the morning commute. Travelers are aware of time-varying pricing information and time-varying expected occupancy, through either their day-to-day experience or online information provision, to make their recurrent parking choices. We 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 clusters cannot be used at the same time by travelers between more than one Origin–Destination (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. We show that any optimal flow pattern can be achieved by charging parking prices in each area that only depend on the time or occupancy, regardless of origins and destinations of users of this area. In the two numerical experiments, the best system performance is usually achieved by pricing the more preferred (convenient) area such that it is used up to a terminal occupancy of around 85–95%. Optimal pricing essentially balances the parking congestion (namely cruising time) and the level of convenience.