DYNAMIC PARKING FACILITY LOCATION WITH TIME- DEPENDENT DEMANDS: THE PROGRESSIVE P-MEDIAN PROBLEM

A model of dynamic parking facility location is proposed in this research. A dynamic p-median problem of parking facility is considered. One important characteristic of this study is that the parking demand predicted in our model is changing over a given time horizon, i.e., the demand is time dependent. Besides, the parking facilities are built one at a time at given times. Once a new facility is built, some of the drivers (customers) will use its services and some of them will patronize an existing facility. At any given time, drivers patronize the closest parking facility under enough capacity. The problem is to find the best parking facility location for the new facilities. The problem is formulated and the potential algorithm is proposed for this present time. However, a standard mathematical programming code AMPL (A Modeling Language for Mathematical Programming) is adopted here to solving our formulated problem.