CN117610833A - Dot layout method and device - Google Patents
Dot layout method and device Download PDFInfo
- Publication number
- CN117610833A CN117610833A CN202311567865.1A CN202311567865A CN117610833A CN 117610833 A CN117610833 A CN 117610833A CN 202311567865 A CN202311567865 A CN 202311567865A CN 117610833 A CN117610833 A CN 117610833A
- Authority
- CN
- China
- Prior art keywords
- index data
- points
- point
- tie
- sub
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 88
- 238000012545 processing Methods 0.000 claims description 22
- 230000005012 migration Effects 0.000 claims description 11
- 238000013508 migration Methods 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 10
- 239000011230 binding agent Substances 0.000 claims description 9
- 239000002131 composite material Substances 0.000 claims 1
- 238000004891 communication Methods 0.000 description 18
- 230000006870 function Effects 0.000 description 8
- 230000008569 process Effects 0.000 description 8
- 101100063942 Neurospora crassa (strain ATCC 24698 / 74-OR23-1A / CBS 708.71 / DSM 1257 / FGSC 987) dot-1 gene Proteins 0.000 description 5
- 230000008901 benefit Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000012216 screening Methods 0.000 description 3
- 230000001364 causal effect Effects 0.000 description 2
- 239000007795 chemical reaction product Substances 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000004927 fusion Effects 0.000 description 2
- 238000011835 investigation Methods 0.000 description 2
- 239000000047 product Substances 0.000 description 2
- 230000000750 progressive effect Effects 0.000 description 2
- 239000002344 surface layer Substances 0.000 description 2
- 108010001267 Protein Subunits Proteins 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 238000012417 linear regression Methods 0.000 description 1
- 230000006386 memory function Effects 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06313—Resource planning in a project environment
-
- 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/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2462—Approximate or statistical queries
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0637—Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
- G06Q10/06375—Prediction of business process outcome or impact based on a proposed change
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0201—Market modelling; Market analysis; Collecting market data
- G06Q30/0202—Market predictions or forecasting for commercial activities
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Development Economics (AREA)
- General Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Marketing (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Probability & Statistics with Applications (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- General Engineering & Computer Science (AREA)
- Fuzzy Systems (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Remote Sensing (AREA)
- Biodiversity & Conservation Biology (AREA)
- Life Sciences & Earth Sciences (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method and a device for layout of net points, which relate to the technical field of finance, and the method comprises the following steps: determining an equal time circle of a plurality of net points in a set geographic range; acquiring index data of the net points according to the equal time circle; combining the index data, and selecting a point of removing the grid from the plurality of points; selecting a sub-geographic range which is not covered by the equal time circle of the plurality of network points from the set geographic range; and migrating the point to be evacuated to the sub-geographic range. The invention can efficiently, accurately and scientifically perform the dot layout, thereby realizing the optimized layout of the dots.
Description
Technical Field
The invention relates to the technical field of finance, in particular to a method and a device for layout of net points.
Background
The website can be a service window and a marketing site set according to the requirements of clients, and can comprise a banking website, an express website, a sales website, a business hall website, a chain store website and the like. By scientifically distributing the network points, the network point efficiency and the client experience can be improved.
The existing network point layout method mainly comprises a manual layout method and a resource endowment method. The manual layout method has the problems of high labor cost, long period, uneven standard deviation, single information source, and the like, and relies on subjective judgment of surface layer data, so that the efficiency and benefit of the network point layout method are low; the resource endowment method mainly comprises data statistics in equidistant ranges and judgment of the dot pile-up condition, and has larger difference from the actual condition, and the dot layout method has lower accuracy. That is, the existing dot layout methods cannot efficiently, accurately and scientifically perform dot layout.
In view of the above problems, no effective solution has been proposed at present.
Disclosure of Invention
The embodiment of the specification provides a dot layout method and device, which are used for solving the problem that the dot layout cannot be efficiently, accurately and scientifically performed in the prior art.
In a first aspect, embodiments of the present disclosure provide a dot layout method, including:
determining an equal time circle of a plurality of net points in a set geographic range;
acquiring index data of the net points according to the equal time circle;
combining the index data, and selecting a point of removing the grid from the plurality of points;
selecting a sub-geographic range which is not covered by the equal time circle of the plurality of network points from the set geographic range;
and migrating the point to be evacuated to the sub-geographic range.
In one embodiment, the index data includes resource index data and savings potential index data, the savings potential index data being derived from a savings potential index prediction model, the savings potential index prediction module being established from the resource index data.
In one embodiment, the resource indicator data includes point of interest data, demographic data, peer data, and enterprise data; correspondingly, the storage potential index prediction model is established according to the resource index data, and comprises the following steps:
Establishing a storage potential index prediction model according to the following formula:
savings potential index data = point of interest data x point of interest coefficient + demographic data x demographic coefficient + contemporaneous data x contemporaneous coefficient + enterprise data x enterprise coefficient.
In one embodiment, the method further comprises:
sequentially determining the overlapping area of the equal time circles of each of the plurality of mesh points;
sequentially judging whether the overlapping area of the equal time circles of each net point is larger than a preset overlapping area threshold value;
selecting a corresponding net point when the overlapping area is larger than a preset overlapping area threshold value from the judging result, and taking the net point as a tie-up net point;
correspondingly, the combining index data selects a point of withdrawal from the plurality of points, including:
and combining the index data of the tie-pile net points, and selecting out the withdrawal net points from the tie-pile net points.
In one embodiment, the combining the index data of the pile-up dots and selecting the withdrawal dots from the pile-up dots includes:
determining the comprehensive ranking of the tie-up net points according to the resource index data of the tie-up net points;
and selecting out the withdrawal grid points from the tie-up grid points according to the comprehensive ranking of the tie-up grid points and the storage potential index data of the tie-up grid points.
In one embodiment, the determining the comprehensive ranking of the tie-up dots according to the resource index data of the tie-up dots includes:
Obtaining a grading value of resource index data of the tie-pile net points;
and carrying out summation processing on the scoring values of the resource index data of the tie-up net points, and ranking the tie-up net points according to the summation processing result to obtain the comprehensive ranking of the tie-up net points.
In one embodiment, the selecting the withdrawal point from the tie-up points according to the comprehensive ranking of the tie-up points and the storage potential index data of the tie-up points includes:
comparing the comprehensive ranking of the tie-up net points with a preset net point comprehensive ranking threshold value, and selecting a first target comprehensive ranking smaller than the preset net point comprehensive ranking threshold value from the comparison result;
comparing the storage potential index data of the tie-up net points with a preset net point storage potential threshold value, and selecting first target storage potential index data smaller than the preset net point storage potential threshold value from the comparison result;
and selecting the network points corresponding to the first target comprehensive ranking and the first target storage potential index data from the tie-up network points as the withdrawal network points.
In one embodiment, the method further comprises:
calling a scoring rule of preset land resource index data;
obtaining scoring values of the resource index data of a plurality of plots in the sub-geographic range according to scoring rules of the resource index data of the preset plots;
Determining the comprehensive ranking of the plurality of plots in the sub-geographic range according to the scoring values of the resource index data of the plurality of plots in the sub-geographic range;
acquiring storage potential index data of a plurality of plots in a sub-geographic range, and selecting a recommended plot from the sub-geographic range according to the comprehensive ranking of the plots in the sub-geographic range and the storage potential index data of the plots in the sub-geographic range;
accordingly, the migrating the point of withdrawal to the sub-geographic range includes:
and migrating the point to be evacuated to the recommended land parcel.
In one embodiment, the scoring rule of the preset land resource index data includes:
sequentially assigning a preset grading value to the resource index data of the designated land block and the resource index data of the adjacent land block of the designated land block in the sub-geographic range;
according to a preset assignment formula, assigning values to the rest plots except the designated plots and the adjacent plots in the sub-geographic range to obtain scoring values of resource index data of the rest plots; wherein, the preset assignment formula comprises:
the scoring value of the resource index data of the remaining plots=the index number of the preceding plot of the own plot/the index number of the own plot x the preset scoring value.
In one embodiment, the selecting the recommended land parcel from the sub-geographic scope according to the comprehensive ranking of the plurality of land parcel in the sub-geographic scope and the storage potential index data of the plurality of land parcel in the sub-geographic scope comprises:
comparing the comprehensive ranks of the plurality of plots with a preset comprehensive rank threshold value of the plots, and selecting a second target comprehensive rank greater than the preset comprehensive rank threshold value of the plots from the comparison result;
comparing the storage potential index data of the plurality of plots with a preset plot storage potential threshold value, and selecting second target storage potential index data which is larger than the preset plot storage potential threshold value from the comparison result;
and selecting the land block corresponding to the second target comprehensive ranking and the second target storage potential index data from the sub-geographic range as a recommended land block.
In a second aspect, embodiments of the present disclosure further provide a dot layout apparatus, including:
the determining module is used for determining the equal time circle of a plurality of network points in the set geographic range;
the acquisition module is used for acquiring index data of the network points according to the equal time circle;
the withdrawal point selecting module is used for selecting withdrawal points from the plurality of points by combining the index data;
The sub-geographic range selection module is used for selecting a sub-geographic range which is not covered by the equal time circle of the plurality of network points from the set geographic range;
and the migration module is used for migrating the point to be evacuated to the sub-geographic range.
In a third aspect, the present embodiment further provides a dot layout apparatus, including a processor and a memory for storing instructions executable by the processor, where the processor executes the instructions to implement the dot layout method in the above embodiment.
In a fourth aspect, the present description embodiment also provides a computer-readable storage medium storing a computer program which, when executed by a processor, implements the dot layout method in the above embodiment.
In a fifth aspect, the present description embodiment also provides a computer program product comprising a computer program which, when executed by a processor, implements the dot layout method of the above embodiment.
The embodiment of the specification provides a method and a device for dot layout, firstly, an equal time circle of a plurality of dots in a set geographic range is determined. Next, an equal time period for a plurality of dots within the set geographic area is determined. And then, combining the index data, and selecting the point of withdrawal from the plurality of points. And selecting a sub-geographic range which is not covered by the equal time circle of the plurality of network points from the set geographic range. And finally, migrating the point to be evacuated to the sub-geographic range. In the embodiment of the specification, the index data of the mesh points can be accurately and rapidly acquired based on the equal time circle of the mesh points in the set geographic range by determining the equal time circle of the mesh points in the set geographic range. By combining the index data of the mesh points, the accuracy of mesh point selection can be improved. By determining the sub-geographic range, a reference basis can be provided for the migration of the point to be removed, so that the point to be removed can be migrated to the sub-geographic range accurately, efficiently and scientifically, and the optimal layout of the point is realized.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art. In the drawings:
fig. 1 is a schematic flow chart of a dot layout method according to an embodiment of the present disclosure;
FIG. 2 is a schematic diagram of a 15 minute walk waiting hour circle provided by an embodiment of the present disclosure;
FIG. 3 is a schematic illustration of a tie-up dot provided in an embodiment of the present disclosure;
FIG. 4 is a schematic diagram of a network point coverage land parcel provided by an embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of a dot layout device according to an embodiment of the present disclosure;
fig. 6 is a schematic structural composition of an electronic device provided in an embodiment of the present disclosure.
Detailed Description
In order to make the technical solutions in the present specification better understood by those skilled in the art, the technical solutions in the embodiments of the present specification will be clearly and completely described below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only some embodiments of the present specification, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are intended to be within the scope of the present disclosure.
The website can be a service window and a marketing site set according to the requirements of clients, and can comprise a banking website, an express website, a sales website, a business hall website, a chain store website and the like. By scientifically distributing the network points, the network point efficiency and the client experience can be improved.
The existing dot layout method mainly comprises the following two steps:
(1) The manual layout method comprises the following steps: the surrounding passenger flows of the alternative places, the environment matching and the like are researched in the field by personnel, and then a decision is made by combining a certain expert experience to carry out layout of the network points.
(2) The resource endowment method comprises the following steps: dividing cities according to grids with fixed specifications, counting data in equidistant ranges, and finally guiding layout work through comprehensive analysis of the data. The resource endowment refers to a statistical value with financial resource meaning obtained by calculating various population, classmates, enterprises and the like in an area through a certain rule.
The existing dot layout method mainly has the following problems:
(1) The manual layout method comprises the following steps: the method has the advantages of high labor cost, long period, uneven standard deviation, single information source, dependence on subjective judgment of surface layer data and the like, so that the efficiency and benefit of the dot layout method are low.
(2) The resource endowment method comprises the following steps: the method does not consider the complex space situation in cities or towns, and has larger access to the isochronous range which is actually combined with traffic situation through data statistics in the equidistant range and judgment of the network point bundling situation, and the network point layout method has lower accuracy.
Aiming at the problems and the specific reasons for generating the problems in the prior art, the method and the device for arranging the network points are considered to be introduced, so that the problems of low efficiency, estimated benefit deviation and the like in the prior art are solved, the network points can be arranged accurately and efficiently at lower cost, and the optimal layout of the network points is realized.
Based on the above-mentioned thought, the present specification proposes a dot layout method, first, determining an equal time period of a plurality of dots within a set geographical range. And secondly, acquiring index data of the network points according to the equal time period. And then, combining the index data, and selecting the point of withdrawal from the plurality of points. Then, a sub-geographic range which is not covered by the equal time circles of the plurality of network points is selected from the set geographic range. And finally, migrating the point to be evacuated to the sub-geographic range.
Fig. 1 is a schematic flow chart of a dot layout method according to an embodiment of the present disclosure. Although the description provides methods and apparatus structures as shown in the examples or figures described below, more or fewer steps or modular units may be included in the methods or apparatus, whether conventionally or without inventive effort. In the steps or the structures where there is no necessary causal relationship logically, the execution order of the steps or the module structure of the apparatus is not limited to the execution order or the module structure shown in the embodiments or the drawings of the present specification. The described methods or module structures may be implemented in a device, server or end product in practice, in a sequential or parallel fashion (e.g., parallel processor or multi-threaded processing environments, or even distributed processing, server cluster implementations) as shown in the embodiments or figures. In particular, referring to fig. 1, the method may include the following.
S101: an equal time period for a plurality of dots within a set geographic range is determined.
In some embodiments, the above-mentioned set geographical range may be set according to actual requirements, which is not specifically limited in this specification, for example: when the network points in the city are required to be laid out, a certain area can be selected from the city to be used as a set geographic range; when the network points in the villages and towns are required to be laid out, a certain area can be selected from the villages and towns to be used as a set geographical range.
In some embodiments, the isochrone is an area range formed by taking a certain network point as a central point and reaching each departure point of the network point in a certain time through a traffic mode such as walking, driving, riding and the like. The method can be used for selecting proper traffic modes (such as walking, driving, public transportation and the like) and time ranges according to the development conditions of the current city or village and town, and acquiring the isochronal circles of a plurality of network points in the set geographic range (namely the isochronal circles of a plurality of network points in the city or village and town) through a map service provider interface (such as a service provider interface of a hundred-degree map and a high-altitude map).
By acquiring the isochrone of a plurality of net points in a set geographical range, a foundation can be laid for accurately and rapidly acquiring index data of the net points in the follow-up process. The scheme can flexibly adjust the set geographical range, so that the equal time period of a plurality of network points in different set geographical ranges can be acquired, and the flexibility and applicability of network point layout are improved.
S102: and acquiring index data of the net points according to the equal time circle.
In some embodiments, the index data may include resource index data and savings potential index data, the savings potential index data being obtained from a savings potential index prediction model, the savings potential index prediction module being established from the resource index data.
In some embodiments, the resource indicator data samples may include point of interest data, demographic data, peer data, and enterprise data; correspondingly, the storage potential index prediction model is established according to the resource index data, and when in implementation, the method can comprise the following steps:
establishing a storage potential index prediction model according to the following formula:
savings potential index data = point of interest data x point of interest coefficient + demographic data x demographic coefficient + contemporaneous data x contemporaneous coefficient + enterprise data x enterprise coefficient.
In some embodiments, the resource index data of the mesh point may be obtained by counting the data in the equal time period of a plurality of mesh points, for example, may be obtained: point of interest data, demographic data, peer data, and enterprise data, among others. The point of interest data may be POI data, where the POI data refers to a category of geographic location information, and may be used to describe related data of a specific location or area, where the POI data generally includes information such as a name, longitude and latitude, an address, a phone number, and a category of the location.
In some embodiments, the deposit potential indicator data in the indicator data may be a deposit amount that can be absorbed in a future period of time. Wherein, the higher the storage potential index data, the better the management performance of the future website can be represented.
In some embodiments, the point of interest data, population data, peer data, and business data corresponding coefficients with the trained point of interest data, population data, peer data, and business data may be processed through a linear regression model, and a savings potential index prediction model is constructed based on a linear sum of the point of interest data, population data, peer data, and business data corresponding coefficients with the trained point of interest data, population data, peer data, and business data.
In some embodiments, the resource index data may further include traffic line data, and the resource index data is not specifically limited in this specification. When the resource index data may further include traffic route data, the storage potential index prediction model constructed above may further be:
storage potential index data=point of interest data×point of interest coefficient+population data×population coefficient+homonymy data×homonymy coefficient+enterprise data×enterprise coefficient+traffic line data×traffic line coefficient.
It should be noted that, the storage potential indicator prediction model is not limited to the above examples, and those skilled in the art may also make other changes (for example, the storage potential indicator prediction model may be adjusted according to actual resource indicator data) in the light of the technical spirit of the embodiments of the present disclosure, but all the functions and effects that are achieved by the storage potential indicator prediction model are all covered by the protection scope of the embodiments of the present disclosure as long as they are the same as or similar to the embodiments of the present disclosure.
It should be noted that, the information data related to the user in the present application is obtained and used on the premise that the user knows and agrees. And, the information data is acquired, stored, used, processed and the like, which meet the relevant regulations of national laws and regulations.
The resource index data of the network points are acquired by counting the resource index data in the equal time period of the network points, so that the on-site investigation is not needed manually, the labor cost is saved, and the data acquisition efficiency is improved. By acquiring index data in the equal time period of a plurality of network points, a data basis can be provided for the subsequent combination of the index data and screening of the network points.
S103: and combining the index data, and selecting the point of withdrawal from the plurality of points.
In some embodiments, the point of withdrawal may also be referred to as a point of stay, by selecting the point of withdrawal from a plurality of points, the mesh point can be migrated in a targeted way, so that the migration efficiency of the mesh point is improved.
In some embodiments, before selecting the point to be connected from the plurality of points in combination with the index data, when implementing the method, the method may further include:
sequentially determining the overlapping area of the equal time circles of each of the plurality of mesh points;
Sequentially judging whether the overlapping area of the equal time circles of each net point is larger than a preset overlapping area threshold value;
and selecting the corresponding net points with the overlapping area larger than the preset overlapping area threshold value from the judging result as the tie net points.
In some embodiments, the number of the pile-up dots may be one or more, and the pile-up dots may be corresponding dots when the overlapping area of the equal time period is greater than a preset overlapping area threshold. Whether the mesh points are piled up or not is judged by considering the actual distribution condition of the mesh points in a set geographical range (in cities or villages and towns), and then the mesh points to be migrated are determined from the piled mesh points, so that the layout of the mesh points can be accurately and scientifically carried out.
In some embodiments, when screening the binder dots, the overlapping area of the equal time period of each dot in the plurality of dots may be determined (the overlapping area of the equal time period of each dot may be the sum of the overlapping areas of the equal time period of each dot and the equal time periods of other dots except the own dot), then whether the area of the equal time period of each dot is greater than a preset overlapping area threshold value is sequentially determined, and finally, the dot corresponding to the case that the overlapping area is greater than the preset overlapping area threshold value is selected as the binder dot. For example: the plurality of dots may include a dot 1, a dot 2, and a dot 3, wherein an overlapping area of an equal time period of the dot 1 and an equal time period of the dot 2 is 3, an overlapping area of an equal time period of the dot 1 and an equal time period of the dot 3 is 2, and a sum of overlapping areas of the equal time periods of the dot 1 is 5; the overlapping area of the equal time circle of the net point 2 and the equal time circle of the net point 1 is 3, the overlapping area of the equal time circle of the net point 2 and the equal time circle of the net point 3 is 4, and the sum of the overlapping areas of the equal time circles of the net point 2 is 7; the overlapping area of the equal time period of the halftone dot 3 and the equal time period of the halftone dot 1 is 2, the overlapping area of the equal time period of the halftone dot 3 and the equal time period of the halftone dot 2 is 4, and the sum of the overlapping areas of the equal time periods of the halftone dot 3 is 6. The preset overlapping area threshold value can be set as 6, whether the overlapping area of the equal time circles of the mesh points 1, 2 and 3 is larger than the preset overlapping area threshold value can be sequentially judged, and the judgment result shows that the overlapping area 7 of the equal time circle of the mesh point 2 is larger than the preset overlapping area threshold value 6, and the mesh point 2 is the tie-up mesh point. It should be noted that the preset overlap area threshold may be set according to actual requirements, which is not specifically limited in this specification.
In some embodiments, after determining the pile-up dots, correspondingly, the combining index data selects the mesh-point from the plurality of dots, and when implementing, the method may include:
and combining the index data of the tie-pile net points, and selecting out the withdrawal net points from the tie-pile net points.
In some embodiments, after the tie-up dots are determined, the index data of the tie-up dots can be queried from the index data of the dots, and then the withdrawal dots are selected from the tie-up dots by combining the index data of the tie-up dots, so that the accuracy of selecting the withdrawal dots is improved, and the optimized layout of the dots can be accurately realized.
In some embodiments, the combining the index data of the pile-up dots and selecting the withdraw mesh point from the pile-up dots may include:
determining the comprehensive ranking of the tie-up net points according to the resource index data of the tie-up net points;
and selecting out the withdrawal grid points from the tie-up grid points according to the comprehensive ranking of the tie-up grid points and the storage potential index data of the tie-up grid points.
In some embodiments, the determining the comprehensive ranking of the binder dots according to the resource index data of the binder dots may include:
Obtaining a grading value of resource index data of the tie-pile net points;
and carrying out summation processing on the scoring values of the resource index data of the tie-up net points, and ranking the tie-up net points according to the summation processing result to obtain the comprehensive ranking of the tie-up net points.
In some embodiments, a scoring rule of the preset website index data may be pre-fetched, and a scoring value of the resource index data of the tie-up website may be obtained according to the scoring rule of the preset website index data. The scoring rule of the preset website index data may be: sequentially giving a preset grading value to the resource index data of the designated dots and the resource index data of the connected dots of the designated dots; thirdly, according to a preset assignment formula, assigning values to other nodes except the appointed node and the adjacent nodes in the tie-pile nodes to obtain scoring values of resource index data of the other nodes; wherein, the preset assignment formula comprises: the score value of the resource index data of the remaining dots=the index number of the preceding dot of the own dot/the index number of the own dot x the preset score value. For example: the node A, the node B, the node C, the node D … … and the like are piled up to count 10 nodes, each node has a plurality of index data, the scoring value of the enterprise number of the index data is taken as an example, the enterprise number of each node can be respectively 1, 2, 3 and 4 … …, the first 10% of the nodes in the piled up nodes are taken as designated nodes, namely the node A in the piled up nodes is taken as designated node A, the enterprise number of the designated node A can be given to 10 points (the preset scoring value can be set according to actual requirements), the enterprise number of the adjacent node B of the designated node A is given to 10 points, the scoring value of the enterprise number of the node C can be calculated by using a preset scoring formula, namely the scoring value of the enterprise number of the node C = 2/3 x 10 = 6.67 points of the enterprise number of the previous node B of the node C, the scoring value of the enterprise number of the node D = 4 x 10 = 7.5 points of the enterprise number of the previous node C of the node C, and the like can be obtained by analogy. The scoring values of other resource index data in the tie-up net point A, B, C, D … … can be obtained in the same manner, and finally the scoring values of the resource index data of the tie-up net point can be obtained.
In some embodiments, after obtaining the scoring values of the resource index data of the tie-pile nodes, the scoring values of the resource index data of each tie-pile node may be summed (e.g., in a weighted summation manner), and then ranking each tie-pile node according to the result of the summation processing, to finally obtain a comprehensive ranking of the tie-pile nodes, for example: the summation processing result corresponding to the scoring value of the resource index data of the tie-up net point A is 10, the summation processing result corresponding to the scoring value of the resource index data of the tie-up net point B is 15, the summation processing result corresponding to the scoring value of the resource index data of the tie-up net point C is 20, the tie-up net point A, B, C is ranked (for example, the ranking can be performed in the order from small to large) based on the summation processing result, the comprehensive ranking of the tie-up net point A is finally smaller than the comprehensive ranking of the tie-up net point B, the comprehensive ranking of the tie-up net point B is smaller than the comprehensive ranking of the tie-up net point C, namely, the comprehensive ranking of the tie-up net point A can be 3, the comprehensive ranking of the tie-up net point B can be 2, and the comprehensive ranking of the tie-up net point C is 1. After the comprehensive ranking of the tie-up net points is obtained, the withdrawal net points can be selected from the tie-up net points according to the comprehensive ranking of the tie-up net points and the storage potential index data of the tie-up net points.
In some embodiments, the selecting the point to be removed from the tie-pile nodes according to the comprehensive ranking of the tie-pile nodes and the storage potential index data of the tie-pile nodes may include:
comparing the comprehensive ranking of the tie-up net points with a preset net point comprehensive ranking threshold value, and selecting a first target comprehensive ranking smaller than the preset net point comprehensive ranking threshold value from the comparison result;
comparing the storage potential index data of the tie-up net points with a preset net point storage potential threshold value, and selecting first target storage potential index data smaller than the preset net point storage potential threshold value from the comparison result;
and selecting the network points corresponding to the first target comprehensive ranking and the first target storage potential index data from the tie-up network points as the withdrawal network points.
In some embodiments, from the tie-up dots, the corresponding dot when the comprehensive ranking of the tie-up dots is smaller than the preset dot comprehensive ranking threshold and the storage potential index data of the tie-up dots is smaller than the preset dot storage potential threshold can be selected as the withdrawal dot. For example: in the tie-up net point A, B, C, the comprehensive ranking of the tie-up net point A is smaller than the preset net point comprehensive ranking threshold, and the storage potential index data of the tie-up net point A is smaller than the preset net point storage potential threshold, the tie-up net point A can be used as a withdrawal net point. Or, if the comprehensive ranking of the tie-up net point A is smaller than the preset net point comprehensive ranking threshold, and the storage potential index data of the tie-up net point B is smaller than the preset net point storage potential threshold, the tie-up net point A, B can be used as a withdrawal net point. Namely, the selection criteria of the point of withdrawal at least comprise three: the withdrawal point belongs to the binding point, the storage potential index data of the withdrawal point is smaller (namely, the storage potential index data of the withdrawal point is smaller than the preset point storage potential threshold), the comprehensive ranking of the withdrawal point is lower (namely, the sum of the scoring values of the resource index data of the withdrawal point is lower, namely, the comprehensive ranking of the withdrawal point is smaller than the preset point comprehensive ranking threshold), and the withdrawal point can be selected by referring to the three standards. The preset website saving potential threshold value and the preset website comprehensive ranking threshold value may be set according to actual requirements, which is not particularly limited in the present specification.
The method is characterized in that the bundling situation of the network points is considered, namely the actual distribution situation of the network points in a set geographical range (such as a city or a village) is considered, the comprehensive ranking of the network points and the storage potential index data of the network points are considered, namely the resource distribution situation of the network points in the set geographical range (such as the city or the village) is considered, the grid point is removed by comprehensively considering the bundling situation of the network points, the comprehensive ranking of the network points and the storage potential index data of the network points, and the multi-angle and multi-type data fusion mode is used for selecting the grid point, so that the accuracy of the grid point selection is effectively improved, and a scientific layout foundation for realizing the grid point is laid.
S104: and selecting a sub-geographic range which is not covered by the equal time circles of the plurality of network points from the set geographic range.
In some embodiments, multiple plots may be included in the sub-geographic scope. The centers of the plurality of plots in the sub-geographic range are not in the equal time circles of the plurality of net points, and when the centers of the plurality of plots are not in the equal time circles of the plurality of net points, the sub-geographic range is judged to be not covered by the equal time circles of the plurality of net points. The land block can be obtained according to urban grid division.
In some embodiments, after selecting the sub-geographic range not covered by the equal-time circles of the plurality of dots from the set geographic range, in a specific implementation, the method may further include:
Calling a scoring rule of preset land resource index data;
obtaining scoring values of the resource index data of a plurality of plots in the sub-geographic range according to scoring rules of the resource index data of the preset plots;
determining the comprehensive ranking of the plurality of plots in the sub-geographic range according to the scoring values of the resource index data of the plurality of plots in the sub-geographic range;
and acquiring storage potential index data of the plurality of plots in the sub-geographic range, and selecting a recommended plot from the sub-geographic range according to the comprehensive ranking of the plurality of plots in the sub-geographic range and the storage potential index data of the plurality of plots in the sub-geographic range.
In some embodiments, after determining the sub-geographic range not covered by the equal time periods of the plurality of sites, the equal time periods of the plurality of plots in the sub-geographic range or the sub-geographic range may be acquired through a map server interface such as a hundred-degree map, then the resource index data in the equal time periods of the plurality of plots is counted, the resource index data in the equal time periods of the plurality of plots is processed by using the storage potential index prediction model, and the storage potential index data of the plurality of plots may be obtained.
In some embodiments, after obtaining the scoring values of the resource index data of the plurality of plots in the sub-geographic scope, the scoring values of the resource index data of the plurality of plots in the sub-geographic scope may be summed (e.g., in a weighted summation manner), and then ranking the plots in the sub-geographic scope according to the result of the summation processing of the scoring values of the resource index data of the plurality of plots in the sub-geographic scope, thereby finally obtaining the comprehensive ranking of the plurality of plots in the sub-geographic scope. The comprehensive ranking process of the plurality of plots may be similar to that of the tie-up net point, and will not be described in detail herein. After the comprehensive ranking of the plurality of plots is obtained, the recommended plots can be selected from the plurality of plots in the sub-geographic range by combining the storage potential index data of the plurality of plots in the sub-geographic range, so that a reference basis can be provided for newly building or site migration or migration work of the network points.
The resource index data of the plurality of plots and the storage potential index data of the plurality of plots are the resource index data and the storage potential index data in the equal time period of the plurality of plots, and are collectively represented by the resource index data of the plurality of plots and the storage potential index data of the plurality of plots in order to avoid confusion.
In some embodiments, the scoring rule of the preset land resource index data may include, when implemented:
sequentially assigning a preset grading value to the resource index data of the designated land block and the resource index data of the adjacent land block of the designated land block in the sub-geographic range;
according to a preset assignment formula, assigning values to the rest plots except the designated plots and the adjacent plots in the sub-geographic range to obtain scoring values of resource index data of the rest plots; wherein, the preset assignment formula comprises:
the scoring value of the resource index data of the remaining plots=the index number of the preceding plot of the own plot/the index number of the own plot x the preset scoring value.
In some embodiments, the scoring rule of the preset land parcel resource index data may refer to the scoring rule of the preset website index data, which is not described in detail in the present specification. The scoring values of the resource index data of a plurality of plots in the sub-geographic range can be accurately and rapidly obtained by calling the scoring rule of the resource index data of the preset plots.
In some embodiments, the selecting the recommended land parcel from the sub-geographic scope according to the comprehensive ranking of the plurality of land parcel in the sub-geographic scope and the storage potential index data of the plurality of land parcel in the sub-geographic scope may include, when implemented:
comparing the comprehensive ranks of the plurality of plots with a preset comprehensive rank threshold value of the plots, and selecting a second target comprehensive rank greater than the preset comprehensive rank threshold value of the plots from the comparison result;
comparing the storage potential index data of the plurality of plots with a preset plot storage potential threshold value, and selecting second target storage potential index data which is larger than the preset plot storage potential threshold value from the comparison result;
and selecting the land block corresponding to the second target comprehensive ranking and the second target storage potential index data from the sub-geographic range as a recommended land block.
In some embodiments, a plot corresponding to a plot with a comprehensive ranking greater than a preset plot comprehensive ranking threshold and a plot with a storage potential index data greater than a preset plot storage potential threshold may be selected from the sub-geographic range as the recommended plot. Such as: and selecting the land block with higher comprehensive ranking (namely, the sum of scoring values of the resource index data of the land block is higher, namely, the comprehensive ranking of the land block is larger than a preset land block comprehensive ranking threshold) and the land block with higher storage potential value (namely, the storage potential index data of the land block is larger than a preset land block storage potential threshold) as recommended land blocks. The preset plot comprehensive ranking threshold value and the preset plot storage potential threshold value may be set according to actual requirements, which is not particularly limited in this specification.
By selecting the land plots with higher comprehensive ranking and higher storage potential value, accurate and reliable reference basis can be improved for migration of the net points, and a foundation is laid for follow-up accurate, scientific and efficient net point layout.
S105: and migrating the point to be evacuated to the sub-geographic range.
In some embodiments, the foregoing migration of the point of withdrawal to the sub-geographic range may include, when implemented:
and migrating the point to be evacuated to the recommended land parcel.
In some embodiments, the network point layout can be scientifically, efficiently and accurately performed by selecting the point to be removed and the recommended land block and then transferring the point to be removed to the recommended land block, so that the optimal layout of the network points is realized.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. Specific reference may be made to the foregoing description of related embodiments of the related process, which is not described herein in detail.
The foregoing description of the present method has been presented for purposes of illustration, but it is noted that the specific embodiments are merely illustrative of the application and are described in the specification. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
The above method is described below in connection with a specific embodiment, however, it should be noted that this specific embodiment is only for better illustrating the present application and is not meant to be a undue limitation on the present application.
In the implementation, firstly, the equal time period of a plurality of network points in a set geographic range (such as a city or a village) is acquired through a map service provider interface (such as a service provider interface of a hundred-degree map and a high-Germany map). Then, counting the data in the equal time circle of a plurality of net points in the set geographical range, and obtaining the index data of the net points, such as: the method comprises the steps of establishing a storage potential index prediction model by utilizing the resource index data of the website (such as interest point data, population data, homonymy data, enterprise data, traffic line data and the like) and the storage potential index data of the website, wherein the storage potential index data of the website can be obtained according to the storage potential index prediction model. And then determining the overlapping area of the equal time circles of each of the plurality of mesh points, judging whether the overlapping area of the equal time circles of each of the plurality of mesh points is larger than a preset overlapping area threshold value, and selecting the mesh point corresponding to the mesh point with the overlapping area larger than the preset overlapping area threshold value from the judging result as a bundling mesh point. After the tie-up net points are selected, the resource index data of the tie-up net points can be obtained from the resource index data of the net points, the comprehensive ranking of the tie-up net points is determined according to the resource index data of the tie-up net points, and finally the withdrawal net points are selected from the tie-up net points according to the comprehensive ranking of the tie-up net points and the storage potential index data of the tie-up net points (for example, the withdrawal net points can be selected from the tie-up net points and have smaller storage potential index data (namely, the storage potential index data of the withdrawal net points is smaller than the storage potential threshold of the preset net points), and the comprehensive ranking of the withdrawal net points is lower (namely, the comprehensive ranking of the withdrawal net points is smaller than the comprehensive ranking threshold of the preset net points) as the withdrawal net points.
After the point of withdrawal is selected, a sub-geographical range which is not covered by the equal time periods of the plurality of points can be selected from a set geographical range, then the equal time periods of the plurality of plots in the sub-geographical range or the sub-geographical range are acquired through a map service provider interface such as a hundred-degree map, then the resource index data in the equal time periods of the plurality of plots are counted, the resource index data in the equal time periods of the plurality of plots are processed by utilizing a storage potential index prediction model, and the storage potential index data of the plurality of plots can be obtained. And then determining the grading value of the resource index data of the plurality of plots in the sub-geographic range, determining the comprehensive ranking of the plurality of plots in the sub-geographic range according to the grading value of the resource index data of the plurality of plots in the sub-geographic range, and selecting the plots with higher comprehensive ranking of the plurality of plots and higher comprehensive ranking of the plurality of plots (namely, the comprehensive ranking of the plurality of plots is larger than a preset plot comprehensive ranking threshold value and the storage potential index data of the plurality of plots is larger than a preset plot storage potential threshold value) from the sub-geographic range according to the comprehensive ranking of the plurality of plots in the sub-geographic range and the storage potential index data of the plurality of plots in the sub-geographic range as recommended plots.
After the withdrawal points and the recommended land parcels are screened, the withdrawal points can be transferred to the recommended land parcels, so that scientific, accurate and efficient optimization layout of the points is realized.
In a specific scenario example, the layout of the dots is described with the set geographic scope as the city:
referring to fig. 2, fig. 2 shows a 15-minute walk waiting period, that is, an irregular area may be formed by walking for 15 minutes with a four-flat-round cell as a net point (center point), that is, a 15-minute walk waiting period. After the equal time period is obtained, the resource index data such as the same business number, the enterprise number, the population number, the POI number, the traffic line number and the like in the equal time period of the network points can be counted, the scoring value of each resource index of each network point is determined, and the comprehensive ranking of the network points can be determined according to the scoring value of the resource index. And then, the trained storage potential index prediction model can be utilized to process resource index data such as the same industry number, the enterprise number, various population numbers, the POI number, the traffic line number and the like, so as to obtain storage potential index data of the network points. Finally, the size of the overlapping area between the equal time circles of each dot can be analyzed to determine whether the dot is piled up or whether the piled up dot exists (the overlapping area is larger than the preset overlapping area threshold value, which is piled up), the schematic diagram of the piled up dot is shown in fig. 3, and the dark overlapping part in the black frame is the overlapping part between the equal time circles of the dot. The method can use the comprehensive ranking of the nodes, the comprehensive ranking of the nodes and the storage potential index data of the nodes as the standard or the criterion for judging and selecting the withdrawal nodes in the plurality of nodes to select from the binder nodes, and uses the nodes with lower comprehensive ranking of the nodes and lower storage potential index data as the withdrawal nodes or the nodes to be migrated.
After screening out the point of withdrawal, the land block which is not covered by the point in the city can be screened out, namely, the center point of the land block is not in the equal time circle, and the land block in the rectangular frame is the land block covered by the point, namely, the center point of the land block in the rectangular frame is in the equal time circle as shown in the figure 4; the land outside the rectangular frame is the land not covered by the net points, namely the center point of the land outside the rectangular frame is not in the equal time circle.
After determining the land which is not covered by the net points, the equal time circle of the land can be obtained, and the resource index data such as the same industry number, the enterprise number, the population number, the POI number, the traffic line number and the like in the equal time circle in the land are counted, and then the land with higher resource index ranking and higher storage potential value is selected from the land which is not covered by the net points to be used as the land with recommended setting points, namely the recommended land.
And finally, directly transferring the point to be removed or the point to be transferred to the recommended land parcel.
Although the present description provides the method operational steps or apparatus configurations illustrated in the following examples or fig. 5, more or fewer operational steps or modular units may be included in the method or apparatus, either conventionally or without the inventive effort. In the steps or the structures where there is no necessary causal relationship logically, the execution order of the steps or the module structure of the apparatus is not limited to the execution order or the module structure shown in the embodiments or the drawings of the present specification. The described methods or module structures may be implemented in a device, server or end product in practice, in a sequential or parallel fashion (e.g., parallel processor or multi-threaded processing environments, or even distributed processing, server cluster implementations) as shown in the embodiments or figures.
Based on the above-mentioned dot layout method, the present specification also proposes an embodiment of a dot layout device. As shown in fig. 5, the apparatus may specifically include the following modules:
a determining module 501, configured to determine an equal time period for a plurality of dots within a set geographic range;
the acquiring module 502 may be configured to acquire index data of the website according to the equal time period;
the point of withdrawal selecting module 503 may be configured to combine the index data to select a point of withdrawal from the plurality of points;
a sub-geographic range selection module 504, configured to select a sub-geographic range from a set geographic range that is not covered by the equal time periods of the plurality of dots;
a migration module 505 may be configured to migrate the point of withdrawal to the sub-geographic range.
In one embodiment, the index data in the obtaining module 502 may include resource index data and savings potential index data, where the savings potential index data is obtained according to a savings potential index prediction model, and the savings potential index prediction module is established according to the resource index data.
In one embodiment, the resource index data in the acquiring module 502 may include point of interest data, population data, peer data, and enterprise data; accordingly, the storage potential index prediction model is established according to the resource index data, and may include:
Establishing a storage potential index prediction model according to the following formula:
savings potential index data = point of interest data x point of interest coefficient + demographic data x demographic coefficient + contemporaneous data x contemporaneous coefficient + enterprise data x enterprise coefficient.
In one embodiment, the above-mentioned withdrawal dot selection module 503 may be specifically configured to sequentially determine an overlapping area of the equal time periods of each of the plurality of dots; sequentially judging whether the overlapping area of the equal time circles of each net point is larger than a preset overlapping area threshold value; selecting a corresponding net point when the overlapping area is larger than a preset overlapping area threshold value from the judging result, and taking the net point as a tie-up net point; and combining the index data of the tie-pile net points, and selecting out the withdrawal net points from the tie-pile net points.
In one embodiment, the above-mentioned withdrawal node selection module 503 may be further specifically configured to determine a comprehensive ranking of the tie-up nodes according to the resource index data of the tie-up nodes; and selecting out the withdrawal grid points from the tie-up grid points according to the comprehensive ranking of the tie-up grid points and the storage potential index data of the tie-up grid points.
In one embodiment, the above-mentioned withdrawal point selection module 503 may be further specifically configured to obtain a scoring value of the resource index data of the tie-up point; and carrying out summation processing on the scoring values of the resource index data of the tie-up net points, and ranking the tie-up net points according to the summation processing result to obtain the comprehensive ranking of the tie-up net points.
In one embodiment, the above-mentioned withdrawal node selection module 503 may be further specifically configured to compare the comprehensive ranking of the tie-up node with a preset node comprehensive ranking threshold, and select a first target comprehensive ranking smaller than the preset node comprehensive ranking threshold from the comparison result; comparing the storage potential index data of the tie-up net points with a preset net point storage potential threshold value, and selecting first target storage potential index data smaller than the preset net point storage potential threshold value from the comparison result; and selecting the network points corresponding to the first target comprehensive ranking and the first target storage potential index data from the tie-up network points as the withdrawal network points.
In one embodiment, the sub-geographic scope selection module 504 may be specifically configured to call a scoring rule of the preset land parcel resource index data; obtaining scoring values of the resource index data of a plurality of plots in the sub-geographic range according to scoring rules of the resource index data of the preset plots; determining the comprehensive ranking of the plurality of plots in the sub-geographic range according to the scoring values of the resource index data of the plurality of plots in the sub-geographic range; and acquiring storage potential index data of the plurality of plots in the sub-geographic range, and selecting a recommended plot from the sub-geographic range according to the comprehensive ranking of the plurality of plots in the sub-geographic range and the storage potential index data of the plurality of plots in the sub-geographic range.
In one embodiment, the sub-geographic scope selection module 504 may be further specifically configured to sequentially assign a preset score value to the resource index data of the designated land block and the resource index data of the neighboring land block of the designated land block; according to a preset assignment formula, assigning values to the rest plots except the designated plots and the adjacent plots in the sub-geographic range to obtain scoring values of resource index data of the rest plots; wherein, the preset assignment formula comprises: the scoring value of the resource index data of the remaining plots=the index number of the preceding plot of the own plot/the index number of the own plot x the preset scoring value.
In one embodiment, the sub-geographic scope selection module 504 may be further configured to compare the comprehensive ranks of the plurality of plots with a preset comprehensive rank threshold, and select a second target comprehensive rank greater than the preset comprehensive rank threshold from the comparison result; comparing the storage potential index data of the plurality of plots with a preset plot storage potential threshold value, and selecting second target storage potential index data which is larger than the preset plot storage potential threshold value from the comparison result; and selecting the land block corresponding to the second target comprehensive ranking and the second target storage potential index data from the sub-geographic range as a recommended land block.
In one embodiment, the migration module 505 may be specifically configured to migrate the point of withdrawal to the recommended land.
It should be noted that, the units, devices, or modules described in the above embodiments may be implemented by a computer chip or entity, or may be implemented by a product having a certain function. For convenience of description, the above devices are described as being functionally divided into various modules, respectively. Of course, when the present description is implemented, the functions of each module may be implemented in the same piece or pieces of software and/or hardware, or a module that implements the same function may be implemented by a plurality of sub-modules or a combination of sub-units, or the like. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
From the above, on the one hand, the dot layout device provided by the embodiment of the present disclosure does not need excessive manual investigation in the field, thereby saving labor cost and improving dot layout efficiency; on the other hand, based on the space and resource distribution conditions of the actual city or village and town, the resources occupied by the network points and the city or village and town land block and the resource coverage relation between the network points and the city or village and town land block are analyzed in a multi-angle and multi-type data fusion mode, and a more accurate reference basis is provided for the withdrawal of the stock network points and the migration of the newly added network points.
The embodiment of the specification also provides an electronic device based on the dot layout method, which comprises a processor and a memory for storing executable instructions of the processor, wherein the processor can execute the following steps according to the instructions when being implemented: determining an equal time circle of a plurality of net points in a set geographic range; acquiring index data of the net points according to the equal time circle; combining the index data, and selecting a point of removing the grid from the plurality of points; selecting a sub-geographic range which is not covered by the equal time circle of the plurality of network points from the set geographic range; and migrating the point to be evacuated to the sub-geographic range.
In order to more accurately complete the above instructions, referring to fig. 6, another specific electronic device is further provided in this embodiment of the present disclosure, where the electronic device includes a network communication port 601, a processor 602, and a memory 603, where the foregoing structures are connected by an internal cable, so that each structure may perform specific data interaction.
The network communication port 601 may be specifically configured to determine an equal time period of a plurality of mesh points within a set geographic range.
The processor 602 may be specifically configured to obtain index data of the website according to the equal time period; combining the index data, and selecting a point of removing the grid from the plurality of points; selecting a sub-geographic range which is not covered by the equal time circle of the plurality of network points from the set geographic range; and migrating the point to be evacuated to the sub-geographic range.
The memory 603 may be used for storing a corresponding program of instructions.
In this embodiment, the network communication port 601 may be a virtual port that binds with different communication protocols, so that different data may be sent or received. For example, the network communication port may be a port responsible for performing web data communication, a port responsible for performing FTP data communication, or a port responsible for performing mail data communication. The network communication port may also be an entity's communication interface or a communication chip. For example, it may be a wireless mobile network communication chip, such as GSM, CDMA, etc.; it may also be a Wifi chip; it may also be a bluetooth chip.
In this embodiment, the processor 602 may be implemented in any suitable manner. For example, the processor may take the form of, for example, a microprocessor or processor, and a computer-readable medium storing computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a programmable logic controller, and an embedded microcontroller, among others. The description is not intended to be limiting.
In this embodiment, the memory 603 may include multiple levels, and in a digital system, the memory may be any memory as long as it can hold binary data; in an integrated circuit, a circuit with a memory function without a physical form is also called a memory, such as a RAM, a FIFO, etc.; in the system, the storage device in physical form is also called a memory, such as a memory bank, a TF card, and the like.
The embodiments of the present specification also provide a computer storage medium based on the above-mentioned dot layout method, where the computer storage medium stores computer program instructions that when executed implement: determining an equal time circle of a plurality of net points in a set geographic range; acquiring index data of the net points according to the equal time circle; combining the index data, and selecting a point of removing the grid from the plurality of points; selecting a sub-geographic range which is not covered by the equal time circle of the plurality of network points from the set geographic range; and migrating the point to be evacuated to the sub-geographic range.
In the present embodiment, the storage medium includes, but is not limited to, a random access Memory (Random Access Memory, RAM), a Read-Only Memory (ROM), a Cache (Cache), a Hard Disk (HDD), or a Memory Card (Memory Card). The memory may be used to store computer program instructions. The network communication unit may be an interface for performing network connection communication, which is set in accordance with a standard prescribed by a communication protocol.
In this embodiment, the functions and effects of the program instructions stored in the computer storage medium may be explained in comparison with other embodiments, and are not described herein.
The present embodiments also provide a computer program product based on the above-described dot layout method, comprising a non-transitory computer-readable storage medium storing a computer program operable to cause a computer to perform the steps of: determining an equal time circle of a plurality of net points in a set geographic range; acquiring index data of the net points according to the equal time circle; combining the index data, and selecting a point of removing the grid from the plurality of points; selecting a sub-geographic range which is not covered by the equal time circle of the plurality of network points from the set geographic range; and migrating the point to be evacuated to the sub-geographic range.
Although the present description provides method operational steps as described in the examples or flowcharts, more or fewer operational steps may be included based on conventional or non-inventive means. The order of steps recited in the embodiments is merely one way of performing the order of steps and does not represent a unique order of execution. When implemented by an apparatus or client product in practice, the methods illustrated in the embodiments or figures may be performed sequentially or in parallel (e.g., in a parallel processor or multi-threaded processing environment, or even in a distributed data processing environment). The terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, it is not excluded that additional identical or equivalent elements may be present in a process, method, article, or apparatus that comprises a described element. The terms first, second, etc. are used to denote a name, but not any particular order.
Those skilled in the art will also appreciate that, in addition to implementing the controller in a pure computer readable program code, it is well possible to implement the same functionality by logically programming the method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers, etc. Such a controller can be regarded as a hardware component, and means for implementing various functions included therein can also be regarded as a structure within the hardware component. Or even means for achieving the various functions may be regarded as either software modules implementing the methods or structures within hardware components.
The description may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, classes, etc. that perform particular tasks or implement particular abstract data types. The specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
From the above description of embodiments, it will be apparent to those skilled in the art that the present description may be implemented in software plus a necessary general hardware platform. Based on such understanding, the technical solutions of the present specification may be embodied essentially in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., and include several instructions to cause a computer device (which may be a personal computer, a mobile terminal, a server, or a network device, etc.) to perform the methods described in the various embodiments or portions of the embodiments of the present specification.
Various embodiments in this specification are described in a progressive manner, and identical or similar parts are all provided for each embodiment, each embodiment focusing on differences from other embodiments. The specification is operational with numerous general purpose or special purpose computer system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable electronic devices, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
Although the present description has been described by way of example, it will be appreciated by those of ordinary skill in the art that there are many variations to the description without departing from the spirit of the present description, and it is intended that the appended claims encompass such variations without departing from the spirit of the present description.
Claims (14)
1. A dot placement method, comprising:
determining an equal time circle of a plurality of net points in a set geographic range;
acquiring index data of the net points according to the equal time circle;
combining the index data, and selecting a point of removing the grid from the plurality of points;
selecting a sub-geographic range which is not covered by the equal time circle of the plurality of network points from the set geographic range;
and migrating the point to be evacuated to the sub-geographic range.
2. The method of claim 1, wherein the index data comprises resource index data and savings potential index data, the savings potential index data being derived from a savings potential index prediction model, the savings potential index prediction module being established from the resource index data.
3. The method of claim 2, wherein the resource indicator data includes point of interest data, demographic data, peer data, and enterprise data; correspondingly, the storage potential index prediction model is established according to the resource index data, and comprises the following steps:
Establishing a storage potential index prediction model according to the following formula:
savings potential index data = point of interest data x point of interest coefficient + demographic data x demographic coefficient + contemporaneous data x contemporaneous coefficient + enterprise data x enterprise coefficient.
4. The method according to claim 1, wherein the method further comprises:
sequentially determining the overlapping area of the equal time circles of each of the plurality of mesh points;
sequentially judging whether the overlapping area of the equal time circles of each net point is larger than a preset overlapping area threshold value;
selecting a corresponding net point when the overlapping area is larger than a preset overlapping area threshold value from the judging result, and taking the net point as a tie-up net point;
correspondingly, the combining index data selects a point of withdrawal from the plurality of points, including:
and combining the index data of the tie-pile net points, and selecting out the withdrawal net points from the tie-pile net points.
5. The method of claim 4, wherein the selecting the withdrawal dots from the binder dots in combination with the index data of the binder dots comprises:
determining the comprehensive ranking of the tie-up net points according to the resource index data of the tie-up net points;
and selecting out the withdrawal grid points from the tie-up grid points according to the comprehensive ranking of the tie-up grid points and the storage potential index data of the tie-up grid points.
6. The method of claim 5, wherein determining the composite rank of the binder dots based on the resource index data of the binder dots comprises:
obtaining a grading value of resource index data of the tie-pile net points;
and carrying out summation processing on the scoring values of the resource index data of the tie-up net points, and ranking the tie-up net points according to the summation processing result to obtain the comprehensive ranking of the tie-up net points.
7. The method according to claim 5, wherein selecting the withdrawal point from the tie-pile points according to the comprehensive ranking of the tie-pile points and the storage potential index data of the tie-pile points comprises:
comparing the comprehensive ranking of the tie-up net points with a preset net point comprehensive ranking threshold value, and selecting a first target comprehensive ranking smaller than the preset net point comprehensive ranking threshold value from the comparison result;
comparing the storage potential index data of the tie-up net points with a preset net point storage potential threshold value, and selecting first target storage potential index data smaller than the preset net point storage potential threshold value from the comparison result;
and selecting the network points corresponding to the first target comprehensive ranking and the first target storage potential index data from the tie-up network points as the withdrawal network points.
8. The method according to claim 1, wherein the method further comprises:
calling a scoring rule of preset land resource index data;
obtaining scoring values of the resource index data of a plurality of plots in the sub-geographic range according to scoring rules of the resource index data of the preset plots;
determining the comprehensive ranking of the plurality of plots in the sub-geographic range according to the scoring values of the resource index data of the plurality of plots in the sub-geographic range;
acquiring storage potential index data of a plurality of plots in a sub-geographic range, and selecting a recommended plot from the sub-geographic range according to the comprehensive ranking of the plots in the sub-geographic range and the storage potential index data of the plots in the sub-geographic range;
accordingly, the migrating the point of withdrawal to the sub-geographic range includes:
and migrating the point to be evacuated to the recommended land parcel.
9. The method of claim 8, wherein the scoring rules for the preset plot resource indicator data comprise:
sequentially assigning a preset grading value to the resource index data of the designated land block and the resource index data of the adjacent land block of the designated land block in the sub-geographic range;
according to a preset assignment formula, assigning values to the rest plots except the designated plots and the adjacent plots in the sub-geographic range to obtain scoring values of resource index data of the rest plots; wherein, the preset assignment formula comprises:
The scoring value of the resource index data of the remaining plots=the index number of the preceding plot of the own plot/the index number of the own plot x the preset scoring value.
10. The method of claim 8, wherein selecting the recommended parcel from the sub-geographic range based on the comprehensive ranking of the plurality of parcel in the sub-geographic range and the savings potential indicator data for the plurality of parcel in the sub-geographic range comprises:
comparing the comprehensive ranks of the plurality of plots with a preset comprehensive rank threshold value of the plots, and selecting a second target comprehensive rank greater than the preset comprehensive rank threshold value of the plots from the comparison result;
comparing the storage potential index data of the plurality of plots with a preset plot storage potential threshold value, and selecting second target storage potential index data which is larger than the preset plot storage potential threshold value from the comparison result;
and selecting the land block corresponding to the second target comprehensive ranking and the second target storage potential index data from the sub-geographic range as a recommended land block.
11. A dot layout device, comprising:
the determining module is used for determining the equal time circle of a plurality of network points in the set geographic range;
the acquisition module is used for acquiring index data of the network points according to the equal time circle;
The withdrawal point selecting module is used for selecting withdrawal points from the plurality of points by combining the index data;
the sub-geographic range selection module is used for selecting a sub-geographic range which is not covered by the equal time circle of the plurality of network points from the set geographic range;
and the migration module is used for migrating the point to be evacuated to the sub-geographic range.
12. A dot layout device comprising a processor and a memory for storing processor executable instructions which when executed by the processor implement the steps of the method of any of claims 1 to 10.
13. A computer-readable storage medium, characterized in that it stores a computer program which, when executed by a processor, implements the steps of the method of any of claims 1 to 10.
14. A computer program product, characterized in that it comprises a computer program which, when executed by a processor, implements the steps of the method according to any one of claims 1 to 10.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202311567865.1A CN117610833A (en) | 2023-11-22 | 2023-11-22 | Dot layout method and device |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202311567865.1A CN117610833A (en) | 2023-11-22 | 2023-11-22 | Dot layout method and device |
Publications (1)
Publication Number | Publication Date |
---|---|
CN117610833A true CN117610833A (en) | 2024-02-27 |
Family
ID=89955554
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202311567865.1A Pending CN117610833A (en) | 2023-11-22 | 2023-11-22 | Dot layout method and device |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN117610833A (en) |
-
2023
- 2023-11-22 CN CN202311567865.1A patent/CN117610833A/en active Pending
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105898762B (en) | Base station optimization and deployment method and device | |
CN105674994A (en) | Driving route acquisition method and device and navigation equipment | |
US20170150365A1 (en) | Small cell planning tool | |
Demissie et al. | Exploring cellular network handover information for urban mobility analysis | |
CN107798412A (en) | A kind of route recommendation method and apparatus | |
Hu et al. | Trade structure and risk transmission in the international automotive Li-ion batteries trade | |
CN110399445B (en) | Method, device and equipment for processing interest points | |
CN111311193B (en) | Method and device for configuring public service resources | |
CN114641015B (en) | Network evaluation method, device, electronic equipment and storage medium | |
CN109087030A (en) | Realize method, General Mobile crowdsourcing server and the system of the crowdsourcing of C2C General Mobile | |
CN111507553A (en) | Resource scheduling method and device | |
CN116136413A (en) | Emission optimized vehicle path and charging | |
CN103796218A (en) | Wireless access point site selection method and apparatus | |
CN112541624B (en) | Site selection method, device, medium and electronic equipment for collecting throwing net points | |
CN116227929B (en) | Communication data analysis method, device, equipment and storage medium | |
CN117610833A (en) | Dot layout method and device | |
CN112860996A (en) | Interest point processing method and device, electronic equipment and medium | |
CN110267717B (en) | Method and device for automatically generating automatic scaling call rules according to different independent tenants in multi-tenant environment | |
CN116153088A (en) | Traffic demand prediction method and device and electronic equipment | |
CN111935772A (en) | Method and device for determining value of service area | |
CN114357102A (en) | Road network data generation method and device | |
CN109785351B (en) | Road fence merging method and device, storage medium and electronic device | |
CN113077199A (en) | Method and device for determining distribution route | |
CN104219096A (en) | Resource reallocation method and device | |
CN113065724B (en) | Personnel flow prediction method, device, equipment and medium based on signaling data |
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 |