A Fair Assignment of Drivers to Parking Lots

TL;DR

This paper proposes a fair parking assignment system that allocates parking spots based on drivers' destinations and times, reducing search time and fuel consumption, using heuristics for large-scale optimization demonstrated on real data.

Contribution

It introduces a novel parking assignment system with heuristics for fair and efficient allocation, addressing large-scale real-world problems.

Findings

Heuristics effectively solve large-scale parking assignment problems.

The system reduces driver search time and fuel consumption.

Algorithms perform well on real data sets.

Abstract

Searching for a parking spot can waste time and gasoline. This waste can be reduced by assigning drivers to parking lots based on their destination and arrival time. In such a system, drivers could request a parking spot in advance and be alerted (e.g., via their phone or vehicle) of their assignment to a specific parking lot or available spot. In this paper, a parking assignment system is described to allocate parking spaces in a fair and equitable manner. Heuristics are developed to solve the underlying large scale optimization problem. The efficacy of the system is demonstrated by applying our algorithms to real data sets.