CARSP: A Smart Parking System Based on Doubly Periodic Rolling Horizon Allocation Approach

Blind search for available parking space is accountable for most traffic congestion, accident, and pollution in cities, which severely impact people's life. Parking management based on an online smart parking system is practical to alleviate parking problems in which parking allocation is the core. However, existing researches are weak at satisfying allocation effect and speed simultaneously when solving large-scale dynamic parking allocation problem. To address this problem, we firstly construct an online “Collection-Allocation-Response” smart parking system (CARSP) to offer parking services to users and rent parking spaces from owners so as to obtain revenue for system managers. We then propose a novel Doubly Periodic Rolling Horizon allocation approach (DPRH) that circularly conduct allocation within a short period and reallocation within a long period. We formulate a narrow allocation model (without reallocation) and broad allocation model (with reallocation), both of which are binary integer programming models with the objective of maximizing system integrated benefit. We design seven performance metrics to evaluate the overall allocation effect and speed of CARSP based on DPRH. According to the three-day district-level instance in Beijing, CARSP based on DPRH performs excellently in balancing allocation effect and speed. This study is meaningful for constructing and optimizing an online smart parking system.
Author(s): Shangbin Ning [1,2]; Zhenyu Han [1]; Yang Yang [3,4]; Zhenzhou Yuan (corresponding author) [1,2]; Xianyu Wu [1,2] 1. Introduction With the swift development in urbanization and the great growth [...]