| Popis: |
Cities suffer from high traffic congestion of which one of the main causes is the unorganized pursuit of available parking. We consider a general parking allocation scenario, in which the GPS data of a set of vehicles, such as current location and destination are available to a central agency, which will guide the vehicles toward a designated parking lot, instead to the entered destination. In its natural form, the parking allocation problem is dynamic, i.e., its input is continuously updated. Therefore, standard static allocation, assignment, problems do not apply. In this paper, we solve several parking allocation policies through a 0-1 mathematical programming model with various degrees of dynamism. The proposed policies are empirically compared based on real data gathered from three European cities: Belgrade, Luxembourg, and Lyon |
