Research on Multi-objective Shared Parking Matching Decision Based on Two-side Matching

Abstract The purpose of this paper is to find a reasonable method for matching shared parking spaces. The travelers and the parking space sharing party are regarded as two separate subjects, and the matching of parking spaces is regarded as a two-side matching. The final parking space matching result belongs to the stable matching of the bipartite graph and the existence of Nash equilibrium is proved by the knowledge of graph theory. A multi-objective decision-making model for shared parking space matching based on two-side matching is established on the basis of considering the benefits of travelers and parking providers. The multi-objective model is transformed into a single-objective assignment model using weighting coefficients with adjustment parameters, and the corresponding solution algorithm is designed. Finally, an example is used to verify the rationality and feasibility of the established model. The results show that the parking space matching problem under sharing conditions belongs to the category of two-side matching. When the benefits of both parties are fully considered, the matching results obtained are relatively stable.