01518436

Component

https://doi.org/10.3141/2467-08

A substantial amount of urban traffic is related to drivers searching for parking. This study developed an online stochastic shortest path model to represent the parking search process in which drivers must choose whether to park at an available space or continue searching for a space closer to their destination. Existing online shortest path algorithms had been formulated for the full-reset or no-reset assumptions on revisiting links. As described in this paper, neither assumption was fully suitable for the parking search process. Accordingly, this paper proposes an asymptotic reset model that generalizes the full-reset and no-reset cases and uses the concept of reset rate to characterize the temporal dependence of parking probabilities on earlier observations. In this model, drivers try to minimize their expected travel cost, which includes the driving cost and the cost of walking from a parking spot to the actual destination conditioned on the parking availability on m most recently traversed links. The problem was formulated as a Markov decision process and was demonstrated with a network representing the neighborhood of the University of Wyoming campus in Laramie. The case study successfully shows the extra time used by drivers to cruise for an acceptable parking space and illustrates the impact of m on the computation effort required to compute an optimal policy.

01559856

14-5413

English

pp 73–79

2014

Transportation Research Record: Journal of the Transportation Research Board

9780309295611

Print

Figures (4) ; References (28) ; Tables (2)

Campus parking; Campuses; Drivers; Markov processes; Networks; Parking; Shortest path algorithms; Time dependence; Travel costs

University of Wyoming

Highways; Operations and Traffic Management; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Jan 27 2014 3:54PM

• Algorithm for Determining Path of Maximum Reliability on a Network Subject to Random Arc Connectivity Failures
• Complex Network Method of Evaluating Resilience in Surface Transportation Networks
• Equilibrium Analysis of Low-Conflict Network Designs
• Evaluation of a Strategic Road Pricing Scheme Accounting for Day-to-Day and Long-Term Demand Uncertainty
• How Many Runs? Analytical Method for Optimal Scenario Sampling to Estimate Travel Time Variance in Traffic Networks
• Integrated Planning of Tourism Investment and Transportation Network Design
• Modeling Transit and Intermodal Tours in a Dynamic Multimodal Network
• Optimal Bus Lane Infrastructure Design
• Optimizing Ridesharing Services for Airport Access
• Reducing Carbon Emissions with Multitrip Vehicle Mode
• Rollback Approach for Demand Consistency Checking of Real-Time Traffic Network State Estimation Models
• Sample-Based Algorithm to Determine Minimum Robust Cost Path with Correlated Link Travel Times
• Service Reliability–Based Transit Network Design with Stochastic Demand
• Short-Term Freeway Speed Profiling Based on Longitudinal Spatiotemporal Dynamics
• Simulation-Based Method for Finding Minimum Travel Time Budget Paths in Stochastic Networks with Correlated Link Times
• Urban Traffic State Explained by Road Networks and Spatial Variance: Approach Using Floating Car Data