In order to make it easier for drivers to find a parking slot

optimize the resources of urban parking slots

and alleviate the problem of parking slot shortage

a distributed parking allocation algorithm is proposed. The algorithm collects the parking requests of user

including current position coordinate information of the users and destination coordinate information

according to available state of parking slot near destination

the parking route planning is returned to the client. Compared with the traditional algorithm

the distributed parking algorithm has a higher ability to withstand pressure and global search capability

and it can ensure the real-time and validity of the parking information

so as to reduce the problem of the parking slot shortage and unavailable parking slot. The simulation results show that this algorithm can find the solution set more quickly and accurately under the circumstance of high demand

it also have application value and practicality.