A shared parking space matching method, system, medium, device and terminal

Abstract

The present invention belongs to the technical field of shared parking spaces, and discloses a shared parking space matching method, system, medium, equipment and terminal, and designs a shared parking mode based on the coordination of internal parking spaces of owners; based on the known available time of the owner's parking space, the external parking driver reserves the parking space through the platform and provides the location and time of the parking demand, and according to the parking time of the owner and the external user, the owner's parking position is arranged in a parking space close to his own parking space to adjust the available time of each parking space; according to the available time of the parking space provided by the owner and the external demand, the parking time is reserved, and a 0-1 integer programming model is constructed to uniformly realize the matching of the owner and the external demand parking space. The present invention re-matches the parking space for the owner and meets more external parking needs by designing a shared parking mode based on the coordination of the owner's internal parking space, thereby increasing the income of the owner's shared parking space, improving the utilization rate of the parking space, and improving the occupancy rate of the shared parking space, thereby alleviating the parking problem.

Description

Technical Field

[0001] The present invention belongs to the technical field of shared parking spaces, and in particular, relates to a shared parking space matching method, system, medium, device and terminal. Background Art

[0002] At present, major cities in my country and even around the world are actively exploring solutions to the problem of difficult parking in cities. Among them, the staggered sharing of private parking spaces provides an effective solution to the problem of difficult parking in cities. With the rapid development of smart parking service platforms based on smartphones, large and medium-sized cities in my country have also launched private parking space sharing apps for community residents. These apps share idle private parking spaces of community residents with nearby drivers who have parking needs in different time periods, and obtain benefits according to a certain charging method. On the one hand, the staggered sharing of private parking spaces improves the utilization rate of parking spaces and alleviates the contradiction between urban parking supply and demand; at the same time, it also reduces the situation of vehicles occupying the road and parking randomly, and to a certain extent alleviates the pressure of urban static traffic.

[0003] However, shared parking currently faces two prominent problems in its actual implementation. First, due to the conflict between the available time periods of parking spaces provided by private parking space owners and the time periods used by drivers with parking needs, the supply of parking spaces and parking needs often cannot be fully matched, resulting in the practical problem of low supply and demand matching rate; secondly, because private parking space owners are worried that their parking spaces will be used overtime, resulting in their inability to park when they drive back, they are not willing to participate in shared parking, so there is a shortage of available parking space resources shared on the platform. The above two problems have seriously hindered the popularization and promotion of shared parking. Therefore, how to improve the matching success rate of shared parking spaces and parking needs in the operation of shared parking platforms, and reduce the risk of owners being unable to park themselves after sharing parking spaces, are key issues that need to be urgently addressed in the implementation of shared parking platforms.

[0004] In domestic and foreign research, a large number of literatures have conducted research on the technology of directly matching private parking spaces with external parking needs (referred to as: P2P shared parking technology). Researchers such as He Mengyuan (2020) and Jia Fuqiang (2021) proposed a "one-to-one" matching mathematical model and algorithm for matching a single parking space with a single parking demand; researchers such as Jiang (2020) and Yan (2021) proposed a "one-to-many" matching mathematical model and algorithm for matching a single parking space with multiple parking needs. In the practice of shared parking, the method of directly matching the private parking spaces of community owners with external parking needs has also been widely adopted, such as Beijing's Dingding Parking APP, Chengdu's Private Parking Space APP, and Guangzhou's Yue Parking APP.

[0005] However, the present invention first finds through simulation of shared parking in a community that under the existing P2P shared parking technology, the owner can only park the vehicle in his own parking space after returning to the parking lot, resulting in the shared available time of the parking space being strictly limited by the time when the owner leaves and returns to the parking space. As a result, it often cannot be fully matched with the time period when drivers with parking needs use the parking space, resulting in a low matching rate of shared parking supply and demand. Summary of the invention

[0006] In view of the problems existing in the existing shared parking technology, the present invention provides a new shared parking space matching method, system, medium, device and terminal based on first coordinating the internal parking spaces among owners and then uniformly sharing the parking spaces externally.

[0007] The present invention is implemented as follows: a novel shared parking space matching method, the shared parking space matching method includes: designing a shared parking mode based on the coordination of internal parking spaces of owners, the owner uploads the available time of the parking space through the platform, the external parking driver reserves the use time of the parking space through the platform, and according to the parking time of the owner and the external user, when the owner returns to the community parking lot, his parking position is assigned to the parking space of other owners close to his own parking space to increase the available time of the owner's own parking space; according to the available time of the parking space uploaded by the owner and the external demand, the parking time is reserved, and a 0-1 integer programming model is constructed. Under the premise of not affecting the parking demand of the owner, the external demand is maximized to achieve a unified match between the coordination of internal parking spaces of the community owners and the external parking demand.

[0008] Furthermore, the shared parking space matching method includes the following steps:

[0009] Step 1: Design a shared parking mode for owners to coordinate internal parking spaces;

[0010] Step 2: Build a unified internal and external parking space-demand matching model;

[0011] Furthermore, in step 1, assume that the set of community owners is N, and each owner has only one parking space. The shared parking period opened to the public in the community parking lot every day is [A, B]. Owner j is in a j Leave the parking space at any time and j Return at any moment (j∈N,a j ≥A,b j ≤B), the available time period of parking space j is (a j ,b j ). Under the mode of internal parking space coordination among owners, the restriction that owners can only park in their own parking spaces when returning to the community is broken, and parking spaces are rearranged when owners return to the parking lot, thereby increasing the available time period of owner j's parking space from (a j ,b j ) increases to (a j, B), but at the same time the platform needs to take owner j’s parking demand (b j ,B]∪[B,A+24h) is assigned to the available parking spaces of other owners in the community, where (B,A+24h) represents the time period when the community parking spaces are not shared with the outside and only meet the parking needs of the owners.

[0012] Furthermore, the design of the internal parking space coordination model of the owners in step 1 includes:

[0013] In the mode of internal parking space coordination among owners, after the platform learns about the parking space availability information of owners and the parking needs of external users in advance, it describes the parking inconvenience costs caused by factors such as increased walking distance when exchanging parking spaces between different owners; two factors need to be considered when coordinating the exchange of parking spaces between owners: first, whether the owners can meet more external demands after exchanging parking spaces, so that the platform can obtain more income; second, whether the increased income can be enough to pay for the inconvenience costs caused by the exchange of parking spaces to the owners. When both conditions are met, the parking spaces are re-matched for the owners and more external parking needs are met.

[0014] Furthermore, the design of the owner's internal parking space coordination model in step one also includes:

[0015] (1) Obtaining parking space supply and external parking demand from owners;

[0016] (2) Obtain information about the owner's parking space and the assigned parking space, and characterize the inconvenience cost caused by exchanging parking spaces;

[0017] (3) Determine whether the exchange of parking spaces between owners can meet more external demands;

[0018] (4) If the exchange of parking spaces between owners can meet more external demands, then determine whether the increased income from meeting the demands can cover the inconvenience costs of owners exchanging parking spaces;

[0019] (5) If the additional income from exchanging parking spaces between owners can cover the inconvenience cost, then the owners’ parking spaces will be exchanged and parking spaces will be matched with external demand;

[0020] (6) If the exchange of parking spaces between owners cannot meet more external demands to increase income or the increased income from the exchange of parking spaces between owners cannot pay for the inconvenience costs, the owners’ parking spaces will not be exchanged. After returning to the community, the owners will still park in their own parking spaces and match parking spaces for other external demands.

[0021] Furthermore, in step 2, N is used to represent the set of owners, M is used to represent the set of external parking users, I≡N∪M is used to represent the set of all owners and external parking demand users, and (e i ,l i ) represents the parking reservation time required by user i; (a j ,B),j∈N represents the available time of parking space j, aj Indicates the time when owner j leaves; x i,j ∈{0,1},i∈I,j∈N represents the parking space matching result. If demand i is satisfied by parking space j, then x i,j =1, otherwise x i,j =0.

[0022] The parking space-demand matching model aims to maximize system efficiency:

[0023]

[0024] Where p represents the parking fee per unit time, R = ∑ i∈M p(l i -e i )∑ j∈J x i,j represents the income obtained by satisfying external demand; q represents the inconvenience cost coefficient caused by users parking in other parking spaces, β i,j is the inconvenience caused by finding a parking space and walking time when owner i uses parking space j, where β i,i = 0 means that the inconvenience cost of the owner using his own parking space is 0. Set all β i,j ≥0,i≠j,C=q∑ i∈N ∑ j∈J β i,j x i,j represents the inconvenience cost of exchanging parking spaces for all owners.

[0025] Among the constraints, the priority of matching parking spaces for owners is expressed as:

[0026]

[0027] The parking demand of external users can only be satisfied in one parking space at most, which is expressed as:

[0028]

[0029] In parking space-demand matching, the starting time of the parking space must be earlier than the user's start time, expressed as:

[0030]

[0031] set up represents the order in which users i and i′ arrive at the parking lot. If i is earlier than i′, then otherwise To ensure that the parking users and owners matching in the same parking space do not conflict with each other means:

[0032]

[0033]

[0034] Where K is a sufficiently large constant.

[0035] Another object of the present invention is to provide a shared parking space matching system using the shared parking space matching method, the shared parking space matching system comprising:

[0036] Shared parking model design module, used to design shared parking models based on the coordination of internal parking spaces of owners;

[0037] 0-1 integer programming model building module, used to build an optimization model for shared parking space matching;

[0038] Another object of the present invention is to provide a computer device, the computer device comprising a memory and a processor, the memory storing a computer program, and when the computer program is executed by the processor, the processor executes the steps of the shared parking space matching method.

[0039] Another object of the present invention is to provide a computer-readable storage medium storing a computer program, which, when executed by a processor, enables the processor to execute the steps of the shared parking space matching method.

[0040] Another object of the present invention is to provide an information data processing terminal, which is used to implement the shared parking space matching system.

[0041] In combination with the above technical solutions and the technical problems solved, the advantages and positive effects of the technical solutions to be protected by the present invention are as follows:

[0042] The present invention proposes a new shared parking mode in which owners first coordinate internal parking spaces and then share shared parking spaces with others, which is called "owner internal parking space coordination mode". Based on this mode, parking spaces are re-matched for owners and more external parking needs are met, which effectively improves the matching success rate of shared parking spaces and parking needs on the platform, thereby improving the utilization rate of parking spaces and meeting more external parking needs. At the same time, the present invention effectively prevents users from returning to the community and their shared parking spaces from being occupied through the method of internal parking space coordination, thereby avoiding the risk of owners returning without parking spaces. At the same time, the inconvenience cost of owners exchanging parking spaces is taken into account, ensuring that meeting more external needs can increase the income of the shared parking platform and enhance the enthusiasm of owners to participate in shared parking. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments of the present invention. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0044] Figure 1 is a parking space-demand matching flow chart provided by an embodiment of the present invention;

[0045] Figure 2 This is a schematic diagram of an owner exchanging parking spaces to meet more external demands provided by an embodiment of the present invention; DETAILED DESCRIPTION

[0046] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0047] In view of the problems existing in the prior art, the present invention provides a shared parking space matching method, system, medium, device and terminal. The present invention is described in detail below with reference to the accompanying drawings.

[0048] In order to enable those skilled in the art to fully understand how to implement the present invention in detail, this section is an explanatory embodiment that expands and describes the technical solution of the claims.

[0049] The shared parking space matching method provided in the embodiment of the present invention comprises the following steps:

[0050] S101, design a shared parking model based on the coordination of internal parking spaces among owners;

[0051] S102, building a unified internal and external parking space-demand matching model;

[0052] In step S101 provided in the embodiment of the present invention, when the number of owners in the community is N, and each owner has only one parking space, the shared parking period opened to the public every day is [A, B], and owner j makes an appointment in a j Leave at the moment and j Return at any moment (j∈N,a j ≥A,b j ≤B), the available time period of parking space j is (a j ,b j ). Under the model of internal parking space coordination among owners, the restriction that owners can only park in their own parking spaces is broken, and parking spaces are reassigned when owners return to the parking lot. Therefore, the available time of parking space j is (a j ,B), the parking demand of owner j is (b j,A+24h).

[0053] The design of the owner internal parking space coordination mode in step S101 provided in the embodiment of the present invention includes:

[0054] like Figure 1 As shown in the figure, under the mode of internal parking space coordination among owners, the shared parking platform learns in advance the available time of the owner's parking space and the parking reservation time of external users; then it depicts the inconvenience cost caused by factors such as increased walking distance when exchanging parking spaces between different owners; two factors need to be considered when coordinating the exchange of parking spaces between owners: first, whether the owner can meet more external demands after exchanging parking spaces, so that the platform can obtain more income; second, whether the increased income can be enough to pay for the inconvenience cost caused by the exchange of parking spaces to the owner. When both conditions are met, the parking space is re-matched for the owner and more external parking demands are met.

[0055] The design of the owner internal parking space coordination mode in step S101 provided in the embodiment of the present invention also includes:

[0056] (1) Obtaining parking space supply and external parking demand from owners;

[0057] (2) Obtain information about the owner's parking space and the assigned parking space, and characterize the inconvenience cost caused by exchanging parking spaces;

[0058] (3) Determine whether the exchange of parking spaces between owners can meet more external demands;

[0059] (4) If the exchange of parking spaces between owners can meet more external demands, then determine whether the increased income from meeting the demands can cover the inconvenience costs of owners exchanging parking spaces;

[0060] (5) If the additional income from exchanging parking spaces between owners can cover the inconvenience cost, then the owners’ parking spaces will be exchanged and parking spaces will be matched with external demand;

[0061] (6) If the exchange of parking spaces between owners cannot meet more external demands to increase income or the increased income from the exchange of parking spaces between owners cannot pay for the inconvenience costs, the owners’ parking spaces will not be exchanged. After returning to the community, the owners will still park in their own parking spaces and match parking spaces for other external demands.

[0062] In step S102 provided in the embodiment of the present invention,

[0063] Let N represent the set of owners, M represent the set of external parking users, I≡N∪M represent the set of all owners and external parking demand users, and (e i ,l i ) represents the parking reservation time required by user i; (a j ,B),j∈N represents the available time of parking space j, a jIndicates the time when owner j leaves; x i,j ∈{0,1},i∈I,j∈N represents the parking space matching result. If demand i is satisfied by parking space j, then x i,j =1, otherwise x i,j =0.

[0064] The parking space-demand matching model aims to maximize system utility:

[0065]

[0066] Where p represents the parking fee per unit time, R = ∑ i∈M p(l i -e i )∑ j∈J x i,j represents the income obtained by satisfying external demand; q represents the inconvenience cost coefficient caused by users parking in other parking spaces, β i,j is the inconvenience caused by finding a parking space and walking time when owner i uses parking space j, where β i,i = 0 means that the inconvenience cost of the owner using his own parking space is 0. Set all β i,j ≥0,i≠j,C=q∑ i∈N ∑ j∈J β i,j x i,j represents the inconvenience cost of exchanging parking spaces for all owners.

[0067] Among the constraints, the priority of matching parking spaces for owners is expressed as:

[0068]

[0069] The parking demand of external users can only be satisfied in one parking space at most, which is expressed as:

[0070]

[0071] In parking space-demand matching, the starting time of the parking space must be earlier than the user's start time, expressed as:

[0072]

[0073] set up represents the order in which users i and i′ arrive at the parking lot. If i is earlier than i′, then otherwise The matching of parking users and owners in the same parking space without conflict is expressed as:

[0074]

[0075]

[0076] Where K is a sufficiently large constant.

[0077] The shared parking space matching system provided by the embodiment of the present invention includes:

[0078] Shared parking model design module, used to design shared parking models based on the coordination of internal parking spaces of owners;

[0079] 0-1 integer programming model building module, used to build a parking space matching model based on owners and external users;

[0080] The embodiments of the present invention have achieved some positive effects during the development or use process, and indeed have great advantages over the prior art. The following content is described in conjunction with data, charts, etc. of the test process.

[0081] 1. Design a shared parking model based on the coordination of internal parking spaces among owners

[0082] Under the current shared parking model, since owners will meet their own parking needs in their own parking spaces when they return to the parking lot, each owner's parking space has a certain available time limit, which often leads to some external parking needs with longer parking times not being met.

[0083] The present invention takes into account the available time of the owner's parking space. External parking drivers reserve parking spaces through the platform and provide the location and time of parking needs. According to the parking time of the owner and external users, the owner's parking position is arranged in a parking space close to his own parking space to adjust the available time of each parking space, increase the occupancy rate of the parking space, and ultimately achieve the optimization of the revenue of the sharing platform.

[0084] like Figure 2 As shown, the set of owners in the community is N = {O1, O2}, each owner has only one parking space, the shared parking period opened to the public every day is [A, B] = [7:00, 18:00], owner O1 makes an appointment to leave at 11:00 and return after 18:00, the available period for parking space 1 is (11:00, 18:00), owner O2 makes an appointment to leave before 7:00 and return at 12:00, the available period for parking space 2 is (7:00, 12:00). In the model of internal parking space coordination among owners, the restriction that owners can only park in their own parking spaces is broken, and parking spaces are reallocated when owners return to the parking lot. Therefore, the available time of parking space 1 is (11:00, 18:00), and the available time of parking space 2 is (7:00, 18:00); the parking demand of owner O1 is (18:00, 31:00), and the parking demand of owner O2 is (12:00, 31:00).

[0085] When facing external demands {D1=(7:00,9:00),D2=(10:00,14:00),O3=(15:00,17:00)}, the system can determine that if owner O2 parks in his own parking space 2 when he returns, external demand O2 cannot be met, external demand O1 is met in parking space 2, and external demand D3 is met in parking space 1; if owner O2 is reassigned to park in parking space 1, external demands D1, D2, and D3 can all be met in parking space 2. At this time, it is determined whether the additional income p*(14:00-10:00) of the system caused by external demand O2 is greater than the inconvenience cost q*(β O1,O2 +β O2,O1 ), if p*(14:00-10:00)>q*(β O1,O2 +β O2,O1 ), then assign owner O2 to park in parking space 1, and when owner O1 returns, park in parking space 2; otherwise, when owner O2 returns, park in his own parking space 2.

[0086] 2. Build a unified internal and external parking space-demand matching model

[0087] The parking space-demand matching model aims to maximize system utility:

[0088]

[0089] Among them, p represents the parking fee per unit time, q represents the inconvenience cost coefficient caused by the user parking in other parking spaces; β i,j is the inconvenience caused by finding a parking space and walking time when owner i uses parking space j, where β i,i =0 means that the inconvenience cost of the owner using his own parking space is 0. Generally, all β i,j ≥0,i≠j; represents the order in which users i and i′ arrive at the parking lot. If i is earlier than i′, then otherwise

[0090] Constraints:

[0091] x O1,1 +x O1,2 =1,x O2,1 +x O2,2 =1 (1)

[0092] x D1,1 +x D1,2 ≤1,x D2,1 +x D2,2 ≤1,x D3,1 +x D3,2 ≤1 (2)

[0093] (14:00-10:00)*x D2,1 +(17:00-15:00)*x D3,1 ≤(18:00-11:00),(19:00-7:00)*x D1,2 +(14:00-10:00)*x D2,2 +(17:00-15:00)*x D3,2 ≤(18:00-7:00) (3)

[0094]

[0095]

[0096]

[0097]

[0098]

[0099]

[0100]

[0101]

[0102]

[0103]

[0104]

[0105]

[0106]

[0107]

[0108]

[0109]

[0110]

[0111]

[0112]

[0113]

[0114] (1) Indicates that parking spaces are matched to owners first; (2) Indicates that the parking needs of external users can only be met in one parking space at most; (3) Indicates that in the parking space-demand matching, the starting time of the parking space being available must be earlier than the user's start time of use; (4) and (5) Indicate that the parking reservation times of parking users who are matched to meet their needs in the same parking space do not conflict.

[0115] The results are as follows Figure 2 It can be seen that when the increased income from satisfying external demand D2 is greater than the cost of owners O1 and O2 exchanging parking spaces, the system will exchange the parking spaces of owners O1 and O2, and external demands D1, D2, and D3 are all satisfied in parking space 2, such as Figure 2 B; Otherwise, when the additional income from satisfying external demand D2 is less than the cost of owners O1 and O2 exchanging parking spaces, owners O1 and O2 will park in their own parking spaces when they return, and demand D2 will not be satisfied. D1 will be satisfied in parking space 2, and D3 will be satisfied in parking space 1. Figure 2 A.

[0116] It should be noted that the embodiments of the present invention can be implemented by hardware, software or a combination of software and hardware. The hardware part can be implemented using dedicated logic; the software part can be stored in a memory and executed by an appropriate instruction execution system, such as a microprocessor or dedicated hardware. A person of ordinary skill in the art will understand that the above-mentioned devices and methods can be implemented using computer executable instructions and / or contained in a processor control code, for example, such codes are provided on a carrier medium such as a disk, CD or DVD-ROM, a programmable memory such as a read-only memory (firmware), or a data carrier such as an optical or electronic signal carrier. The device and its modules of the present invention can be implemented by hardware circuits such as very large-scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, etc., or programmable hardware devices such as field programmable gate arrays, programmable logic devices, etc., can also be implemented by software executed by various types of processors, or can be implemented by a combination of the above-mentioned hardware circuits and software, such as firmware. The above is only a specific embodiment of the present invention, but the protection scope of the present invention is not limited thereto. Any modification, equivalent substitution and improvement made by any technician familiar with the technical field within the technical scope disclosed by the present invention and within the spirit and principle of the present invention should be covered within the protection scope of the present invention.

Claims

1. A shared parking space matching method, characterized in that: Based on the known available time of parking spaces provided by owners, external parking drivers reserve parking spaces through the platform and provide the location and time of parking requirements. Based on the parking time of owners and external users, the available time of each parking space is adjusted by arranging the owner's parking position in a parking space close to his own parking space. Based on the available time of parking spaces provided by owners and external requirements, the parking time is reserved, and a 0-1 integer programming model is constructed to uniformly achieve the matching of parking spaces provided by owners and external requirements. The shared parking space matching method includes the following steps: Step 1: Design a shared parking model based on the coordination of internal parking spaces among owners; Step 2: Build a unified internal and external parking space-demand matching model; In step 2, N is used to represent the set of owners, M is used to represent the set of external parking users, I≡N∪M is used to represent the set of all owners and external parking demands, and (e i ,l i ) represents the parking reservation time required by user i; (a j ,B),j∈N represents the available time of parking space j, α j Indicates the time when owner j leaves; x i,j ∈{0,1},i∈I,j∈N represents the parking space matching result. If demand i is satisfied by parking space j, then x i,j =1, otherwise x i,j =0; The parking space-demand matching model aims to maximize system utility: MaxU=Max(RC)=Max(∑ i∈M p(l i -e i )∑ j∈J x i,j -∑ i∈N ∑ j∈l b i,j x i,j ); Among them, p represents the parking fee per unit time, q represents the inconvenience cost coefficient caused by the user parking in other parking spaces; β i,j The inconvenience caused by finding a parking space and walking time when owner i uses parking space j; let β i,i = 0 means that the inconvenience cost of the owner using his own parking space is 0. Set all β i,j ≥0,i≠j; Among the constraints, the priority of matching parking spaces for owners is expressed as: The parking demand of external users can only be satisfied in one parking space at most, which is expressed as: In parking space-demand matching, the starting time of the parking space must be earlier than the user's start time, expressed as: set up represents user i and i ′ The order of arrival at the parking lot is as follows: if i is earlier than i ′ ,but otherwise The matching of parking users and owners in the same parking space without conflict is expressed as: Where K is a sufficiently large constant.

2. The shared parking space matching method according to claim 1, characterized in that: In step 1, when the number of owners in the community is N, and each owner has only one parking space, the shared parking period opened to the public every day is [A, B], and owner j makes an appointment in a j Leave at the moment and j Return at any moment (j∈N,a j ≥A,b j ≤B), the available time period of parking space j is (a j ,b j ); Under the model of internal coordination among owners, the restriction that owners can only park in their own parking spaces is broken, and parking spaces are rearranged when owners return to the parking lot. Therefore, the available time of parking space j is (a j ,B), the parking demand of owner j is (b j ,A+24h).

3. The shared parking space matching method according to claim 1, characterized in that: The design of the owner's internal coordination model in step one includes: In the shared parking model coordinated among owners, after the platform learns in advance about the vacant parking spaces of the owners and the parking needs of external users, it characterizes the parking inconvenience costs caused by the increased walking distance when exchanging parking spaces between different owners. Two factors need to be considered when coordinating the exchange of parking spaces between owners: first, whether the owners can meet more external demands after exchanging parking spaces, so that the platform can obtain more income; second, whether the increased income can be sufficient to pay for the inconvenience costs caused to the owners by exchanging parking spaces; when both conditions are met, the parking spaces are re-matched for the owners and more external parking needs are met.

4. The shared parking space matching method according to claim 1, characterized in that: The design of the owner's internal coordination model in step one also includes: (1) Obtaining parking space supply and external parking demand from owners; (2) Obtain information about the owner's parking space and the assigned parking space, and characterize the inconvenience cost caused by exchanging parking spaces; (3) Determine whether the exchange of parking spaces between owners can meet more external demands; (4) If the exchange of parking spaces between owners can meet more external demands, then determine whether the increased income from meeting the demands can cover the inconvenience costs of owners exchanging parking spaces; (5) If the additional income from exchanging parking spaces between owners can cover the inconvenience cost, then the owners’ parking spaces will be exchanged and parking spaces will be matched with external demand; (6) If the exchange of parking spaces between owners cannot meet more external demands to increase income or the increased income from the exchange of parking spaces between owners cannot pay for the inconvenience costs, the owners’ parking spaces will not be exchanged. After returning to the community, the owners will still park in their own parking spaces and match parking spaces for other external demands.

5. A shared parking space matching system using the shared parking space matching method according to any one of claims 1 to 4, characterized in that: The shared parking space matching system includes: Shared parking model design module, used to design a shared parking model based on internal coordination among owners; 0-1 integer programming model building module, used to build a unified internal and external parking space-demand matching model.

6. A computer device, characterized in that: The computer device includes a memory and a processor. The memory stores a computer program. When the computer program is executed by the processor, the processor executes the steps of the shared parking space matching method as described in any one of claims 1 to 4.

7. A computer-readable storage medium storing a computer program, wherein when the computer program is executed by a processor, the processor executes the steps of the shared parking space matching method according to any one of claims 1 to 4.

8. An information data processing terminal, characterized in that: The information data processing terminal is used to implement the shared parking space matching system as described in claim 5.

Images