SCP-Tree: Finding Multiple Nearest Parking Spots with Minimal Group Travel Cost

Finding the nearest parking location in road networks is one of the most commonly faced challenges in everyday life of green transportation. A main challenge faced by the state-of-The-Art existing parking allocation methods is to optimally offer the nearest parking location for a group of m users at the cost of minimal overall traveling time to ensure the traffic and environmental sustainability. In this article, we model it as a Multiple Nearest Parking Location Allocation (MNPLA) problem, and devise a spatial index tree, called SCP-Tree, to accelerate the nearest parking location allocation within the users' time constraints. During the search process in SCP-Tree, we build a pruning strategy relevant to the Geographical Preference Estimation, travel time and parking capacity to determine which branch to visit so that the search accuracy can be improved. Considering the users' behaviors are often impacted by the geographical location and some personalized attribute information, we set the user priority based on them to help the parking officer determine the allocation sequence. We evaluate our allocation scheme using large real-world dataset with on-street parking sensor data, and extensive experimental results reveal (i) a minimum improvement of 15.9%, 1.4%, 96.9%, 160% in parking allocation time, average traveling time, I/O cost and service utility compared to the progressive methods, and (ii) a minimum improvement of 8.9%, 11.1%, 78.2%, 714% in parking allocation time, average traveling time, I/O cost and service utility compared to the baseline methods.