| With the rapid development of the social economy and the rapid increase of the number of cars,the difficulty of parking is very common in most cities,which seriously restricts the development of the social economy and people’s normal travel and daily life.Problems such as the shortage of parking spaces and the imbalance in the optimal allocation of parking resources are the crux of the parking problem.As an effective measure to alleviate the parking pressure and solve the parking problem,the shared parking is welcomed and concerned by person.Therefore,the research on the problem of shared parking has strong theoretical and practical significance.The existing research mainly focuses on the prediction of shared parking demand,the distribution and pricing of shared parking spaces,and the distribution of revenue,but there are still some deficiencies.Therefore,the dissertation will combine the characteristics of shared parking problem,two-sided matching theory is used to study multiple attributes,risk aversion,ambiguity and information.The research contents are as follows:(1)Based on the investigation of the supply and demand data of parking in hospitals,residential areas,enterprises and institutions,the dissertation analyzes the parking laws and parking space sharing conditions.A questionnaire survey was conducted to investigate the residents’ parking choice behavior,shared parking willingness and the core issues concerned by the participants.Combined with the current operation mode of the shared parking platform,the parking choice behavior and the shared parking travel process were studied under the shared parking condition.(2)Based on the basic knowledge of two-sided matching theory,the problem of two-sided matching for shared parking is analyzed.It is proved that there exists Nash equilibrium in the stable matching of the two-sided matching model of shared parking with using bipartite graph theory.The matching problem of single attribute and multi-attribute between traveler and shared parking is studied.The multi-attribute problem is transformed into a single-attribute problem by using the entropy weight method,and a multi-objective programming model is established,which considers the cost saving of the traveler and the sharers.The ideal point method is used to transform the multi-objective model into the single-objective model,and the Hungarian Algorithm is used to solve the model in different cases.In addition,the stability of the matching result and the payoff of the two parties are analyzed.(3)Consider the risk-averse attitude of travelers and sharers when they face profit or loss in the process of parking space matching.The respect theory is used to describe their risk-averse attitudes.The entropy weight method is introduced to transform the multi-attribute problem into a comprehensive attribute problem.Taking into account the fairness of the traveler and the sharer,a multi-objective optimization model for the matching decision of shared parking based on single-reference-point prospect theory and a multi-objective optimization model for the matching decision of shared parking spaces based on double-reference-point prospect theory are established respectively.At the same time,the model is solved by using NSGA-II Algorithm,and the changes of matching schemes under different target situations are analyzed.(4)Consider the uncertainty and ambiguity of the decision-making information between the traveler and the parking space-sharing in the process of the shared parking space matching.Firstly,based on the theory of intuitionistic Modulus,intuitionistic trapezoid modulus and number are used to describe the related property information.The relative entropy of different attributes to the maximum and minimum ideal points is calculated to judge the size of attribute information.A three-objective matching decision model of shared parking spaces is established,which takes into account the intuitionistic trapezoid and information to minimize the relative entropy of the traveler and the sharer and the difference between them,introduced the hesitancy and ambiguity theory to describe traveler and shared attribute information.By considering the hesitancy and the satisfaction of the information to reflect the size of the attribute information.At the same time,the regret theory is introduced to describe the risk-avoiding behavior under the hesitating environment,and a multi-objective decision-making model of shared parking matching based on the regret theory is established.An improved NSGA-II Algorithm is designed to solve the model,and the changes of matching schemes under different target situations are compared and analyzed.(5)Considers the influence of the strategy when the traveler,the parking space owner and the government participate in the shared parking on the matching result and the driving effect of the parking industry.In the dissertation,Evolutionary game theory method was used to model and analyze the evolutionary stability of the two-sided matching evolutionary game which only considers the participation of the traveler and the parking space owner,and the three-sided matching evolutionary game which only considers the participation of the government,the traveler and the parking space owner.The effects of different benefits,costs and strategies on shared parking are illustrated by simulation.In the dissertation,the matching problem of shared parking is studied in depth.The research results can lay a theoretical foundation for the study on the matching algorithm of shared parking,parking decision-making under different mental states and parking resource optimization.At the same time,it can provide technical support for the development of shared parking industry and the city parking management.Some reasonable suggestions and recommendations are given to promote the development of shared parking. |
