@article{84fe49d5632c4d4ba7970ba4dd7632e9,
title = "Approximation Method for Estimating Search Times for On-Street Parking",
abstract = "We propose an approximation method for estimating the probability p(τ, n) of searching for on-street parking longer than time τ from the start of a parking search near a given destination n based on high-resolution maps of parking demand and supply in a city. We verify the method by comparing its outcomes to the estimates obtained with an agent-based simulation model of on-street parking search. As a practical example, we construct maps of cruising time for the Israeli city of Bat Yam and demonstrate that, despite the low overall demand-to-supply ratio of 0.65, excessive demand in the city center results in a significant share of parking searches that last longer than 5 or even 10 minutes. We discuss the application of the proposed approach for urban planning.",
keywords = "Agent-based modeling, Parking management, Parking search, Serious games, Spatially explicit modeling",
author = "Nir Fulman and Itzhak Benenson",
note = "Publisher Copyright: {\textcopyright} 2021 INFORMS",
year = "2021",
doi = "10.1287/trsc.2021.1067",
language = "אנגלית",
volume = "55",
pages = "1046--1069",
journal = "Transportation Science",
issn = "0041-1655",
publisher = "INFORMS Institute for Operations Research and the Management Sciences",
number = "5",
}
