pith. sign in

arxiv: 1507.03504 · v1 · pith:3HBPSLVTnew · submitted 2015-07-13 · 🧮 math.OC

A Fair Assignment of Drivers to Parking Lots

classification 🧮 math.OC
keywords parkingassignmentdriversspotsystemfairlotstime
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.