Modelling and comparing two modes of sharing parking spots at residential area: Real‐time and fixed‐time allocation

Abstract

Abstract This research aims to improve the utilization efficiency of parking facilities in residential areas. The real‐time and fixed‐time shared parking spot allocation models based on a time window constraint are proposed, respectively. The real‐time model adopts the dynamic response service mechanism, introducing a multi‐objective decision weighting method to construct the weighted evaluation function. Then, the 0–1 planning model with user optimization is established, utilizing branch‐bound algorithm for a solution. The fixed‐time model adopts the periodic service mechanism, where a rejection penalty factor is introduced to add penalty cost. Then, the 0–1 programming model with system optimization is constructed, where genetic annealing algorithm solves the large‐scale calculation problem. The results from this case study illustrate the fixed‐time allocation mode has more balanced utilization of parking facilities, whereas over‐utilization of preferred parking lots occurs in the real‐time model; additionally, when supply and demand are in balance, the fixed‐time model can obtain higher system revenues, reduce effective rejection rate by 9.43%, and increase resource utilization efficiency by 5.28%. In conclusion, the real‐time allocation mode reflects the advantage of a user's optimal allocation mode when supply is greater than demand; conversely, the fixed‐time allocation mode has the advantage of optimum system resources utilization efficiency.

Keywords

• 0–1 planning model
• fixed‐time parking spot allocation
• real‐time parking spot allocation
• shared parking
• time window constraint
• urban traffic