In a multidestination multiple parking lot system, multiple parking lots are available near a destination, and multiple destinations can be served by the same parking lot. The allocation of the parking demand of each destination to each parking lot is called the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">parking allocation problem</i> . The factors that affect the driver’s parking choice are analyzed, including parking fees, parking space search time, and walking time. Considering the dynamic parking demand and drivers’ probabilistic choice of each parking lot and that the parking amount allocation during each time period must meet the capacity constraints of each parking lot, an equivalent mathematical programming model was established. The solution algorithm for the proposed model was proposed. A numerical example verified the proposed model, and the influences of dynamic parking charge on drivers’ parking choice and the balance of utilization among different parking lots were discussed. The proposed model can provide a basis for parking facility location optimization and dynamic parking pricing strategy.
Read full abstract