In the study of driver behavior, scientists were able to calculate an algorithm in which parking can be as efficient as possible. To build such an optimal option, the researchers used the techniques of the “Queen of Sciences” – mathematics.
A key condition was introduced at the core of the parking algorithm. The best parking spot was named that reduces the time spent in the parking lot. To reduce it, the driver needs to provide several factors when checking into the parking lot: the time to spend walking on the parking lot, as well as the workload of the “extreme places” and the need to wait for other road users to leave the exit.
The probability of the distribution of seats between parked cars
Researchers have identified three simple strategies for parking a vehicle in an idealized single-row parking lot, that is, one that you can call in only on one side and leave exclusively on the opposite side.
- The “Short Strategy” provides for the driver to take the first available seat. So the owner of the vehicle tries not to waste time searching for a parking place, but at the same time leaves empty places near the exit.
- An “optimistic” strategy involves finding a free seat at the exit, and in the absence of one, make a U-turn and return to the nearest free one.
- A “prudent” strategy involves choosing a middle path. Having traveled to the first free place, the person moves on in the hope of finding another empty parking place closer to the exit. In the absence of such, he acts on a "short" strategy.
Having compiled a differential equation, scientists decided to calculate the most effective strategy for determining a parking space. After creating the computer model, it became clear that the best tactic for parking is “prudent.” It is it that allows you to spend less time and effectively find such an important place for parking a car.