[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN113850310A - Planning method of shared bicycle electronic fence based on plot subdivision and maximum coverage of area - Google Patents

Planning method of shared bicycle electronic fence based on plot subdivision and maximum coverage of area Download PDF

Info

Publication number
CN113850310A
CN113850310A CN202111086544.0A CN202111086544A CN113850310A CN 113850310 A CN113850310 A CN 113850310A CN 202111086544 A CN202111086544 A CN 202111086544A CN 113850310 A CN113850310 A CN 113850310A
Authority
CN
China
Prior art keywords
area
electronic fence
plot
parking
demand
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202111086544.0A
Other languages
Chinese (zh)
Other versions
CN113850310B (en
Inventor
史晓颖
梁紫怡
僧德文
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Dianzi University
Original Assignee
Hangzhou Dianzi University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hangzhou Dianzi University filed Critical Hangzhou Dianzi University
Priority to CN202111086544.0A priority Critical patent/CN113850310B/en
Publication of CN113850310A publication Critical patent/CN113850310A/en
Application granted granted Critical
Publication of CN113850310B publication Critical patent/CN113850310B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/23—Clustering techniques
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28—Databases characterised by their database models, e.g. relational or object models
    • G06F16/284—Relational databases
    • G06F16/285—Clustering or classification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29—Geographical information databases
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00—Road transport of goods or passengers
    • Y02T10/10—Internal combustion engine [ICE] based vehicles
    • Y02T10/40—Engine management systems

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Evolutionary Computation (AREA)
  • Evolutionary Biology (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Artificial Intelligence (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Remote Sensing (AREA)
  • Traffic Control Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

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 RDBSIs represented as follows:
RDBS＝(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 TsubdThen 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. ofiRepresenting 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, bijIndicates the total number of services (parking amount) provided to the required area i by the electronic fence located in the area j, NiRepresenting a set of electronic fences, x, that can provide some service to a demand area ijE {0,1}, when xjWhen 1, the representation area j is selected as the area for setting the electronic fence, and when x isj0 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:
Figure BDA0003265763990000041
satisfies the following conditions:
Figure BDA0003265763990000042
Figure BDA0003265763990000043
Figure BDA0003265763990000044
Figure BDA0003265763990000045
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 conditionsiConstraint (3) defines an upper bound u of total coverage that can be obtained for each demand area iiA constraint (4) limiting the number of set electronic fences, and a constraint (5) determining a variable xjCarrying 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 fencej。
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 fencejAnd (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 RDBSIs represented as follows:
RDBS＝(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 TsubdThe 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. ofiAnd 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. bijIndicating 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 ofiRepresenting a set of electronic fences that can provide some service to the demand area i. x is the number ofjE {0,1}, when xjWhen 1, the representation area j is selected as the area for setting the electronic fence, and when x isj0 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:
Figure BDA0003265763990000081
satisfies the following conditions:
Figure BDA0003265763990000082
Figure BDA0003265763990000083
Figure BDA0003265763990000084
Figure BDA0003265763990000085
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 fencesi. Constraint (3) defines an upper bound u of total coverage that can be obtained for each demand region ii. The constraint (4) limits the number of electronic fences that can be set. Constraint (5) on decision variable xjA 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 fencej。
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-fencej(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.一种基于地块细分和区域最大覆盖的共享单车电子围栏规划方法，其特征在于，包括如下步骤：1. a shared bicycle electronic fence planning method based on plot subdivision and area maximum coverage, is characterized in that, comprises the steps: 步骤1：获取共享单车使用数据集，并对数据进行预处理；Step 1: Obtain the shared bicycle usage data set and preprocess the data; 步骤2：基于使用记录将城市地块划分为更精细的区域，并求出区域的停车需求；Step 2: Divide the urban plot into finer areas based on the usage records, and find out the parking demand of the area; 步骤3：利用区域最大覆盖模型选择需要设置电子围栏的区域；Step 3: Use the area maximum coverage model to select the area where the electronic fence needs to be set; 步骤4：计算电子围栏的容量；Step 4: Calculate the capacity of the electronic fence; 步骤5：计算设置电子围栏的精确位置。Step 5: Calculate the precise location to set the electronic fence. 2.根据权利要求1所述的基于地块细分和区域最大覆盖的共享单车电子围栏规划方法，其特征在于，所述步骤1包括如下具体步骤：2. The shared bicycle electronic fence planning method based on plot subdivision and area maximum coverage according to claim 1, wherein the step 1 comprises the following specific steps: 步骤1.1：获取一段时间内共享单车的使用数据集，将它们存储在数据库中；Step 1.1: Obtain a data set of shared bicycle usage over a period of time and store them in a database; 一条使用记录RDBS表示如下：A usage record R DBS is represented as follows: RDBS＝(bID,startT,startLoc,endT,endLoc)，R DBS = (bID, startT, startLoc, endT, endLoc), 其中bID为共享单车编号，startT和endT为借车时间和还车时间，startLoc和endLoc为借车地点和还车地点，地点包括经度和纬度信息；Where bID is the shared bicycle number, startT and endT are the time of borrowing and returning the car, startLoc and endLoc are the location of borrowing and returning the car, and the location includes longitude and latitude information; 步骤1.2：对共享单车数据进行预处理，移除无效数据；Step 1.2: Preprocess the shared bicycle data to remove invalid data; 对每一条使用记录，求得相应的骑行距离、耗时和速度；删除骑行距离小于0.2km或大于15km的记录，删除耗时小于1分钟或大于3小时的记录，删除骑行速度大于400米/分钟的记录；For each usage record, obtain the corresponding riding distance, time-consuming and speed; delete the records whose riding distance is less than 0.2km or more than 15km, delete the records whose riding distance is less than 1 minute or more than 3 hours, and delete the records whose riding speed is more than 3 hours. 400 m/min record; 步骤1.3：获得所有停车点、计算车辆数和总停车需求；Step 1.3: Get all parking spots, count vehicles and total parking needs; 根据使用记录，获得所有停车点，即所有记录的startLoc和endLoc,计算得到车辆数bikeNum和总记录数tRecNum，总停车需求tParkNum为2*tRecNum。According to the usage records, obtain all parking points, namely startLoc and endLoc of all records, calculate the number of vehicles bikeNum and the total number of records tRecNum, and the total parking demand tParkNum is 2*tRecNum. 3.根据权利要求2所述的基于地块细分和区域最大覆盖的共享单车电子围栏规划方法，其特征在于，所述步骤2包括如下步骤：3. The shared bicycle electronic fence planning method based on plot subdivision and area maximum coverage according to claim 2, wherein the step 2 comprises the following steps: 步骤2.1：获取地块数据，根据地块边界将所有停车点映射到相应的地块中，计算得到每个地块的日均停车需求；Step 2.1: Obtain the plot data, map all parking points to the corresponding plots according to the plot boundaries, and calculate the daily average parking demand of each plot; 步骤2.2：计算每个地块(区域)的最小面积包围矩形，该矩形的方向和地块(区域)的方向一致,将第一次传入的地块称为“地块”，对地块细分得到的区域称为“区域”；Step 2.2: Calculate the minimum area enclosing rectangle of each plot (region), the direction of the rectangle is the same as the direction of the plot (region), the first incoming plot is called "plot", and the direction of the plot is the same as that of the plot (region). The subdivided area is called "area"; 步骤2.3：基于最小面积包围矩形和地块日均停车需求将地块划分为更小的区域；Step 2.3: Divide the plot into smaller areas based on the minimum area enclosing rectangle and the average daily parking demand of the plot; 首先找到最小面积包围矩形在长边上的垂直平分线，将地块划分为两个更小的区域；如果区域的日均停车需求小于预定义的阈值Tsubd，那么细分过程结束，同时获得该区域的停车需求；否则，回到步骤2.2，区域将被迭代地进行细分，直到满足终止条件。First, find the vertical bisector of the minimum area enclosing rectangle on the long side, and divide the plot into two smaller areas; if the average daily parking demand of the area is less than the predefined threshold T subd , then the subdivision process ends, and at the same time obtain Parking demand for this area; otherwise, going back to step 2.2, the area will be iteratively subdivided until the termination condition is met. 4.根据权利要求3所述的基于地块细分和区域最大覆盖的共享单车电子围栏规划方法，其特征在于，所述步骤3包括如下步骤：4. The shared bicycle electronic fence planning method based on plot subdivision and area maximum coverage according to claim 3, wherein the step 3 comprises the following steps: 步骤3.1：定义变量；Step 3.1: Define variables; 定义如下变量，n为需求区域的数量，m为设置电子围栏的候选区域数量；ui表示第i个需求区域的日均停车需求(1≤i≤n)，p为预先给定的设置电子围栏的数量，bij表示坐落于区域j的电子围栏提供给需求区域i的服务(停车量)总数，Ni表示能为需求区域i提供一些服务的电子围栏集合，xj∈{0,1}，当xj＝1时，表示区域j被选为设置电子围栏的区域，当xj＝0表示区域j不设置电子围栏，λi表示需求区域i获得的所有服务的总数；Define the following variables, n is the number of demand areas, m is the number of candidate areas for setting electronic fences; u i represents the daily average parking demand of the i-th demand area (1≤i≤n), and p is the preset electronic fence. The number of fences, b ij represents the total number of services (parking amount) provided by the electronic fences located in the area j to the demand area i, N i represents the set of electronic fences that can provide some services for the demand area i, x j ∈ {0,1 }, when x j =1, it means that the area j is selected as the area where the electronic fence is set, when x j =0 means that the electronic fence is not set in the area j, and λ i represents the total number of all services obtained by the demand area i; 步骤3.2：计算设置电子围栏的候选区域；Step 3.2: Calculate the candidate area for setting the electronic fence; 根据区域的日均停车需求对区域进行排序，获取日均停车需求最大的m(m<<n)个区域作为设置电子围栏的候选区域；Sort the areas according to the average daily parking demand of the area, and obtain m (m<<n) areas with the largest daily parking demand as candidate areas for setting electronic fences; 步骤3.3：利用区域最大覆盖模型优化得到需要设置电子围栏的区域；Step 3.3: Use the area maximum coverage model to optimize to obtain the area where the electronic fence needs to be set; 优化的目标函数为：The optimized objective function is:
Figure FDA0003265763980000031
Figure FDA0003265763980000031
 满足：Satisfy:
Figure FDA0003265763980000032
Figure FDA0003265763980000032
Figure FDA0003265763980000033
Figure FDA0003265763980000033
Figure FDA0003265763980000034
Figure FDA0003265763980000034
Figure FDA0003265763980000035
Figure FDA0003265763980000035
 目标函数(1)旨在最大化电子围栏所提供的整体覆盖，约束(2)通过求和需求区域i从所有满足条件的电子围栏中获得的总覆盖来限制λi，约束(3)定义每个需求区域i可以获得的总覆盖的上界ui，约束(4)对设置电子围栏的数量进行限制，约束(5)对决策变量xj进行二元限制；模型最终计算得到需要设置电子围栏的区域编号和每个电子围栏被分配的停车需求数pdNumj。Objective function (1) aims to maximize the overall coverage provided by the geo-fence, constraint (2) limits λ i by summing the total coverage obtained by demand area i from all the geo-fences that satisfy the condition, and constraint (3) defines each The upper bound ui of the total coverage that can be obtained for each demand area i , constraint (4) limits the number of electronic fences, and constraint (5) imposes binary restrictions on the decision variable x j ; the model finally calculates that it is necessary to set electronic fences The zone number and the number of parking needs assigned to each electric fence pdNum j . 5.根据权利要求4所述的基于地块细分和区域最大覆盖的共享单车电子围栏规划方法，其特征在于，所述步骤4包括如下步骤：5. The shared bicycle electronic fence planning method based on plot subdivision and area maximum coverage according to claim 4, wherein the step 4 comprises the following steps: 定义电子围栏设置的数量集合，根据总车辆数bikeNum、总停车需求tParkNum和每个电子围栏被分配的停车需求数，计算得到第j个电子围栏的实际容量pdNumj*(bikeNum/tParkNum),根据实际容量，在预设的数量集合中选取得到最接近的一个数值，从而得到电子围栏的最终容量。Define the number set of electronic fence settings, and calculate the actual capacity of the jth electronic fence pdNum j *(bikeNum/tParkNum) according to the total number of vehicles bikeNum, the total parking demand tParkNum and the number of parking requirements allocated to each electronic fence, according to For the actual capacity, select the closest value from the preset quantity set to obtain the final capacity of the electronic fence. 6.根据权利要求5所述的基于地块细分和区域最大覆盖的共享单车电子围栏规划方法，其特征在于，所述步骤5包括如下步骤：6. The shared bicycle electronic fence planning method based on plot subdivision and area maximum coverage according to claim 5, wherein the step 5 comprises the following steps: 使用DBSCAN方法对落在一个区域中的所有停车点进行聚类，找到所有聚类中具有最多停车点数量的聚类，将该聚类的中心选为设置围栏的精确位置。Use the DBSCAN method to cluster all the parking points that fall in an area, find the cluster with the largest number of parking points among all the clusters, and select the center of the cluster as the precise location for setting the fence.
CN202111086544.0A 2021-09-16 2021-09-16 Shared bicycle electronic fence planning method based on land block subdivision and regional maximum coverage Active CN113850310B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111086544.0A CN113850310B (en) 2021-09-16 2021-09-16 Shared bicycle electronic fence planning method based on land block subdivision and regional maximum coverage

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111086544.0A CN113850310B (en) 2021-09-16 2021-09-16 Shared bicycle electronic fence planning method based on land block subdivision and regional maximum coverage

Publications (2)

Publication Number Publication Date
CN113850310A true CN113850310A (en) 2021-12-28
CN113850310B CN113850310B (en) 2024-11-29

Family

ID=78974298

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111086544.0A Active CN113850310B (en) 2021-09-16 2021-09-16 Shared bicycle electronic fence planning method based on land block subdivision and regional maximum coverage

Country Status (1)

Country Link
CN (1) CN113850310B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114897656A (en) * 2022-07-15 2022-08-12 深圳市城市交通规划设计研究中心股份有限公司 Shared bicycle tidal area parking dispersion method, electronic equipment and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108764555A (en) * 2018-05-22 2018-11-06 浙江大学城市学院 A kind of shared bicycle based on Hadoop parks a site selecting method
CN111881939A (en) * 2020-06-24 2020-11-03 东南大学 A method for the layout of shared bicycle parking areas based on clustering algorithm
CN112927058A (en) * 2021-04-06 2021-06-08 徐州工程学院 Urban public bicycle rental lot layout and scheduling method based on user demands

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108764555A (en) * 2018-05-22 2018-11-06 浙江大学城市学院 A kind of shared bicycle based on Hadoop parks a site selecting method
CN111881939A (en) * 2020-06-24 2020-11-03 东南大学 A method for the layout of shared bicycle parking areas based on clustering algorithm
CN112927058A (en) * 2021-04-06 2021-06-08 徐州工程学院 Urban public bicycle rental lot layout and scheduling method based on user demands

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114897656A (en) * 2022-07-15 2022-08-12 深圳市城市交通规划设计研究中心股份有限公司 Shared bicycle tidal area parking dispersion method, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN113850310B (en) 2024-11-29

Similar Documents

Publication Publication Date Title
CN112907103B (en) A method for dynamic supply and demand balance of shared bicycles
CN111881939B (en) A method for the layout of shared bicycle parking areas based on clustering algorithm
CN110555544B (en) A Traffic Demand Estimation Method Based on GPS Navigation Data
CN106651027B (en) An optimization method of Internet shuttle bus route based on social network
CN109508865A (en) The dispositions method of bicycle is shared in subway station radiation scope based on space-time use pattern
CN110210749B (en) A method for determining the amount and placement of shared bicycles connected to rail sites
CN114021883A (en) Dispatching method for subway transfer shared bicycle in peak period
Arias-Molinares et al. Exploring the spatio-temporal dynamics of moped-style scooter sharing services in urban areas
CN111914940B (en) Shared vehicle station clustering method, system, device and storage medium
CN110032609A (en) A kind of life range recognition methods based on location data
CN108470033A (en) A kind of city public bicycle system borrows the visual analysis method of also pattern
CN111428154A (en) Multi-view visual interaction analysis method of bicycle GPS data based on quadtree partition optimization
CN108388970A (en) A kind of bus station site selecting method based on GIS
CN111429166A (en) Spatial distribution prediction method of electric vehicle charging demand based on maximum contour clustering
CN116644886A (en) Method, device, terminal and medium for evaluating transformation value of stock land
CN113850310B (en) Shared bicycle electronic fence planning method based on land block subdivision and regional maximum coverage
CN110414795A (en) A new high-speed rail hub accessibility impact method based on an improved two-step mobile search method
CN119047337B (en) Road engineering design modeling method and system based on BIM 3D visualization technology
CN106130110B (en) The electric taxi charging station constant volume method on trip ground is selected based on stratified probability
Yang Research on optimization strategies for urban park green space planning in Nanjing based on GIS from the perspectives of network analysis and Thiessen polygon theory
CN113868553B (en) Layered taxi passenger carrying recommendation method and system
CN111723871B (en) Estimation method for real-time carriage full load rate of bus
CN118687587A (en) Vehicle travel diversion method, terminal device and storage medium
CN114579884B (en) Method and system for displaying travel of shared bicycle in urban built-up area
Fang et al. Estimating optimal substitution scale of urban gasoline taxis by electric taxis in the era of green energy: a case study of Zhengzhou City

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant