| description abstract | This study investigates the efficiency of parking permits in managing morning commuting considering carpooling with parking restraint. First, the morning commuting problem was revisited with and without parking restraint using bimode and multimode one-to-one networks. Parking ending time and its inverse function were formulated through analysis of morning commuting in a multimode single origin–destination (OD) pair. Second, the traffic pattern with two parking permit management policies was also evaluated. Third, the traffic pattern in a many-to-one network with carpooling behavior was investigated, and a method to compute equilibrium with parking restraint was proposed. Fourth, schemes of optimal parking permit allocation and tradable parking permits were applied to diminish the externality caused by competition. Finally, examples have been discussed, revealing the effectiveness of the policies of parking permit management in reducing the system cost by eliminating competition. In addition, the system cost in the scheme of parking permit distribution was greater than that in the scheme of tradable parking permits. This is because the scheme of tradable parking permits encourages more commuters to choose to carpool than does the policy of parking permit distribution. | |
