A method for optimizing dynamic parking spots for shared scooters and a method for managing parking spots.

Abstract

This invention discloses a method for optimizing dynamic parking spots for shared scooters and a parking spot management method. The dynamic parking spot optimization method includes the following steps: acquiring historical parking data for a designated area, counting the number of times each dynamic parking spot in the designated area was used in the previous period, and calculating the total number of times it was used. The parking area of ​​the dynamic parking spot includes designated parking areas and temporary parking areas; calculating the target number N of dynamic parking spots in the designated area based on the total number of times it was used and a preset target parking turnover rate. target Based on the target number of dynamic parking spots N target This invention allows for the automatic adjustment of the number and location of dynamic parking spots within a designated area, flexibly adapting to real-time changes in user needs.

Description

Technical Field

[0001] This invention relates to the field of shared scooter technology, and in particular to a method for optimizing dynamic parking spots and managing parking spots for shared scooters. Background Technology

[0002] Green and low-carbon travel is gaining popularity, and new modes of transportation, such as shared scooters, are becoming increasingly popular in some campuses, scenic spots, and urban areas due to their convenience, affordability, speed, efficiency, and environmental friendliness. Shared scooter parking spots are generally divided into fixed static parking spots and temporary dynamic parking spots. However, currently, the planning of shared scooter parking spots mainly relies on manual decision-making, which cannot flexibly adapt to real-time changes in user needs. Summary of the Invention

[0003] To address the aforementioned technical problems, this invention provides a method for optimizing dynamic parking spots for shared scooters and a method for managing parking spots. This method can automatically adjust the number and location of dynamic parking spots within a set area, flexibly adapting to real-time changes in user needs.

[0004] To solve the above problems, the present invention adopts the following technical solution:

[0005] The present invention provides a method for optimizing dynamic parking spots for shared scooters, comprising the following steps:

[0006] S1: Obtain historical parking data for a designated area, count the number of times each dynamic parking point in the designated area was used in the previous period, and calculate the total number of times it was used. The parking area of ​​the dynamic parking point includes designated parking areas and temporary parking areas.

[0007] S2: Calculate the target number N of dynamic parking spots in the designated area based on the total number of parking times and the preset target parking turnover rate. target ;

[0008] S3: Based on the target number of dynamic parking points N target Adjust the dynamic parking spots within the designated area.

[0009] Preferably, the number N of target dynamic parking points target The calculation formula is as follows:

[0010]

[0011] Where round(.) is the round function, T R E represents the total number of stops. target The target parking turnover rate is the average number of times a dynamic parking spot is used within a set area per unit period.

[0012] Preferably, step S3 includes the following steps:

[0013] S31: Compare the current number N of dynamic parking spots within the designated area. current Number of target dynamic parking points N target ;

[0014] If N current =N target The dynamic parking points will not be adjusted; the process ends here.

[0015] If N current >N target Then proceed to step S32;

[0016] If N current <N target Then proceed to step S33;

[0017] S32: Calculate the number of dynamic parking spots cancelled, K, and cancel the K dynamic parking spots with the fewest parking times in the parking area designated in the previous period, then end;

[0018] The formula for calculating the number K of dynamic parking spot cancellations is as follows:

[0019]

[0020] Where, N min To set the minimum number of dynamic parking spots within the area;

[0021] S33: Calculate the number of dynamic parking spots M to be added. Based on the parking location data of the temporary parking area of ​​the dynamic parking spots in the area set in the previous period, use the DBSCAN clustering algorithm to identify M parking hotspot areas. Set up 1 dynamic parking spot in each parking hotspot area and end.

[0022] The formula for calculating the increase M of dynamic parking spots is as follows:

[0023]

[0024] Where, N max This sets the maximum number of dynamic parking spots within the designated area.

[0025] Preferably, the method for canceling the K dynamic parking points with the fewest parking times in the designated parking area of ​​the previous cycle in step S32 is as follows: sort the parking times of each dynamic parking point in the designated parking area of ​​the previous cycle in ascending order, and cancel the first K dynamic parking points.

[0026] Preferably, in step S33, the distance between the center of the parking hotspot area identified by the DBSCAN clustering algorithm and the center of other dynamic parking points is greater than a set value D.

[0027] Preferably, the method for setting up one dynamic parking point in the parking hotspot area in step S33 is as follows: take the center of the parking hotspot area as the center of the dynamic parking point, and determine the parking area and temporary parking area according to the center position of the dynamic parking point.

[0028] Preferably, the designated parking area is a circular area with a radius of r and the center of the dynamic parking point as the origin, and the temporary parking area is an annular area with an inner diameter of r and an outer diameter of R and the center of the dynamic parking point as the origin.

[0029] Preferably, parking data includes parking user ID, parking time, parking location, and parking spot ID of the parking spot to which the parking location belongs.

[0030] Preferably, the temporary parking area is used for users to perform temporary parking operations, and the same user is allowed to perform temporary parking operations d times in the designated area within a cycle.

[0031] Temporary parking areas offer greater parking flexibility, while limiting the number of parking sessions per cycle prevents completely disorderly parking. The proximity of temporary parking areas to designated parking areas also facilitates manual maintenance.

[0032] The present invention provides a method for managing shared scooter parking spots, comprising the following steps:

[0033] Set up m static parking spots and n dynamic parking spots within a designated area, N min ≤n≤N max N min To define the minimum number of dynamic parking spots within a given area, N max To set the maximum number of dynamic parking spots within the area;

[0034] The above-mentioned method for optimizing dynamic parking spots for shared scooters is executed every cycle.

[0035] The beneficial effects of this invention are: (1) It can automatically adjust the number and location of dynamic parking spots within a set area, making the dynamic parking spots closer to the actual needs of users in terms of space and time, and providing greater parking flexibility. (2) By automatically canceling inefficient dynamic parking spots and increasing efficient dynamic parking spots, it significantly reduces the manpower, material resources and costs of manual inspection and adjustment of parking spots. (3) It can automatically adjust dynamic parking spots in each cycle, continuously adapting to changes in urban travel patterns (such as the opening of new business districts, seasonal tourism, etc.). (4) By achieving a balance between "completely free parking" and "completely fixed parking", it helps to reduce the phenomenon of random parking. Attached Figure Description

[0036] Figure 1 This is a flowchart of an embodiment. Detailed Implementation

[0037] The technical solution of the present invention will be further described in detail below through embodiments and in conjunction with the accompanying drawings.

[0038] Example: This example describes a method for optimizing dynamic parking spots for shared scooters. Figure 1 As shown, it includes the following steps:

[0039] S1: Obtain historical parking data for the designated area, count the number of times each dynamic parking point in the designated area was used in the previous period, and calculate the total number of times it was used. The parking areas of dynamic parking points include designated parking areas and temporary parking areas.

[0040] A user's parking behavior within the parking area of ​​a dynamic parking spot is counted as one parking instance, and the total number of parking instances is the sum of the number of parking instances within the parking areas of all dynamic parking spots.

[0041] The designated parking area is a circular area with the center of the dynamic parking point as the origin and a radius of r, while the temporary parking area is an annular area with the center of the dynamic parking point as the origin, an inner diameter of r, and an outer diameter of R.

[0042] Parking data includes parking user ID, parking time, parking location, and the parking spot ID of the parking spot to which the parking location belongs;

[0043] S2: Calculate the target number N of dynamic parking spots in the designated area based on the total number of parking times and the preset target parking turnover rate. target ;

[0044] S3: Based on the target number of dynamic parking points N target Adjust the dynamic parking spots within the designated area.

[0045] Number of target dynamic parking points N target The calculation formula is as follows:

[0046]

[0047] Where round(.) is the round function, T R E represents the total number of stops. target The target parking turnover rate is the average number of times a dynamic parking spot is used within a set area per unit period (for example, the target parking turnover rate is an average of 70 times per week at a dynamic parking spot within a set area).

[0048] Step S3 includes the following steps:

[0049] S31: Compare the current number N of dynamic parking spots within the designated area. current Number of target dynamic parking points N target ;

[0050] If N current =N target The dynamic parking points will not be adjusted; the process ends here.

[0051] If N current >N target Then proceed to step S32;

[0052] If N current <N target Then proceed to step S33;

[0053] S32: Calculate the number of dynamic parking spots cancelled, K, and cancel the K dynamic parking spots with the fewest parking times in the parking area designated in the previous period, then end;

[0054] The formula for calculating the number K of dynamic parking spot cancellations is as follows:

[0055]

[0056] Where, N min To set the minimum number of dynamic parking spots within the area;

[0057] The method to cancel the K dynamic parking spots with the fewest parking times in the designated parking area in the previous period is as follows: Sort the number of parking times in the designated parking area for each dynamic parking spot in the previous period in ascending order, and cancel the top K dynamic parking spots;

[0058] S33: Calculate the number of dynamic parking spots added M. Based on the parking location data of the temporary parking area of ​​the dynamic parking spots in the set area in the previous period, use the DBSCAN clustering algorithm to identify M parking hot spots. The distance between the center of the identified parking hot spots and the center of other dynamic parking spots is greater than the set value D. Set 1 dynamic parking spot in each parking hot spot area (that is, set a total of M dynamic parking spots), and end.

[0059] The formula for calculating the increase M of dynamic parking spots is as follows:

[0060]

[0061] Where, N max To set the maximum number of dynamic parking spots within the area;

[0062] The method for setting up a dynamic parking spot in a parking hotspot area is as follows: take the center of the parking hotspot area as the center of the dynamic parking spot, and determine the parking area and temporary parking area based on the center of the dynamic parking spot.

[0063] In this solution, the parking areas of dynamic parking points include designated parking areas and temporary parking areas. Designated parking areas are smaller, allowing users to park an unlimited number of times. Temporary parking areas are larger, providing space for temporary parking. Within a given cycle, each user is allowed to perform d temporary parking operations within the designated area. For example, a designated parking area is a circular area with a radius of 3m centered on the dynamic parking point, while a temporary parking area is a ring-shaped area with an inner diameter of 3m and an outer diameter of 50m centered on the dynamic parking point. Users are allowed 3 temporary parking operations per week within the designated area. Temporary parking areas offer greater parking flexibility, while limiting the number of parking operations per cycle prevents completely disorderly parking. The proximity of temporary parking areas to designated parking areas also facilitates manual maintenance.

[0064] This method first calculates the target number N of dynamic parking spots in a designated area based on a preset target parking turnover rate. target If the current number of dynamic parking spots is N current The number of dynamic parking points is greater than the target number N target If the current number of dynamic parking spots is N, then some inefficient dynamic parking spots will be eliminated, thereby reducing the number of dynamic parking spots and bringing the parking turnover rate of dynamic parking spots closer to the target parking turnover rate; current The number of dynamic parking points is less than the target number N target This would increase the number of dynamic parking spots, thereby bringing the parking turnover rate of dynamic parking spots closer to the target parking turnover rate.

[0065] The final number of parking spots after the reduction of dynamic parking spots cannot be less than the set minimum value N. min To avoid parking difficulties for users due to an insufficient number of dynamic parking spots and to ensure basic service coverage; the final number of dynamic parking spots after additions cannot exceed the set maximum value N. max This is to prevent resource waste and increased operation and maintenance costs caused by overly dense layout.

[0066] When it is necessary to add dynamic parking spots, the DBSCAN clustering algorithm is used to identify parking hotspot areas based on the parking location data of the temporary parking areas of the dynamic parking spots. Dynamic parking spots are then set up in the parking hotspot areas, so that the added dynamic parking spots are closer to the actual needs of users in both spatial and temporal dimensions.

[0067] Preferably, the distance between the center of the parking hotspot area identified by the DBSCAN clustering algorithm and the center of other dynamic parking spots is greater than a set value D, where D ≥ 2R. This setting can effectively avoid the waste of space resources caused by excessively dense dynamic parking spots.

[0068] This method can automatically adjust the number and location of pre-set dynamic parking spots within a designated area, making the dynamic parking spots more closely match users' actual needs in both spatial and temporal dimensions, and providing greater parking flexibility. By automatically canceling inefficient dynamic parking spots and adding efficient ones, it significantly reduces the manpower, material resources, and costs associated with manual inspections and adjustments of parking spots. The automatic adjustment of dynamic parking spots in each cycle can continuously adapt to changes in urban travel patterns (such as the opening of new commercial districts and seasonal tourism). By striking a balance between "completely free parking" and "completely fixed parking," it helps reduce the phenomenon of haphazard parking.

[0069] This embodiment of a shared scooter parking spot management method includes the following steps:

[0070] Set up m static parking spots and n dynamic parking spots within a designated area, N min ≤n≤N max N min To define the minimum number of dynamic parking spots within a given area, N max To set the maximum number of dynamic parking spots within the area;

[0071] The above-mentioned method for optimizing dynamic parking spots for shared scooters is executed every cycle.

[0072] In this scheme, m is a non-negative integer. Initially, m static parking spots and n dynamic parking spots are pre-set within a designated area. The locations of the static parking spots remain fixed. Subsequently, every period (e.g., weekly), the aforementioned shared scooter dynamic parking spot optimization method is executed to dynamically adjust the dynamic parking spots, thereby flexibly adapting to real-time changes in user needs.

[0073] Static parking areas only have designated parking zones; there are no temporary parking zones. If a user's parking location is within both a static parking area and a dynamic parking area, that parking session will be counted as a static parking session, but not as a dynamic parking session.

[0074] Preferably, the parking area of ​​a static parking spot is a circular area with radius f, centered at the center of the static parking spot. The distance between the center of a static parking spot and the center of any dynamic parking spot is greater than E, where E ≥ f + r.

Claims

1. A method for optimizing dynamic parking spots for shared scooters, characterized in that, Includes the following steps: S1: Obtain historical parking data for a designated area, count the number of times each dynamic parking point in the designated area was used in the previous period, and calculate the total number of times it was used. The parking area of ​​the dynamic parking point includes designated parking areas and temporary parking areas. The designated parking area is a circular area with a radius of r and the center of the dynamic parking point as the origin; the temporary parking area is an annular area with an inner diameter of r and an outer diameter of R and the center of the dynamic parking point as the origin. S2: Calculate the target number of dynamic parking spots in the designated area based on the total number of parking sessions and the preset target parking turnover rate. ; S3: Based on the number of target dynamic parking spots Adjust the dynamic parking spots within the designated area; Step S3 includes the following steps: S31: Compare the current number of dynamic parking spots within the designated area. Number of target dynamic parking spots ; if The dynamic parking points will not be adjusted; the process ends here. if Then proceed to step S32; if Then proceed to step S33; S32: Calculate the number of dynamic parking spots cancelled, K, and cancel the K dynamic parking spots with the fewest parking times in the parking area designated in the previous period, then end; The formula for calculating the number K of dynamic parking spot cancellations is as follows: ， in, To set the minimum number of dynamic parking spots within the area; S33: Calculate the number of dynamic parking spots M to be added. Based on the parking location data of the temporary parking area of ​​the dynamic parking spots in the area set in the previous period, use the DBSCAN clustering algorithm to identify M parking hotspot areas. Set up 1 dynamic parking spot in each parking hotspot area and end. The formula for calculating the increase M of dynamic parking spots is as follows: ， in, This sets the maximum number of dynamic parking spots within the designated area.

2. The method for optimizing dynamic parking spots for shared scooters according to claim 1, characterized in that, The number of target dynamic parking points The calculation formula is as follows: ， in, For the round function, Total number of stops The target parking turnover rate is the average number of times a dynamic parking spot is used within a set area per unit period.

3. The method for optimizing dynamic parking spots for shared scooters according to claim 1, characterized in that, The method for canceling the K dynamic parking points with the fewest parking times in the designated parking area of ​​the previous cycle in step S32 is as follows: sort the parking times of each dynamic parking point in the designated parking area of ​​the previous cycle in ascending order, and cancel the top K dynamic parking points.

4. The method for optimizing dynamic parking spots for shared scooters according to claim 1, characterized in that, In step S33, the distance between the center of the parking hotspot area identified by the DBSCAN clustering algorithm and the center of other dynamic parking points is greater than the set value D.

5. The method for optimizing dynamic parking spots for shared scooters according to claim 4, characterized in that, The method for setting up a dynamic parking point in the parking hotspot area in step S33 is as follows: take the center of the parking hotspot area as the center of the dynamic parking point, and determine the parking area and temporary parking area according to the center position of the dynamic parking point.

6. The method for optimizing dynamic parking spots for shared scooters according to claim 1, characterized in that, Parking data includes parking user ID, parking time, parking location, and the parking spot ID of the parking spot to which the parking location belongs.

7. The method for optimizing dynamic parking spots for shared scooters according to claim 1, characterized in that, The temporary parking area is used for users to perform temporary parking operations, and the same user is allowed to perform temporary parking operations d times in the designated area within a cycle.

8. A method for managing shared scooter parking spots, characterized in that, Includes the following steps: Set up m static parking spots and n dynamic parking spots within a designated area. , To set the minimum number of dynamic parking spots within the area, To set the maximum number of dynamic parking spots within the area; The shared scooter dynamic parking point optimization method described in any one of claims 1-7 is executed every cycle.

Images