01779046

Component

https://doi.org/10.1177/03611981211031223

In downtown areas of large cities, it is very challenging for drivers to find available parking spots, even when they are provided with information on parking availability and location information. To overcome this challenge, this paper develops a dynamic vehicle routing system to search for the optimal routes for connected vehicles to find parking spots successfully and to minimize total trip time, including driving time and walking time. The system predicts the probability of each parking lot having available parking spots based on the existing available number of spots and the vehicle arrival and departure rates collected by connected vehicles. This probability is integrated in the search for vehicle routes to minimize total travel and walking times. Numerical experiments indicate that the proposed system can reduce the cruising time spent searching for available parking spots, and the total trip time can be reduced by up to 24%. In addition, the system can decrease the number of re-routing decisions, which reduces the stress of drivers on the road. A sensitivity analysis of the parking probability is also conducted. Some future work based on the proposed system is proposed in the conclusion to this paper.

Hao Yang https://orcid.org/0000-0003-0814-6058 © National Academy of Sciences: Transportation Research Board 2021.

English

0000-0003-0814-6058

0000-0001-9724-6434

pp 186-192

2021-11

Transportation Research Record: Journal of the Transportation Research Board

Web

References (17)

Advanced driver information systems; Connected vehicles; Large cities; Parking guidance systems; Travel time; Walking distance

Highways; Operations and Traffic Management

TRIS, TRB, ATRI

Aug 12 2021 3:17PM