| With the rapid development of my country’s economy,the number of cars in the city is also increasing,but the development of parking space supply capacity cannot match it,resulting in a large gap in parking spaces,and the problem of "difficult parking" has become increasingly prominent.The unbalanced allocation of parking resources and the low utilization rate of parking resources are important reasons for aggravating the problem of parking difficulties.Therefore,under the current stock parking resources,it is necessary to design a shared parking platform and scheduling strategy that can efficiently utilize idle parking spaces and balance the parking resources among various areas.In the process of implementing the shared parking scheduling strategy,there are the following two core problems to be solved:the first is how to make the parking resources in the vehicle alliance get a balanced distribution.In this project,a shared parking scheduling algorithm based on ADMM is designed,and its effectiveness is verified by control experiments.According to the multi-factor influence model,the algorithm constructs a cooperative matching scheduling model according to different weight ratios,so that in the process of parking space scheduling and allocation,the parking cost of users is minimized,and the parking resources in each area are balanced.The maximization of the total revenue of the vehicle alliance.The second is that due to the tidal periodicity of shared parking,how to ensure the rapid response of the scheduling module is very important in the face of massive requests during the parking peak period.This subject designed a graph coloring matching algorithm based on time window constraints,and verified its effectiveness through control experiments.The algorithm constructs a graph coloring matching model according to the spatiotemporal characteristics of the scheduling matching process and the fragmentation of the available time period,which reduces the search range of the scheduling strategy in the time window matching process and improves the response speed to user requests.In order to ensure that when the parking peak period comes,the system level of shared parking can still ensure the stability and availability of the service for the concurrent scheduling request pressure of high QPS.In this project,a shared parking system based on a distributed architecture is designed.Based on the docker container technology,the distributed database combined with the consistent hash algorithm and the peer to peer architecture are used to ensure the equalization of the request traffic.In the experimental evaluation stage,we verified the availability of the shared parking system by conducting black box tests on each microservice module,built a distributed test environment through the docker container,and selected Jmeter as the load simulation tool.The load performance test verifies the low latency and service stability of the shared parking system. |