01558132

Component

https://doi.org/10.3141/2498-12

This paper investigates an optimal parking pricing problem in a many-to-one (multiple origins to one destination) park-and-ride (P + R) network, taking into account practical parking space constraints. The proposed problem aims to minimize the total travel cost by setting optimal parking fees at P + R terminals. The problem is formulated as a bilevel programming model that comprises an upper-level problem of determining optimal parking fees and a lower-level problem of characterizing commuters’ travel equilibrium of departure time and path choices. For the lower-level problem, a user equilibrium model is developed to address the commuting patterns with and without parking space constraints in the many-to-one P + R network. In the commute equilibrium analysis, extra earlier departure times, defined by slack variables, are introduced to examine the conditions in which commuters need to compete for limited parking spots. Meanwhile, the parking spot ending time is used to describe how commuters from different origins compete with one another for the limited parking spots at the destination. Finally, numerical experiments show that the methods proposed in this study are effective in managing the P + R facilities.

01575261

15-3316

English

pp 99–108

2015

Transportation Research Record: Journal of the Transportation Research Board

9780309295758

Print

Figures (4) ; References (30)

Commuters; Optimization; Park and ride; Parking fees; Pricing; Travel costs

Bi-level programming; Capacity constraints

Operations and Traffic Management; Planning and Forecasting; Public Transportation; I73: Traffic Control

TRIS, TRB, ATRI

Dec 30 2014 1:06PM

• Dynamic Assignment-Simulation Methodology for Multimodal Urban Transit Networks
• Flow-Based and Density-Based Time-Dependent Demand Estimation for Congested Urban Transportation Networks
• Heuristic Approach to Capacitated Traffic Assignment Problem for Large-Scale Transport Networks
• Implications of Volatility in Day-to-Day Travel Flow and Road Capacity on Traffic Network Design Projects
• Integrated Frequency Allocation and User Assignment in Multimodal Transit Networks: Methodology and Application to Large-Scale Urban Systems
• Investigation of Centroid Connector Placement for Advanced Traffic Assignment Models with Added Network Detail
• Linear Dependence of User Equilibrium Routes in the Transportation Network
• Network Route Choice Model for Battery Electric Vehicle Drivers with Different Risk Attitudes
• Origin-Based Algorithms for Traffic Assignment: Algorithmic Structure, Complexity Analysis, and Convergence Performance
• Parking Reservation for Managing Downtown Curbside Parking
• Using Lagrangian Relaxation to Solve Ready Mixed Concrete Dispatching Problems