An Allocation Model of Shared Parking with Continuous Time Windows

Shared parking is one of effective solutions to alleviate urban parking problems. This paper studies the problem of shared parking space allocation. An integer programming model based on global information is established. The model especially improves discrete time windows into continuous time windows, which is closer to practical situation and is more precise. The allocation scheme of shared parking is obtained by solving the model using commercial solver. The proposed model is verified to be better than the frequently used first-come-first-serve and first-book-first-serve strategies through numerical simulations.