CN113850310A - Shared bicycle electronic fence planning method based on block subdivision and maximum area coverage - Google Patents

Abstract

The invention belongs to the technical field of information, and discloses a shared bicycle electronic fence planning method based on block subdivision and maximum area coverage. The method comprises the following steps: step 1: acquiring a shared bicycle use data set, and preprocessing the data; step 2: dividing the urban land parcel into finer areas based on the usage records, and solving the parking requirements of the areas; and step 3: selecting an area needing to be provided with the electronic fence by using an area maximum coverage model; and 4, step 4: calculating the capacity of the electronic fence; and 5: and calculating the accurate position for setting the electronic fence. According to the method, the spatial shape of the area is considered when the electronic fence is planned, and the partial coverage condition of the area for obtaining the electronic fence service can be calculated, so that the potential errors in the calculation process are reduced, and the requirement of electronic fence planning in a real scene can be better met.

Description

Shared bicycle electronic fence planning method based on block subdivision and maximum area coverage

Technical Field

The invention belongs to the technical field of information, and particularly relates to a shared bicycle electronic fence planning method based on block subdivision and maximum area coverage.

Background

In recent years, the appearance of shared bicycles provides a more convenient way for residents to go out. People can borrow the car near the starting point and the end point, and the problem of the last kilometer is solved. However, with the popularity of sharing a single vehicle, related urban problems are also raised. A large number of users park vehicles in disorder, occupy public spaces such as sidewalks and the like, and prevent people from going out normally.

In order to standardize the parking behavior of the user, most of the existing researches are theoretically researched from the perspective of social regulations, institutional environments and reward mechanisms, and the user is encouraged to park the vehicle in a proper place by making rules. An electronic fence is a digital infrastructure that specifies a geographic area where a user is allowed to park a vehicle. There is only literature on electronic fence planning for dockside-less bicycle sharing services [ J ]. J.cleanly Production, 2019206: 383-393. An electronic fence planning method based on big data analysis is researched. The author first divides the city into grids, calculates people's parking requirements based on the grids and the collected shared single-vehicle usage records, and then adopts a maximum coverage model to obtain a location where an electronic fence is set, in order to maximize the parking requirements on the premise that a limited fence is set. The implementation in the literature has two drawbacks: 1) they simply divide the city into grids and cannot delineate the precise parking requirements. It is more meaningful to consider road network structure and administrative area division when calculating parking demand. 2) Their approach is based on an ideal assumption that the geographic space (grid) can be abstracted as a point, so that the parking demand of a grid can be represented by a point. However, the parking spots sharing a single vehicle are distributed over the entire area, which assumes that uncertainties and errors are introduced in the calculation of the distance and the evaluation of the degree of coverage.

When planning an electronic fence for a shared bicycle, if an area with real geographic significance can be used as a basic computing unit for parking requirements, and coverage of the electronic fence on a required area can be evaluated by considering coverage rate of an area level, a more accurate electronic fence planning result can be obtained. However, this presents greater challenges for both model building and problem solving.

Disclosure of Invention

The invention aims to design a shared bicycle electronic fence planning method based on block subdivision and maximum area coverage so as to solve the technical problem.

In order to solve the technical problems, the specific technical scheme of the shared bicycle electronic fence planning method based on the plot subdivision and the maximum area coverage is as follows:

a shared bicycle electronic fence planning method based on block subdivision and maximum area coverage comprises the following steps:

step 1: acquiring a shared bicycle use data set, and preprocessing the data;

step 2: dividing the urban land parcel into finer areas based on the usage records, and solving the parking requirements of the areas;

and step 3: selecting an area needing to be provided with the electronic fence by using an area maximum coverage model;

and 4, step 4: calculating the capacity of the electronic fence;

and 5: and calculating the accurate position for setting the electronic fence.

Further, the step 1 comprises the following specific steps:

step 1.1: acquiring usage data sets of the shared bicycle within a period of time, and storing the usage data sets in a database;

a use record R_DBSIs represented as follows:

R_DBS＝(bID,startT,startLoc,endT,endLoc)，

bID is a shared bicycle number, startT and endT are the time of borrowing and returning, startLoc and endLoc are the place of borrowing and returning, and the place comprises longitude and latitude information; step 1.2: preprocessing the shared bicycle data, and removing invalid data;

for each use record, solving corresponding riding distance, time consumption and speed; deleting the record of the riding distance less than 0.2km or more than 15km, deleting the record of the riding speed more than 400 m/min, and deleting the record of the riding time less than 1 minute or more than 3 hours;

step 1.3: obtaining all parking points, calculating the number of vehicles and the total parking requirement;

and obtaining all parking points, namely startLoc and endLoc of all records according to the use records, and calculating to obtain the number bikeNum of vehicles and the total record number tRecNum, wherein the total parking requirement tPackNum is 2 tRecNum.

Further, the step 2 comprises the following steps:

step 2.1: acquiring plot data, mapping all parking points into corresponding plots according to plot boundaries, and calculating to obtain the average-day parking requirement of each plot;

step 2.2: calculating a minimum area enclosing rectangle of each land block (region), wherein the direction of the rectangle is consistent with that of the land block (region), the land block which is transmitted for the first time is called as the land block, and the region which is obtained by subdividing the land block is called as the region;

step 2.3: dividing the plot into smaller regions based on the minimum area bounding rectangle and the plot daily average parking demand;

firstly, finding a perpendicular bisector of a rectangle surrounded by a minimum area on a long side, and dividing a land block into two smaller areas; if the average daily parking demand of the area is less than a predefined threshold T_subdThen the subdivision process is finished and the parking requirement of the area is obtained; otherwise, returning to step 2.2, the region will be iteratively subdivided until a termination condition is met.

Further, the step 3 comprises the following steps:

step 3.1: defining a variable;

defining the following variables, wherein n is the number of required areas, and m is the number of candidate areas for setting the electronic fence; u. of_iRepresenting the average daily parking demand (i is more than or equal to 1 and less than or equal to n) of the ith demand area, p is the preset number of the arranged electronic fences, b_ijIndicates the total number of services (parking amount) provided to the required area i by the electronic fence located in the area j, N_iRepresenting a set of electronic fences, x, that can provide some service to a demand area i_jE {0,1}, when x_jWhen 1, the representation area j is selected as the area for setting the electronic fence, and when x is_j0 denotes that no electronic fence is provided for the area j, λ_iRepresents the total number of all services acquired by the demand area i;

step 3.2: calculating a candidate area for setting the electronic fence;

sequencing the areas according to the average daily parking requirements of the areas, and acquiring m (m < < n) areas with the maximum average daily parking requirements as candidate areas for setting the electronic fence;

step 3.3: optimizing by using the maximum coverage model of the region to obtain the region in which the electronic fence needs to be arranged; the optimized objective function is:

satisfies the following conditions:

the objective function (1) aims at maximizing the overall coverage provided by the fence, and the constraint (2) limits λ by summing the total coverage obtained by the demand region i from all the fence satisfying the conditions_iConstraint (3) defines an upper bound u of total coverage that can be obtained for each demand area i_iA constraint (4) limiting the number of set electronic fences, and a constraint (5) determining a variable x_jCarrying out binary limitation; finally calculating the model to obtain the area number of the electronic fence to be set and the allocated parking demand number pdNum of each electronic fence_j。

Further, the step 4 comprises the following steps:

defining the quantity set of the electronic fences, and calculating to obtain the actual capacity pdNum of the jth electronic fence according to the total vehicle number bikeNum, the total parking requirement tParkNum and the number of the parking requirements distributed to each electronic fence_jAnd (bikeNum/tParkNum), selecting the closest numerical value from a preset quantity set according to the actual capacity, thereby obtaining the final capacity of the electronic fence.

Further, the step 5 comprises the following steps:

and clustering all the parking points in one area by using a DBSCAN method, finding the cluster with the maximum number of the parking points in all the clusters, and selecting the center of the cluster as the accurate position for setting the fence.

The shared bicycle electronic fence planning method based on the block subdivision and the maximum area coverage has the following advantages: the method is characterized by being innovated and characterized by providing a novel shared bicycle electronic fence planning method based on big data analysis. The method comprises the following steps that firstly, urban land parcels are subdivided into regions, the region is divided by considering not only road structures and administrative boundaries but also parking requirements of the regions, and compared with the existing method, the method has the advantages that urban space is divided more reasonably, and more meaningful parking requirements can be obtained; and then calculating the area needing to set the fence by adopting an area maximum coverage model. The existing method abstracts the area into one point, and the parking requirement of one area can only be completely met or not met during model optimization, but the invention considers the space shape of the area during planning the electronic fence and can calculate the partial coverage condition of the area for obtaining the electronic fence service, thereby reducing the potential error in the calculation process and better meeting the requirement of electronic fence planning in the real scene.

Drawings

FIG. 1 is a general flow chart of a shared bicycle electronic fence planning method based on parcel subdivision and maximum coverage of an area in accordance with the present invention;

fig. 2 is a schematic diagram of the land parcel subdivision process of the present invention.

Detailed Description

In order to better understand the purpose, structure and function of the present invention, the following describes a shared bicycle electronic fence planning method based on plot subdivision and maximum area coverage in detail with reference to the accompanying drawings.

As shown in fig. 1, a shared bicycle electronic fence planning method based on plot subdivision and maximum coverage of an area includes the following steps:

step 1: and acquiring a shared bicycle use data set, and preprocessing the data.

Step 1.1: usage data sets for a shared bicycle over a period of time are obtained and stored in a database.

A use record R_DBSIs represented as follows:

R_DBS＝(bID,startT,startLoc,endT,endLoc)

bID is the number of the shared bicycle, startT and endT are the time of borrowing and returning, startLoc and endLoc are the location of borrowing and returning, and the location includes longitude and latitude information.

Step 1.2: and preprocessing the shared bicycle data and removing invalid data.

And (4) solving corresponding riding distance, time consumption and speed for each piece of the usage record. Since too short a trip may be caused by vehicle failure or GPS positioning error, while too long a trip may be caused by people forgetting to return to the vehicle or vehicle maintenance, records that are less than 0.2km or more than 15km in distance traveled are deleted, and records that take less than 1 minute or more than 3 hours are deleted. In addition, the records of riding speeds greater than 400 m/min were deleted.

Step 1.3: obtaining all parking spots, calculating the number of vehicles and the total parking demand.

From the usage records, all parking points, i.e., startLoc and endLoc of all records are obtained. And calculating to obtain the number bikeNum of vehicles and the total recorded number tRecNum. The total parking demand tParkNum is 2 × tRecNum.

Step 2: the city plot is divided into finer areas based on the usage records, and the parking requirements of the areas are solved. As shown in fig. 2, step 2 includes the following steps:

step 2.1: and acquiring plot data, mapping all parking points to corresponding plots according to plot boundaries, and calculating the average-day parking requirement of each plot.

Step 2.2: the minimum area of each land (region) is calculated to encompass a rectangle whose direction coincides with the direction of the land (region). The land parcel which is first introduced is referred to as a "land parcel", and the region into which the land parcel is subdivided is referred to as a "region".

Step 2.3: the plot is divided into smaller regions based on the minimum area bounding rectangle and the plot mean-daily parking requirements.

First find the perpendicular bisector of the minimum area bounding rectangle on the long side, divide the plot into two smaller regions. If the average daily parking demand of the area is less than a predefined threshold T_subdThe subdivision process is ended and the parking requirements for the area are obtained. Otherwise, returning to step 2.2, the region will be iteratively subdivided until a termination condition is met.

And step 3: and selecting the area needing to set the electronic fence by using the area maximum coverage model.

Step 3.1: variables are defined.

Variables are defined such that n is the number of required regions and m is the number of candidate regions for setting the electronic fence. u. of_iAnd the average daily parking requirement (i is more than or equal to 1 and less than or equal to n) of the ith requirement area is represented. p is the predetermined number of set-up electronic fences. b_ijIndicating the total number of services (parking) provided to the required area i by the electronic fence located in the area j. N is a radical of_iRepresenting a set of electronic fences that can provide some service to the demand area i. x is the number of_jE {0,1}, when x_jWhen 1, the representation area j is selected as the area for setting the electronic fence, and when x is_j0 indicates that the area j is not provided with an electronic fence. Lambda [ alpha ]_iRepresenting the total number of all services acquired by the demand area i.

Step 3.2: candidate areas for setting the electronic fence are calculated.

The areas are sorted according to the average daily parking requirements of the areas, and m (m < < n) areas with the largest average daily parking requirements are obtained and serve as candidate areas for setting the electronic fence.

Step 3.3: and optimizing to obtain the area needing to set the electronic fence by using the area maximum coverage model.

The optimized objective function is:

satisfies the following conditions:

the objective function (1) is to maximize the overall coverage provided by the electronic fence. Constraint (2) limits λ by summing the total coverage obtained by the demand region i from all the eligible electronic fences_i. Constraint (3) defines an upper bound u of total coverage that can be obtained for each demand region i_i. The constraint (4) limits the number of electronic fences that can be set. Constraint (5) on decision variable x_jA binary restriction is performed. Finally calculating the model to obtain the area number of the electronic fence to be set and the allocated parking demand number pdNum of each electronic fence_j。

And 4, step 4: and calculating the capacity of the electronic fence.

A set of numbers, such as 10,20,30,50, is defined that the electronic fence can be set. Calculating to obtain the jth electricity according to the total number bikeNum of vehicles, the total parking requirement tParkNum and the number of parking requirements distributed by each electronic fenceActual capacity pdNum of sub-fence_j(bikeNum/tParakNum). And selecting the closest numerical value from the preset quantity set according to the actual capacity so as to obtain the final capacity of the electronic fence.

And 5: and calculating the accurate position for setting the electronic fence.

And clustering all the parking points in one area by using a DBSCAN method, finding the cluster with the maximum number of the parking points in all the clusters, and selecting the center of the cluster as the accurate position for setting the fence.

It is to be understood that the present invention has been described with reference to certain embodiments, and that various changes in the features and embodiments, or equivalent substitutions may be made therein by those skilled in the art without departing from the spirit and scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed, but that the invention will include all embodiments falling within the scope of the appended claims.

Claims (6)

1. A shared bicycle electronic fence planning method based on block subdivision and maximum area coverage is characterized by comprising the following steps:

step 1: acquiring a shared bicycle use data set, and preprocessing the data;

step 2: dividing the urban land parcel into finer areas based on the usage records, and solving the parking requirements of the areas;

and step 3: selecting an area needing to be provided with the electronic fence by using an area maximum coverage model;

and 4, step 4: calculating the capacity of the electronic fence;

and 5: and calculating the accurate position for setting the electronic fence.

2. The shared bicycle electronic fence planning method based on block subdivision and maximum coverage of an area according to claim 1, wherein the step 1 comprises the following specific steps:

step 1.1: acquiring usage data sets of the shared bicycle within a period of time, and storing the usage data sets in a database;

a use record R_DBSIs represented as follows:

R_DBS＝(bID,startT,startLoc,endT,endLoc)，

bID is a shared bicycle number, startT and endT are the time of borrowing and returning, startLoc and endLoc are the place of borrowing and returning, and the place comprises longitude and latitude information;

step 1.2: preprocessing the shared bicycle data, and removing invalid data;

for each use record, solving corresponding riding distance, time consumption and speed; deleting the record of the riding distance less than 0.2km or more than 15km, deleting the record of the riding speed more than 400 m/min, and deleting the record of the riding time less than 1 minute or more than 3 hours;

step 1.3: obtaining all parking points, calculating the number of vehicles and the total parking requirement;

and obtaining all parking points, namely startLoc and endLoc of all records according to the use records, and calculating to obtain the number bikeNum of vehicles and the total record number tRecNum, wherein the total parking requirement tPackNum is 2 tRecNum.

3. The method for shared bicycle electronic fence planning based on block subdivision and maximum coverage of an area according to claim 2, wherein the step 2 comprises the steps of:

step 2.1: acquiring plot data, mapping all parking points into corresponding plots according to plot boundaries, and calculating to obtain the average-day parking requirement of each plot;

step 2.2: calculating a minimum area enclosing rectangle of each land block (region), wherein the direction of the rectangle is consistent with that of the land block (region), the land block which is transmitted for the first time is called as the land block, and the region which is obtained by subdividing the land block is called as the region;

step 2.3: dividing the plot into smaller regions based on the minimum area bounding rectangle and the plot daily average parking demand;

firstly, finding a perpendicular bisector of a rectangle surrounded by a minimum area on a long side, and dividing a land block into two smaller areas; if the average daily parking demand of the area is less than a predefined threshold T_subdThen the subdivision process is finished and the parking requirement of the area is obtained; otherwise, returning to step 2.2, the region will be iteratively subdivided until a termination condition is met.

4. The method for shared bicycle electronic fence planning based on parcel subdivision and maximum coverage of an area according to claim 3, wherein said step 3 comprises the steps of:

step 3.1: defining a variable;

defining the following variables, wherein n is the number of required areas, and m is the number of candidate areas for setting the electronic fence; u. of_iRepresenting the average daily parking demand (i is more than or equal to 1 and less than or equal to n) of the ith demand area, p is the preset number of the arranged electronic fences, b_ijIndicates the total number of services (parking amount) provided to the required area i by the electronic fence located in the area j, N_iRepresenting a set of electronic fences, x, that can provide some service to a demand area i_jE {0,1}, when x_jWhen 1, the representation area j is selected as the area for setting the electronic fence, and when x is_j0 denotes that no electronic fence is provided for the area j, λ_iRepresents the total number of all services acquired by the demand area i;

step 3.2: calculating a candidate area for setting the electronic fence;

sequencing the areas according to the average daily parking requirements of the areas, and acquiring m (m < < n) areas with the maximum average daily parking requirements as candidate areas for setting the electronic fence;

step 3.3: optimizing by using the maximum coverage model of the region to obtain the region in which the electronic fence needs to be arranged;

the optimized objective function is:

satisfies the following conditions:

the objective function (1) aims at maximizing the overall coverage provided by the fence, and the constraint (2) limits λ by summing the total coverage obtained by the demand region i from all the fence satisfying the conditions_iConstraint (3) defines an upper bound u of total coverage that can be obtained for each demand area i_iA constraint (4) limiting the number of set electronic fences, and a constraint (5) determining a variable x_jCarrying out binary limitation; finally calculating the model to obtain the area number of the electronic fence to be set and the allocated parking demand number pdNum of each electronic fence_j。

5. The method for shared bicycle electronic fence planning based on block subdivision and maximum coverage of an area according to claim 4, wherein the step 4 comprises the steps of:

defining the quantity set of the electronic fences, and calculating to obtain the actual capacity pdNum of the jth electronic fence according to the total vehicle number bikeNum, the total parking requirement tParkNum and the number of the parking requirements distributed to each electronic fence_jAnd (bikeNum/tParkNum), selecting the closest numerical value from a preset quantity set according to the actual capacity, thereby obtaining the final capacity of the electronic fence.

6. The method for shared bicycle electronic fence planning based on parcel subdivision and maximum coverage of an area according to claim 5, wherein said step 5 comprises the steps of:

and clustering all the parking points in one area by using a DBSCAN method, finding the cluster with the maximum number of the parking points in all the clusters, and selecting the center of the cluster as the accurate position for setting the fence.

Images