A parking space allocation method for a parking reservation system under dynamic parking price guidance

Abstract

A kind of parking space allocation method of parking reservation system under dynamic parking price guidance, the present application relates to the parking space allocation method of parking reservation system under dynamic parking price guidance.The purpose of the present application is to solve the lack of a kind of parking allocation considering user parking demand preference, regional parking equilibrium technology, and the problem of the phenomenon of part of parking lot in the same area being short of parking space while some parking lot being idle.The process is:1, set basic operating parameters;2, user submits parking reservation request in advance;3, user obtains information of any parking space in the remaining parking space set;4, screen the available parking space set U of reservation user;5, establish the optimal parking space allocation model of parking reservation system;obtain the optimal parking space allocation scheme by solving;6, update the remaining available time period in parking space information;7, if user wants to cancel reservation after successful allocation, submit cancellation reservation application to parking reservation system.The present application belongs to the field of intelligent transportation technology.

Description

Technical Field

[0001] This invention belongs to the field of intelligent transportation technology, specifically relating to a parking space allocation method for a parking reservation system guided by dynamic parking pricing. Background Technology

[0002] Currently, with the rapid development of the social economy, the number of motor vehicles in my country is also growing rapidly, leading to a huge supply-demand contradiction between the rapidly increasing parking demand and the limited supply of parking facilities. At the same time, under a uniform parking price in the same area, some parking lots experience a shortage of spaces while others remain vacant. The cruising traffic during the search for parking spaces not only increases travel costs for travelers but also exacerbates traffic congestion and environmental pollution in urban areas. Therefore, there is an urgent need to develop an intelligent parking reservation system that considers the parking demand of a given area. Existing parking reservation systems are only applied to special scenarios such as exhibitions and hospitals, failing to organically connect surrounding parking lots and consider user preferences and balance regional parking demand. Domestic and international scholars have conducted extensive research on parking allocation systems under the reservation model, mainly focusing on the hardware configuration of parking lots and the design of reservation parking systems. However, the parking allocation model is the core content of the reservation parking system design, and most inventions only emphasize the functional design of reservation parking while neglecting the optimization of the parking space allocation model.

[0003] In summary, there is currently a lack of parking allocation technology that takes into account user parking demand preferences and regional parking balance. Therefore, it is necessary to propose a parking space allocation method for a parking reservation system guided by dynamic parking prices. Summary of the Invention

[0004] The purpose of this invention is to address the current lack of a parking allocation technology that considers user parking needs and preferences and regional parking balance, resulting in a shortage of parking spaces in some parking lots while other parking lots in the same area are vacant. Therefore, this invention proposes a parking space allocation method for a parking reservation system guided by dynamic parking prices.

[0005] The specific process of a parking space allocation method for a parking reservation system guided by dynamic parking pricing is as follows:

[0006] Step 1: Set the basic operating parameters of the parking reservation system, including the available time slots for the reserved parking lot [A,B] and the unit parking time slots [X]. k ,Y k Information processing cycle T, time limit for submitting appointment requests ω, advance time for issuing allocation results θ, and response time for canceling user appointments γ;

[0007] Among them, ω>θ, θ<T, γ<θ;

[0008] Step 2: User u submits a parking reservation request m ω hours in advance, including the parking start time c. m Parking end time d m Destination z, Destination z coordinates (x) z ,y z Maximum acceptable walking distance from parking lot to destination Maximum acceptable parking fee per unit

[0009] The maximum acceptable walking distance from the parking lot to the destination The unit is meters;

[0010] The maximum acceptable parking fee per unit price The unit is yuan / hour;

[0011] Step 3: Combine the reservation made by user u in Step 2 with the remaining parking spaces. Retrieve information about any parking space n, including the coordinates (x, y) of the parking lot j where parking space n is located. j ,y j Walking distance l from parking space n to destination z mn The total number of available parking spaces p in parking lot j j The number of parking spaces h currently occupied in parking lot j. j The number of parking spaces h currently occupied in parking lot j is... j Parking fee per unit price under the following circumstances j (h j ), Remaining available time period [a n ,b n ];[a n ,b n ]∈[A,B];

[0012] The walking distance l from parking space n to destination z mn The unit is meters;

[0013] The number of parking spaces h currently occupied in parking lot j. j Parking fee per unit price under the following circumstances j (h j The unit is yuan / hour;

[0014] Step 4: Based on the user's maximum acceptable walking distance Maximum acceptable parking fee per unit To filter the available parking space set U for the reserved user u based on the constraints;

[0015] Step 5: Establish an optimal parking space allocation model for the parking reservation system with the goal of maximizing its benefits;

[0016] Based on the optimal parking space allocation model, the optimal parking space allocation scheme is obtained from the available parking space set U obtained in step 4, and the allocation result is sent to the reserved user u.

[0017] Step 6: After successful allocation, the platform automatically deducts the parking fee in advance and updates the remaining available time period in the parking space n information [a n ,b n ]information;

[0018] Step 7: After successful allocation, if the user wants to cancel the reservation, they submit a cancellation request to the parking reservation system. The parking reservation system determines whether the cancellation conditions are met based on the request time. If they are met, the system approves the request, refunds all or part of the parking fee, and updates the remaining available time slots in the parking space n information. n ,b n Information; if not met, the application will be rejected and cancellation will fail.

[0019] The beneficial effects of this invention are as follows:

[0020] 1. This invention takes into account the basic needs of users when making reservations, the diversity of users' choices of parking lots, and the dynamic characteristics of parking demand, and ensures the maximization of system benefits while meeting the basic needs of users.

[0021] 2. From the perspective of sustainable development, this invention considers the negative impact of the system rejecting user requests on the platform, and adds a rejection penalty factor to prevent the system from having an excessively high rejection rate due to only considering the overall benefits, thus ensuring the reliability of the system allocation.

[0022] 3. This invention uses a dynamic parking price method to distribute parking demand among various parking lots, establishing a parking allocation model that balances regional parking demand. Attached Figure Description

[0023] Figure 1 This is a flowchart of the system operation process in this invention;

[0024] Figure 2 This is a graph showing the relationship between time parameters such as A, B, ω, γ, θ, and T in the system of this invention;

[0025] Figure 3 This is a flowchart of the parking space allocation method of the parking reservation system guided by dynamic parking prices in this invention. Detailed Implementation

[0026] Specific Implementation Method 1: The specific process of a parking space allocation method for a parking reservation system guided by dynamic parking pricing in this implementation method is as follows:

[0027] Step 1: Set the basic operating parameters of the parking reservation system, including the available time slots for the reserved parking lot [A,B] and the unit parking time slots [X]. k ,Y k Information processing cycle T, time limit for submitting appointment requests ω, advance time for issuing allocation results θ, and response time for canceling user appointments γ;

[0028] Among them, ω>θ, θ<T, γ<θ;

[0029] Step 2: User u submits a parking reservation request m ω hours in advance, including the parking start time c. m Parking end time d m Destination z, Destination z coordinates (x) z ,y z Maximum acceptable walking distance from parking lot to destination Maximum acceptable parking fee per unit

[0030] The maximum acceptable walking distance from the parking lot to the destination The unit is meters;

[0031] The maximum acceptable parking fee per unit price The unit is yuan / hour;

[0032] Parking start time c m Parking end time d m Used to determine the user's reserved parking time period [c m ,d m Order processing time and parking fee calculation.

[0033] Destination z-coordinate (x z ,y z When user u selects destination z, they can directly search for and select the destination on the platform's map interface. The system then converts the destination z selected by user u into coordinates (x, y). z ,y z Saved to the user's appointment information;

[0034] Maximum acceptable walking distance from parking lot to destination (meters), maximum acceptable parking fee per unit (RMB / hour) is used to ensure that users' basic needs and preferences for parking spaces are met, and to prevent users from canceling their orders due to dissatisfaction with the allocation results.

[0035] Step 3: Combine the reservation made by user u in Step 2 with the remaining parking spaces. Retrieve information about any parking space n, including the coordinates (x, y) of the parking lot j where parking space n is located. j ,yj Walking distance l from parking space n to destination z mn The total number of available parking spaces p in parking lot j j The number of parking spaces h currently occupied in parking lot j. j The number of parking spaces h currently occupied in parking lot j is... j Parking fee per unit price under the following circumstances j (h j ), Remaining available time period [a n ,b n ];[a n ,b n ]∈[A,B];

[0036] The walking distance l from parking space n to destination z mn The unit is meters;

[0037] The number of parking spaces h currently occupied in parking lot j. j Parking fee per unit price under the following circumstances j (h j The unit is yuan / hour;

[0038] Step 4: Based on the user's maximum acceptable walking distance Maximum acceptable parking fee per unit To filter the available parking space set U for the reserved user u based on the constraints;

[0039] Step 5: Establish an optimal parking space allocation model for the parking reservation system with the goal of maximizing its benefits;

[0040] Based on the optimal parking space allocation model, the optimal parking space allocation scheme is obtained from the available parking space set U obtained in step 4, and the allocation result is sent to the reserved user u.

[0041] Step 6: After successful allocation, the platform automatically deducts the parking fee in advance and updates the remaining available time period in the parking space n information [a n ,b n ]information;

[0042] Users sign an automatic deduction agreement with the platform when using the platform to ensure efficient transactions and protect the platform's interests. Once a parking space is successfully allocated, the platform can automatically deduct the parking fee in advance and send the result to the user.

[0043] After allocation, the remaining available time period [a] in the parking space n information is determined. n ,b n The information is updated to obtain the latest remaining available time slots, occupancy status, and to calculate the dynamic parking fee per unit price. j (h j ).

[0044] Step 7: After successful allocation, if the user wants to cancel the reservation, they submit a cancellation request to the parking reservation system. The parking reservation system determines whether the cancellation conditions are met based on the request time. If they are met, the system approves the request, refunds all or part of the parking fee, and updates the remaining available time slots in the parking space n information. n ,b n Information; if not met, the application will be rejected and cancellation will fail.

[0045] Specific Implementation Method Two: This implementation method differs from Specific Implementation Method One in that...

[0046] In step 1, the unit parking time period [X] k ,Y k The acquisition process is as follows:

[0047] The parking reservation system has an information processing cycle of T, and the available parking time period [A, B] is divided into... Each time period is denoted as a unit parking time period [X]. k ,Y k ].

[0048] The parking reservation system remains open 24 hours a day to receive parking reservation requests, but the available time slots for parking reservations are limited to the [A,B] time slots. That is, users can only submit parking requests within the [A,B] time slots when making a reservation.

[0049] The parking reservation system has an information processing cycle of T, and the available parking time period [A, B] is divided into... Each time period is denoted as a unit parking time period [X]. k ,Y k User u needs to submit a parking reservation request ω hours in advance. The parking reservation system processes the reservation information periodically in period T. Based on the principle of maximizing system efficiency, the system allocates the reservation information received in the previous period according to the set decision time point, and informs the user of the result after the allocation plan is determined.

[0050] The parking reservation system will be available in (X) k -θ) The time before the scheduled parking start time is c. m Included in time period [X] k ,Y k The system will send out the allocation results for orders within the specified area to ensure that users can still create new parking plans if allocation fails.

[0051] To prevent losses to the parking reservation system caused by users canceling their reservations at will, the parking reservation system is equipped with a response time γ for canceling user reservations.

[0052] For example, given T = 2h, ω = 3h, θ = 1h, and γ = 0.5h, for a reservation order from 10:00 to 12:00, if user u wants to reserve a parking space from 11:00 to 14:00, they must submit a parking reservation request m before 8:00. The system will start processing reservation orders from 10:00 to 12:00 at 8:00 and send the allocation results to the user before 9:00. If user u wants to cancel the order and get a full refund after successful allocation, they must submit a cancellation request to the system before 10:30.

[0053] The other steps and parameters are the same as in Specific Implementation Method 1.

[0054] Specific Implementation Method Three: This implementation method differs from Specific Implementation Method One or Two in that, in step 3, the reservation user u from step 2 is combined with the remaining parking space set. Retrieve information about any parking space n, including the coordinates (x, y) of the parking lot j where parking space n is located. j ,y j Walking distance l from parking space n to destination z mn The total number of available parking spaces p in parking lot j j The number of parking spaces h currently occupied in parking lot j. j The number of parking spaces h currently occupied in parking lot j is... j Parking fee per unit price under the following circumstances j (h j ), Remaining available time period [a n ,b n ];[a n ,b n ]∈[A,B]; The specific process is as follows:

[0055] To balance parking demand in the area, the system adopts a dynamic charging method for parking fees. j (h j ) and h j The relationship is as follows:

[0056]

[0057] Where: i min Here is the parking fee per hour (in yuan) when parking space j has a 0% occupancy rate; max The maximum acceptable parking fee per unit for local residents is [amount] yuan / hour; the walking distance l from parking space n to destination z. mn The unit is meters, and the number of parking spaces (h) currently occupied in parking lot j is also present. j Parking fee per unit price under the following circumstances j (h j The unit is yuan / hour;

[0058] Walking distance l from parking space n to destination z mn for:

[0059]

[0060] Other steps and parameters are the same as in specific implementation method one or two.

[0061] Specific Implementation Method Four: This implementation method differs from Specific Implementation Methods One to Three in that...

[0062] In step 4, the user's maximum acceptable walking distance is used. Maximum acceptable parking fee per unit The available parking space set U is used to filter the available parking spaces of the reservation user u according to the constraints. This is used to select the parking spaces that meet the user's needs and preferences from the currently available parking spaces, and to prepare for the next step of the reservation system to allocate the optimal parking spaces.

[0063] The filtering method is as follows:

[0064]

[0065] The other steps and parameters are the same as those in one of the specific implementation methods one to three.

[0066] Specific Implementation Method 5: This implementation method differs from one of the specific implementation methods one to four in that step 5 establishes an optimal parking space allocation model for the parking reservation system with the goal of maximizing the benefits of the parking reservation system.

[0067] Based on the optimal parking space allocation model, the optimal parking space allocation scheme is obtained from the available parking space set U obtained in step 4, and the allocation result is sent to the reserved user u; the specific process is as follows:

[0068] The specific process is as follows:

[0069] Step 51: Establish an optimal parking space allocation model for the parking reservation system with the goal of maximizing its benefits; the specific steps are as follows:

[0070] With the goal of maximizing the benefits of the parking reservation system, the objective function is established as follows:

[0071] I = I1 - I2 - I3 (4).

[0072] Where I represents the total benefit of the parking reservation system; I1 represents the revenue obtained from renting out parking spaces by the parking reservation system; I2 represents the cost of purchasing parking spaces by the parking reservation system; and I3 represents the penalty cost for refusing user requests by the parking reservation system. Since the system may have an excessively high rejection rate if it only considers maximizing benefits, and refusing user requests will affect user satisfaction with the platform, it is not conducive to the long-term development of the platform from the perspective of sustainable development. Therefore, the inclusion of a rejection penalty cost ensures the reliability of the system's allocation.

[0073] The revenue I1 obtained by the parking reservation system from renting out parking spaces is the total pre-payment fee for each successfully allocated parking space during the current time period, and the pre-payment fee for each request is the parking fee unit price i during the current time period. j (h j ) and the requested parking duration (d m -c m The product of ) is calculated as follows:

[0074]

[0075] Where N is the total number of available parking spaces in the reservation parking system; M is the total number of parking requests; x mn This indicates whether request m is accepted by parking space n. If accepted, x indicates whether the request is accepted by parking space n. mn =1, otherwise x mn =0;

[0076] The cost I2 for purchasing parking spaces in the parking reservation system is the purchase price P of all available parking spaces in the reservation system. n The sum of the products of purchase duration and purchase duration, I² is calculated as follows:

[0077]

[0078] Where, p n The purchase price of parking space n is expressed in yuan per hour. The usage period for parking space n purchased by the parking reservation system from the parking lot;

[0079] Since maximizing efficiency alone might lead to an excessively high rejection rate, and rejecting user requests would negatively impact user satisfaction with the platform, which is detrimental to its long-term development from a sustainability perspective, a rejection penalty fee I3 is added to ensure the reliability of the system's allocation. The penalty fee I3 for rejecting user requests in the parking reservation system is the product of the rejection penalty factor μ and the total number of rejected requests. The calculation method for I3 is as follows:

[0080]

[0081] Where μ is the rejection penalty factor, and the unit is yuan / item;

[0082] In summary, the specific expression for the established objective function is:

[0083]

[0084] During allocation, a request m can be allocated at most one parking space. The purchase time and remaining available time of parking space n are [a n ,b nThe parking time must be included within the available parking time period [A,B] of the reserved parking lot, and the parking time period of the requesting m allocated to parking space n is [c]. m ,d m [This must be included in the remaining available time period for parking space n] n ,b n Within [ ], therefore the constraints of the objective function are:

[0085]

[0086]

[0087] [a n ,b n ]∈[A,B] and before the first parking space allocation

[0088] c m -a n ≥0 (11)

[0089] d m -b n ≤0 (12)

[0090] x mn ={0,1} (13)

[0091] m∈{1,2,…,M}, n∈{1,2,…,N} (14)

[0092] The objective function that satisfies the constraints is the optimal parking space allocation model for the parking reservation system.

[0093] Step 52: Based on the optimal parking space allocation model, solve for the optimal parking space allocation scheme from the available parking space set U obtained in step 4, and send the allocation result to the reservation user u (calculate the objective function value of each parking space in the available parking space set U when the constraint conditions are met, and the parking space corresponding to the maximum value of the objective function value is the obtained optimal parking space allocation scheme).

[0094] The other steps and parameters are the same as those in one of the specific implementation methods one to four.

[0095] Specific Implementation Method Six: This implementation method differs from Specific Implementation Methods One through Five in that...

[0096] In step 7, if a user wants to cancel their reservation after successful allocation, they submit a cancellation request to the parking reservation system. The system determines whether the cancellation conditions are met based on the request time. If they are met, the system approves the request, refunds all or part of the parking fee, and updates the remaining available time slot in the parking space n information. n ,b nInformation; if not met, the application will be rejected and cancellation will fail; the specific process is as follows:

[0097] Step 71: The parking reservation system receives the user's cancellation request and determines the submission time of the cancellation request. Simultaneously, the parking time slot reserved by the user is obtained from the user's reservation information [c m ,d m ];

[0098] Step 72: The parking reservation system determines whether the cancellation conditions are met.

[0099] when If all refund conditions are met, user u's account in [c] will be cancelled. m ,d m For reservations made during designated time slots, all pre-deducted fees will be refunded and the remaining available time slots in the parking space n information will be updated. n ,b n ]information;

[0100] when If the partial refund conditions are met, user u can cancel their account. Time slot reservations will be refunded to users. Calculate the parking fee for the specified time period and update the remaining available time period in the parking space n information [a n ,b n ]information;

[0101] when If the cancellation conditions are not met, the user's cancellation request will be rejected.

[0102] The other steps and parameters are the same as those in one of the specific implementation methods one to five.

[0103] This invention may have other embodiments. Without departing from the spirit and essence of this invention, those skilled in the art can make various corresponding changes and modifications according to this invention, but these corresponding changes and modifications should all fall within the protection scope of the appended claims.

Claims

1. A parking space allocation method for a parking reservation system guided by dynamic parking pricing, characterized in that: The specific process of the method is as follows: Step 1: Set the basic operating parameters of the parking reservation system, including the available time periods for the reserved parking lot. Company parking hours Information processing cycle Time limit for submitting appointment requests Lead time for issuing allocation results Response time to canceling user appointments ; in, , , ; Step 2, User in advance Submit parking reservation request within the specified time The request includes the parking start time. Parking end time ,destination ,destination coordinate Maximum acceptable walking distance from parking lot to destination Maximum acceptable parking fee per unit ; The maximum acceptable walking distance from the parking lot to the destination The unit is meters; The maximum acceptable parking fee per unit price The unit is yuan / hour; Step 3: Combine with Step 2 to book users In the remaining parking spaces Get any parking space Information, including parking spaces Parking lot coordinates parking spaces Arrive at the destination walking distance ,PARKING LOT Total number of available parking spaces Parking lot during current time Number of parking spaces already occupied Parking lot during current time Number of parking spaces already occupied Parking fee per unit under certain circumstances Remaining available time period ; ; The parking space Arrive at the destination walking distance The unit is meters; The parking lot during the current time period Number of parking spaces already occupied Parking fee per unit under certain circumstances The unit is yuan / hour; The specific process is as follows: and The relationship is as follows: （1） in: For parking lot Parking fee per hour when parking space occupancy is 0%; The maximum acceptable parking fee per unit for local residents is [amount] yuan / hour; parking spaces Arrive at the destination walking distance Units are meters, parking lot during the current time period Number of parking spaces already occupied Parking fee per unit under certain circumstances The unit is yuan / hour; parking space Arrive at the destination walking distance for: （2） Step 4: Based on the user's maximum acceptable walking distance Maximum acceptable parking fee per unit Filter reserved users based on constraints Available parking space set ; Step 5: Establish an optimal parking space allocation model for the parking reservation system with the goal of maximizing its benefits; The available parking space set obtained in step 4 based on the optimal parking space allocation model The optimal parking space allocation scheme is obtained by solving the algorithm, and the allocation results are sent to the users who made reservations. ; Step 6: After successful allocation, the platform will automatically deduct the parking fee in advance and update the parking space. The remaining available time period in the information information; Step 7: If a user wishes to cancel a parking reservation after successful allocation, they should submit a cancellation request to the parking reservation system. The system will determine whether the cancellation conditions are met based on the request time. If so, the system will approve the cancellation, refund all or part of the parking fee, and update the parking space. The remaining available time period in the information Information; if the requirements are not met, the application will be rejected and cancellation will fail.

2. The parking space allocation method of a dynamic parking price-guided parking reservation system according to claim 1, characterized in that: The unit parking period in step 1 The acquisition process is as follows: The information processing cycle of the parking reservation system is Parking availability time Divided into Each time period is recorded as a unit parking time period. .

3. The parking space allocation method of a dynamic parking price-guided parking reservation system according to claim 2, characterized in that: In step 4, the user's maximum acceptable walking distance is used. Maximum acceptable parking fee per unit Filter reserved users based on constraints Available parking space set The filtering method is as follows: （3）。 4. The parking space allocation method of a parking reservation system guided by dynamic parking pricing according to claim 3, characterized in that: In step 5, an optimal parking space allocation model for the parking reservation system is established with the goal of maximizing the benefits of the parking reservation system. The available parking space set obtained in step 4 based on the optimal parking space allocation model The optimal parking space allocation scheme is obtained by solving the algorithm, and the allocation results are sent to the users who made reservations. The specific process is as follows: Step 51: Establish an optimal parking space allocation model for the parking reservation system with the goal of maximizing its benefits; the specific steps are as follows: With the goal of maximizing the benefits of the parking reservation system, the objective function is established as follows: （4） in, For the overall benefits of the parking reservation system; Revenue generated from renting out parking spaces through the parking reservation system; The cost of purchasing parking spaces for the parking reservation system; Penalty fees for the parking reservation system rejecting user requests; The revenue generated from renting out parking spaces through the parking reservation system This is the total prepayment for requests that have been successfully allocated a parking space during the current time period. The prepayment for each request is equal to the parking fee per unit area during the current time period. With the requested parking duration The product of The calculation method is as follows: （5） in, This represents the total number of available parking spaces in the reservation parking system. Total number of parking requests; Indicates a request Is it a parking space? Accept, if accepted ,otherwise ; The cost of purchasing parking spaces through the parking reservation system The purchase price per available parking space in the reservation parking system The sum of the products of purchase duration and purchase duration The calculation method is as follows: （6） in, For parking spaces The purchase price is expressed in yuan per hour. Parking spaces purchased from parking lots for the parking reservation system The period of use; The parking reservation system will charge a penalty fee if it refuses a user's request. For the rejection of punishment factor The product of the total number of rejected requests, The calculation method is as follows: （7） in, The rejection penalty factor is expressed in yuan per factor. In summary, the specific expression for the established objective function is as follows: （8） During allocation, a request Only one parking space can be allocated to them at most. Purchase period and remaining available period Must be included in the available parking time slots for reservations. Inside, and allocated parking spaces. Request Parking hours Must be included in parking space Remaining available time slots Therefore, the constraints of the objective function are: （3） （9） , And before the first parking space allocation (10) （11） （12） （13） ， （14） The objective function that satisfies the constraints is the optimal parking space allocation model for the parking reservation system. Step 52: Based on the optimal parking space allocation model, obtain the set of available parking spaces in step 4. The optimal parking space allocation scheme is obtained by solving the algorithm, and the allocation results are sent to the users who made reservations. .

5. The parking space allocation method of a dynamic parking price-guided parking reservation system according to claim 4, characterized in that: If a user wishes to cancel their parking reservation after successful allocation in step 7, they submit a cancellation request to the parking reservation system. The system determines whether the cancellation conditions are met based on the request time. If so, the system approves the cancellation, refunds all or part of the parking fee, and updates the parking space. The remaining available time period in the information Information; if the requirements are not met, the application will be rejected and cancellation will fail. The specific process is as follows: Step 71: The parking reservation system receives the user's cancellation request and determines the submission time of the cancellation request. At the same time, the parking time slot reserved by the user can be obtained from the user's reservation information. ; Step 72: The parking reservation system determines whether the cancellation conditions are met. when If all refund conditions are met, the user can be cancelled. exist For time slot reservations, all pre-deducted fees will be refunded and parking spaces will be updated. The remaining available time period in the information information; when If the partial refund conditions are met, the user can cancel their account. exist Time slot reservations will be refunded to users. Parking fees for specific time periods and updating parking spaces The remaining available time period in the information information; when If the cancellation conditions are not met, the user's cancellation request will be rejected.

Images