Research On Double Auction Mechanism And Algorithm Design Of Shared Parking Service

With the rapid development of the Internet technology,shared parking service is becoming an important tool to relieve the parking pressure now.This article focuses on shared parking service and analyzes its developing difficulties in cities of our country,such as the price willingness of both suppliers and demanders,the income insurance of the service operators and the assignment of shared parking resources and so on.As the feasibility of using double auction mechanism to assign shared parking resources is considered,this paper sets goals to explore a feasible mode of shared parking,to establish a double auction mechanism of shared parking with the consideration of several factors and to make a reasonable and effective way in distribution of benefits,and then conducts the research on the basis of these goals above.First of all,after summarizing research status in shared parking service,intelligent parking system and parking resources assignment,the defects of shared parking service in existing slots assignment mechanism,operating mode and distribution of benefits are discovered.To make up for the disadvantages above,the main goal to build a shared parking double auction mechanism is established.Secondly,the basement,problems and settlements of existing shared parking services are analyzed,the “double auction + appointment” mode of shared parking service which is based on the Internet platform is put forward combining the consideration that double auction mechanism is suitable to the assignment of shared parking resources.Comparing to the existing shared parking application,this mode allows both suppliers and demanders making price decision in auction activity and users are able to make appointment without waiting in reservation period.Take factors like price willingness of both suppliers and demanders,the location requirement and using time requirement into considerations,this paper establishes shared parking double auction mechanism respectively with and without aiming strict price order requirement,and relevantly designs an algorithm,which contains four modules like location matching module,range of time matching module,system income determining module and income assignment module,to solve matching problems between supplying slot units and demanding slot units and to solve the distribution of benefits.At last,this paper uses an example and solves it to prove the rationality of the designed mechanism and algorithm.With comparison between the mechanism in the article and the existing shared parking mode using appointment with fixed prices,it's found that the former is available to improve earnings of both the system and the platform operator while the latter is just conducive to enhance demander's individual benefits.After summarizing the characteristics of both,some suggestions on the implement of shared parking service using double auction mechanism are raised,which is according to the influences that two modes bring on relevant groups.Not only does the consideration of price willingness,location factor and time factor in mechanism designing cover the shortage that available research is lack of considerations of overall essential factors in shared parking supply and demand,simultaneously give some theoretical support to city using double auction mechanism to develop shared parking service,but also provide a reference on developing a shared parking mode which is suitable for cities in our country finally.