CN109064218B - Method and device for dividing regions and electronic equipment - Google Patents
Method and device for dividing regions and electronic equipment Download PDFInfo
- Publication number
- CN109064218B CN109064218B CN201810786367.9A CN201810786367A CN109064218B CN 109064218 B CN109064218 B CN 109064218B CN 201810786367 A CN201810786367 A CN 201810786367A CN 109064218 B CN109064218 B CN 109064218B
- Authority
- CN
- China
- Prior art keywords
- target
- areas
- supplier
- area
- information
- 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.)
- Active
Links
Images
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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0201—Market modelling; Market analysis; Collecting market data
- G06Q30/0204—Market segmentation
- G06Q30/0205—Location or geographical consideration
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- Finance (AREA)
- Entrepreneurship & Innovation (AREA)
- Game Theory and Decision Science (AREA)
- Data Mining & Analysis (AREA)
- Economics (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Navigation (AREA)
Abstract
The application provides a method, a device and an electronic device for dividing regions, wherein one specific implementation mode of the method comprises the following steps: determining target information, wherein the target information comprises order quantity information and position information of each target supplier in a plurality of target suppliers; taking a plurality of pre-divided unit areas aiming at the target supplier as current target areas; iteratively executing the following steps until a stop condition is met: determining order density central points corresponding to part or all of the current target areas respectively based on the target information; and performing area merging based on the order density central point to update the current target area. In the embodiment, the regions are combined in an iterative manner based on the order density central points of different target regions, so that the regions can be divided more reasonably.
Description
Technical Field
The present disclosure relates to the field of internet application technologies, and in particular, to a method and an apparatus for dividing a region, and an electronic device.
Background
With the continuous development of internet technology, a lot of internet-based services are produced. For example, for the purpose of management, a plurality of areas are usually divided for suppliers (e.g., merchants, warehouses, etc.), and the delivery service of each area is handled by a group of deliverers. Therefore, the division of the area has a large influence on the efficiency of the delivery service. If the division of the area is not reasonable, the efficiency of service distribution can be low, and the waste of service resources is caused. At present, the region division is generally performed manually, and therefore, the region division is not reasonable.
Disclosure of Invention
In order to solve one of the above technical problems, the present application provides a method, an apparatus and an electronic device for dividing a region.
According to a first aspect of embodiments of the present application, there is provided a method of dividing a region, including:
determining target information, wherein the target information comprises order quantity information and position information of each target supplier in a plurality of target suppliers;
taking a plurality of pre-divided unit areas aiming at the target supplier as current target areas;
iteratively executing the following steps until a stop condition is met:
determining order density central points corresponding to part or all of the current target areas respectively based on the target information;
and performing area merging based on the order density central point to update the current target area.
Optionally, the total number of orders corresponding to the partial or all current target areas is less than or equal to a preset number.
Optionally, for any target area in the partial or all current target areas, the order density central point corresponding to the target area is determined in the following manner:
determining order quantity information and position information corresponding to each target supplier in the target area based on the target information;
determining a position weight corresponding to each target supplier in the target area based on the order quantity information corresponding to each target supplier in the target area;
and performing weighted average calculation on the positions of the target suppliers in the target area based on the position weight and the position information corresponding to each target supplier in the target area to obtain an order density central point corresponding to the target area.
Optionally, for any target supplier in the target area, the position weight corresponding to the target supplier is determined in the following manner:
and determining the proportion of the number of the orders corresponding to the target supplier in the total number of the orders corresponding to the target area as the position weight corresponding to the target supplier.
Optionally, the performing area merging based on the order density central point includes:
determining a matched target area of which the navigation distance between the order density central points meets preset target conditions;
and carrying out region merging based on the matched target region.
Optionally, the performing region merging based on the matched target region includes:
if a group of matched target areas exists, merging the group of matched target areas;
and if a plurality of groups of matched target areas exist, determining the dispersity of the target suppliers corresponding to each group of matched target areas after combination, and carrying out area combination based on the dispersity.
Optionally, the performing region merging based on the degree of dispersion includes:
and combining the corresponding matched target areas with the minimum dispersion degree.
Optionally, for any group of matched target areas, the dispersion degree corresponding to the group of matched target areas after merging is positively correlated with the sum of the navigation distances between every two target suppliers in the area obtained after merging, and is negatively correlated with the number of the target suppliers in the area obtained after merging.
Optionally, for any group of matched target regions, the degree of dispersion corresponding to the group of matched target regions after merging is calculated by the following formula:
wherein f represents the degree of dispersion corresponding to the group of matched target regions after merging, phi represents the set of target suppliers in the regions obtained after merging, and DijAnd representing the navigation distance between the ith target supplier and the jth target supplier in the set phi, and m represents the number of the target suppliers in the region obtained after combination.
Optionally, the method further includes:
after the iteration is stopped, if the target area with the order total number smaller than the preset threshold value exists in the current target area, combining the target area with the order total number smaller than the preset threshold value and the target area selected from the current target area.
According to a second aspect of embodiments of the present application, there is provided an apparatus for dividing a region, including:
the system comprises a first determining module, a second determining module and a third determining module, wherein the first determining module is used for determining target information, and the target information comprises order quantity information and position information of each target supplier in a plurality of target suppliers;
the second determining module is used for taking a plurality of unit areas which are divided in advance and aim at the target supplier as current target areas;
the control module is used for controlling the following modules to carry out iterative operation until the stop condition is met:
the third determining module is used for determining the order density central points corresponding to part or all of the current target areas based on the target information;
and the merging module is used for performing area merging based on the order density central point so as to update the current target area.
According to a third aspect of embodiments herein, there is provided a computer-readable storage medium storing a computer program which, when executed by a processor, implements the method of any one of the above first aspects.
According to a fourth aspect of embodiments of the present application, there is provided an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method of any one of the first aspect when executing the program.
The technical scheme provided by the embodiment of the application can have the following beneficial effects:
according to the method and the device for dividing the region, by determining the target information, the target information comprises the order quantity information and the position information of each target supplier in a plurality of target suppliers, taking a plurality of unit regions which are divided in advance and aim at the target suppliers as the current target region, and iteratively executing the following steps until the stop condition is met: and determining order density central points corresponding to part or all of the current target areas respectively based on the target information, and performing area combination based on the order density central points to update the current target areas so as to finish the division of the areas. In the embodiment, the regions are combined in an iterative manner based on the order density central points of different target regions, so that the regions can be divided more reasonably.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application.
FIG. 1 is a flow chart illustrating a method of partitioning regions according to an exemplary embodiment of the present application;
FIG. 2 is a flow chart illustrating another method of partitioning regions according to an exemplary embodiment of the present application;
FIG. 3 is a block diagram illustrating an apparatus for partitioning regions according to an exemplary embodiment;
FIG. 4 is a block diagram of another apparatus for partitioning regions shown herein in accordance with an exemplary embodiment;
FIG. 5 is a block diagram illustrating another apparatus for partitioning regions according to an exemplary embodiment;
FIG. 6 is a block diagram illustrating another apparatus for partitioning regions according to an exemplary embodiment;
fig. 7 is a schematic structural diagram of an electronic device shown in the present application according to an exemplary embodiment.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It is to be understood that although the terms first, second, third, etc. may be used herein to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of the present application. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
As shown in fig. 1, fig. 1 is a flowchart illustrating a method of dividing an area according to an exemplary embodiment, which may be applied to a terminal device and may also be applied to a server. The method comprises the following steps:
in step 101, target information is determined, the target information including order quantity information and location information for each of a plurality of target suppliers.
In this embodiment, the target information may be obtained, where the target information may include order quantity information corresponding to each target supplier among the multiple target suppliers and location information corresponding to each target supplier. The supplier may be a merchant (such as a restaurant, a supermarket, or a flower shop) that provides goods, or may be a warehouse that delivers goods, and the application is not limited to specific types of suppliers. The target supplier may be any designated supplier, for example, the target supplier may be a part or all of suppliers related to the designated delivery service in a preset area, and it should be understood that the present application is not limited in this respect. The preset area may be province, city, district, etc., or may be a pre-divided business circle, life circle, etc.
In this embodiment, for any one target supplier, the order quantity information corresponding to the target supplier may be any information capable of representing the order quantity corresponding to the target supplier, and may be determined based on historical order data of the target supplier. In one implementation, the total number of orders generated by the target supplier within a past preset time period (e.g., within a past month, a past year, etc.) can be used as the order number information corresponding to the target supplier. In another implementation manner, the total number of orders generated by the target supplier in a future preset time period can be predicted as the order number information corresponding to the target supplier by adopting a machine learning manner based on the order data generated by the target supplier in the past preset time period. It can be understood that the order quantity information corresponding to the target supplier may also be other information capable of representing the order quantity corresponding to the target supplier, and this aspect of the present application is not limited in this respect.
In this embodiment, for any one target supplier, the location information corresponding to the target supplier may be any information capable of representing a geographic location of the target supplier, and optionally, the location information corresponding to the target supplier may be represented by latitude and longitude coordinates. It is to be understood that any other reasonable coordinate form may be used to represent the location information corresponding to the target supplier, and the application is not limited in this respect.
In step 102, a plurality of unit areas for the target supplier, which are divided in advance, are set as current target areas.
In this embodiment, a plurality of unit regions which are identical in shape and size and are closely connected may be divided on the basis of a map in advance, and these unit regions may be regular polygons, for example, regular triangles, regular quadrangles, regular hexagons, and the like. The unit areas for the target supplier are all the unit areas containing the target supplier. The plurality of unit areas for the target supplier may be used as the initial current target area.
In step 103, based on the target information, order density center points corresponding to some or all of the current target areas are determined.
In this embodiment, the order density central point corresponding to each of part or all of the current target areas may be determined based on the target information. Wherein, part or all of the current target area may be a target area satisfying a preset condition in the current target area. Specifically, first, each current target area may be traversed to determine a target area satisfying a preset condition (the target area satisfying the preset condition may include all the current target areas or may include a part of the current target areas). And then, determining the position coordinates of the order density center point corresponding to each target area meeting the preset conditions.
In one implementation, the target area satisfying the preset condition may be a target area with a total number of orders less than or equal to a preset number. For any target area, the total number of orders corresponding to the target area may be the sum of the number of orders corresponding to all target suppliers in the target area. In another implementation manner, the target region that meets the preset condition may also be a target region whose currently corresponding area is smaller than or equal to a preset area. It is to be understood that the preset condition may also include any other reasonable condition, and the present application is not limited to the specific content of the preset condition.
In this embodiment, the order density center point corresponding to the target area may be a distribution density center location point of the orders in the target area, and the order density center point may be obtained based on the order quantity information and the location information corresponding to each target supplier in the target area.
In step 104, area merging is performed based on the order density center point to update the current target area.
In this embodiment, the area merging may be performed according to the order density central points corresponding to part or all of the current target areas, so as to update the current target area. Specifically, in one implementation, first, matching target areas where the navigation distance between the order density center points satisfies a preset target condition may be determined, and area merging may be performed based on the matching target areas.
In another implementation manner, clustering may be performed on the order density central points, and target areas corresponding to the order density central points that are clustered into one type are merged. It is to be understood that the region merging may be performed based on the order density center point in any other reasonable manner, which is not limited in this respect.
In step 105, it is determined whether or not the stop condition is satisfied.
In this embodiment, after the current target area is updated, it may be further determined whether the stop condition is satisfied. If it is determined that the stop condition is not satisfied, the updated target area may be regarded as the current target area, and steps 103 to 105 may be re-performed. If it is determined that the stop condition is satisfied, the iteration may be stopped, and the updated target region may be treated as a region divided for the target supplier. Alternatively, the updated target area may be adjusted, and the adjusted target area may be an area divided for the target supplier.
In the present embodiment, when the number of iterations exceeds a preset number, it may be determined that the stop condition is satisfied. Alternatively, when the number of the current target areas is smaller than the preset number, it may be determined that the stop condition is satisfied. It is understood that the stop condition may also include any other reasonable condition, and the specific content of the stop condition is not limited in this application.
It should be noted that while in the above-described embodiment of fig. 1, the operations of the methods of the present application are described in a particular order, this does not require or imply that the operations must be performed in that particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Rather, the steps depicted in the flowcharts may change the order of execution. For example, step 101 may be performed before step 102, may be performed after step 102, or may be performed simultaneously with step 102. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
In the method for dividing an area provided by the above embodiment of the present application, by determining target information, where the target information includes order quantity information and location information of each target supplier in a plurality of target suppliers, a plurality of unit areas for the target suppliers, which are divided in advance, are used as current target areas, and the following steps are iteratively performed until a stop condition is satisfied: and determining order density central points corresponding to part or all of the current target areas respectively based on the target information, and performing area combination based on the order density central points to update the current target areas so as to complete area division. In the embodiment, the regions are combined in an iterative manner based on the order density central points of different target regions, so that the regions can be divided more reasonably.
In some optional embodiments, for any one of the above partial or all current target areas, the order density central point corresponding to the target area may be determined as follows: first, order quantity information corresponding to each target supplier in the target area and position information corresponding to each target supplier in the target area can be determined based on the target information.
Then, the position weight corresponding to each target supplier in the target area is determined based on the order quantity information corresponding to each target supplier in the target area. Optionally, for any target supplier in the target area, a ratio of the number of orders corresponding to the target supplier in the total number of orders corresponding to the target area may be determined as the location weight corresponding to the target supplier. The total number of orders corresponding to the target area may be the sum of the number of orders corresponding to all target suppliers in the target area.
And finally, performing weighted average calculation on the positions of the target suppliers in the target area based on the position weight corresponding to each target supplier in the target area and the position information corresponding to each target supplier in the target area to obtain an order density central point corresponding to the target area.
For example, the position coordinates of the order density center point corresponding to the target area can be calculated by the following formula:
wherein, (X, Y) represents the position coordinates of the order density center point corresponding to the target area, Ω represents the set of target suppliers in the target area, niRepresents the order quantity, x, corresponding to the ith target supplier in the target areaiAnd yiRespectively showing the abscissa and ordinate of the position corresponding to the ith target supplier in the target area.
According to the embodiment of the application, when the order density central point corresponding to the target area is determined, not only is the distribution condition of each target supplier in the target area considered, but also the order quantity corresponding to each target supplier in the target area is considered, so that the obtained order density central point is more reasonable, and the reasonability of area division is further improved.
Fig. 2 is a flowchart of another method for dividing regions according to an exemplary embodiment, which describes a process of region merging based on order density midpoints, and the method may be applied to a terminal device or a server, and includes the following steps:
in step 201, target information is determined, which includes order quantity information and location information for each of a plurality of target suppliers.
In step 202, a plurality of unit areas for the target supplier, which are divided in advance, are set as the current target areas.
In step 203, based on the target information, order density center points corresponding to some or all of the current target areas are determined.
In step 204, matching target areas where the navigation distance between the order density center points meets the preset target condition are determined.
In this embodiment, a matching target area where the navigation distance between the order density center points satisfies the preset target condition may be determined. There may be one or more sets of matching target regions, and each set of matching target regions may include two target regions. The navigation distance may be a path length obtained by referring to the road network information.
Specifically, first, navigation distances between order density center points of a plurality of sets of target areas may be calculated in a traversal manner. For example, the navigation distances between all the order density center points may be calculated in a traversal manner, or the navigation distances between the order density center points of all the adjacent target areas may be calculated in a traversal manner, and the like.
Then, a matched target area where the navigation distance between the order density center points meets the preset target condition can be determined according to the result obtained by the traversal calculation. In one implementation, the one or more groups of target areas with the shortest navigation distance may be used as matching target areas where the navigation distance between the order density center points meets the preset target condition. In another implementation manner, one or more groups of target areas with navigation distances smaller than the preset distance may also be used as matched target areas with navigation distances between order density center points satisfying the preset target condition. It is to be understood that the preset target condition may be any other reasonable condition, and the present application is not limited in this respect.
In step 205, a region merging process is performed based on the matched target regions to update the current target region.
In one implementation, each set of matched target regions may be merged to obtain a new target region.
In another implementation, if there is a set of matching target regions, the set of matching target regions may be merged. If there are multiple groups of matched target regions, the degree of dispersion of the target suppliers corresponding to each group of matched target regions after combination can be determined, and region combination is performed based on the degree of dispersion. For example, each set of matched target regions corresponding to a degree of dispersion less than or equal to a preset degree of dispersion may be combined. Optionally, a group of matching target regions with the smallest corresponding divergence may be merged.
It is to be understood that the region merging may also be performed based on the above-mentioned matching target regions in any reasonable manner, and the present application is not limited in this respect.
In this embodiment, if there are multiple sets of matched target areas, for any one set of matched target areas, the dispersion degree of the target suppliers corresponding to the combined set of matched target areas after combination is positively correlated with the sum of the navigation distances between every two target suppliers in the combined area, and is negatively correlated with the number of target suppliers in the combined area. Specifically, the degree of dispersion corresponding to the set of matched target areas can be calculated by the following formula:
wherein f represents the dispersion degree of the target suppliers corresponding to the group of matched target areas after combination, phi represents the set of the target suppliers in the areas obtained after combination, and DijAnd representing the navigation distance between the ith target supplier and the jth target supplier in the set phi, and m represents the number of the target suppliers in the region obtained after combination.
It should be noted that, the specific calculation method of the dispersion degree in the present application is not limited to the above formula, and after performing any reasonable modification on the above formula (for example, adding a reasonable constant to the left of the equal sign of the above formula or multiplying by a reasonable coefficient, etc.), the obtained new formula can still be applied to the present application.
In step 206, it is determined whether a stop condition is satisfied.
In this embodiment, after the current target area is updated, it may be further determined whether the stop condition is satisfied. If it is determined that the stop condition is not satisfied, the updated target area may be regarded as the current target area, and steps 203 to 206 may be re-performed. If it is determined that the stop condition is satisfied, the iteration may be stopped, and the updated target region may be treated as a region divided for the target supplier. Alternatively, the updated target area may be adjusted, and the adjusted target area may be an area divided for the target supplier.
It should be noted that, for the same steps as in the embodiment of fig. 1, details are not repeated in the embodiment of fig. 2, and related contents may refer to the embodiment of fig. 1.
In the method for dividing an area provided by the above embodiment of the present application, by determining target information, where the target information includes order quantity information and location information of each target supplier in a plurality of target suppliers, a plurality of unit areas for the target suppliers, which are divided in advance, are used as current target areas, and the following steps are iteratively performed until a stop condition is satisfied: determining order density central points corresponding to part or all of the current target areas respectively based on the target information, determining matched target areas with navigation distances between the order density central points meeting preset target conditions, and carrying out area combination based on the matched target areas so as to finish the division of the areas. In the embodiment, the target areas to be combined are selected for area combination based on the navigation distance between the order density central points, and the navigation distance between the order density central points can better embody the distribution of suppliers among the target areas and the similarity degree of the distribution of the order quantity, so that the rationality of area division is further increased.
In some optional embodiments, after stopping the iteration, if it is determined that there is a target area in the current target area where the total number of orders is smaller than the preset threshold, the target area where the total number of orders is smaller than the preset threshold may be merged with the target area selected from the current target area. For example, the target areas with the total number of orders smaller than the preset threshold value and the adjacent target areas with the shortest navigation distance between the order density center points may be merged. The target areas with the total order quantity smaller than the preset threshold value and the combined target areas with the minimum distribution degree of the corresponding suppliers can be combined, and the like. It is to be understood that the present application is not limited in this respect. The total number of orders corresponding to the target area may be the sum of the number of orders corresponding to all target suppliers in the target area.
After the iteration is stopped, the target areas with the corresponding total number of orders smaller than the preset threshold value and the target areas selected from the current target areas are combined, so that the number of orders in each area divided by the target supplier can be ensured to be more balanced, and the areas can be divided more reasonably.
Corresponding to the foregoing method embodiments for dividing regions, the present application also provides embodiments of an apparatus for dividing regions.
As shown in fig. 3, fig. 3 is a block diagram of an apparatus for dividing regions according to an exemplary embodiment of the present application, and the apparatus may include: a first determination module 301, a second determination module 302, a control module 303, a third determination module 304, and a merge module 305.
The first determining module 301 is configured to determine target information, where the target information includes order quantity information and location information of each target supplier in a plurality of target suppliers.
A second determining module 302, configured to use a plurality of unit areas for the target supplier, which are divided in advance, as current target areas.
A control module 303, configured to control the third determining module 304 and the merging module 305 to perform an iterative operation until a stop condition is met.
And a third determining module 304, configured to determine, based on the target information, order density center points corresponding to part or all of the current target areas, respectively.
A merging module 305, configured to perform area merging based on the order density central point to update the current target area.
In some optional embodiments, the partial or all of the current target areas are target areas where the total number of orders currently corresponding to the current target areas is less than or equal to a preset number.
In other optional embodiments, for any one of the above partial or all current target areas, the third determining module 304 may determine the order density central point corresponding to the target area by: and determining order quantity information and position information corresponding to each target supplier in the target area based on the target information. And determining the position weight corresponding to each target supplier in the target area based on the order quantity information corresponding to each target supplier in the target area. And performing weighted average calculation on the positions of the target suppliers in the target area based on the position weight and the position information corresponding to each target supplier in the target area to obtain an order density central point corresponding to the target area.
In other alternative embodiments, for any target supplier in the target area, the third determining module 304 may determine the location weight corresponding to the target supplier by: and determining the proportion of the number of the orders corresponding to the target supplier in the total number of the orders corresponding to the target area as the position weight corresponding to the target supplier.
As shown in fig. 4, fig. 4 is a block diagram of another apparatus for dividing regions according to an exemplary embodiment of the present application, and based on the foregoing embodiment shown in fig. 3, the merging module 305 may include: a determination submodule 401 and an execution submodule 402.
The determining submodule 401 is configured to determine a matching target area where a navigation distance between the order density center points meets a preset target condition.
And the execution sub-module 402 is configured to perform region merging based on the matched target regions.
As shown in fig. 5, fig. 5 is a block diagram of another apparatus for dividing regions according to an exemplary embodiment shown in the present application, and on the basis of the foregoing embodiment shown in fig. 4, the performing sub-module 402 may include: a first merging submodule 501 and a second merging submodule 502.
The first merging submodule 501 is configured to merge a set of the matched target areas when there is the set of the matched target areas.
A second merging submodule 502, configured to determine, when there are multiple sets of the matched target areas, a degree of dispersion of the target suppliers corresponding to each set of the matched target areas after merging, and perform area merging based on the degree of dispersion.
In other alternative embodiments, the second merge sub-module 502 may perform region merging based on the above-described degree of dispersion by: and combining the corresponding matched target areas with the minimum dispersion degree.
In other optional embodiments, for any group of matched target regions, the dispersion degree corresponding to the group of matched target regions after merging is positively correlated with the sum of the navigation distances between every two target suppliers in the region obtained after merging, and is negatively correlated with the number of the target suppliers in the region obtained after merging.
In other alternative embodiments, for any group of matched target regions, the second merging submodule 502 may calculate the degree of divergence corresponding to the group of matched target regions after merging according to the following formula:
wherein f represents the degree of dispersion corresponding to the group of matched target regions after merging, phi represents the set of target suppliers in the regions obtained after merging, and DijAnd representing the navigation distance between the ith target supplier and the jth target supplier in the set phi, and m represents the number of the target suppliers in the region obtained after combination.
As shown in fig. 6, fig. 6 is a block diagram of another apparatus for dividing regions according to an exemplary embodiment of the present application, which is based on the foregoing embodiment shown in fig. 3, and the apparatus may further include: an adjustment module 306.
After the iteration is stopped, if it is determined that the total number of orders in the current target area is less than the preset threshold, the adjusting module 306 is configured to combine the target area with the total number of orders less than the preset threshold with the target area selected from the current target area.
It should be understood that the above-mentioned apparatus may be preset in the terminal device or the server, and may also be loaded in the terminal device or the server by downloading or the like. The corresponding modules in the above-mentioned device can cooperate with the modules in the terminal equipment or the server to realize the scheme of dividing the region.
For the device embodiments, since they substantially correspond to the method embodiments, reference may be made to the partial description of the method embodiments for relevant points. The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the scheme of the application. One of ordinary skill in the art can understand and implement it without inventive effort.
An embodiment of the present application further provides a computer-readable storage medium, where the storage medium stores a computer program, and the computer program can be used to execute the method for dividing regions provided in any one of fig. 1 to fig. 2.
In correspondence with the method for dividing regions, an embodiment of the present application also proposes a schematic structural diagram of an electronic device according to an exemplary embodiment of the present application, shown in fig. 7. Referring to fig. 7, at the hardware level, the electronic device includes a processor, an internal bus, a network interface, a memory, and a non-volatile memory, but may also include hardware required for other services. The processor reads the corresponding computer program from the nonvolatile memory into the memory and then runs the computer program to form a device for dividing the region on the logic level. Of course, besides the software implementation, the present application does not exclude other implementations, such as logic devices or a combination of software and hardware, and the like, that is, the execution subject of the following processing flow is not limited to each logic unit, and may also be hardware or logic devices.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It will be understood that the present application is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.
Claims (11)
1. A method of partitioning a region, the method comprising:
determining target information, wherein the target information comprises order quantity information and position information of each target supplier in a plurality of target suppliers;
taking a plurality of pre-divided unit areas aiming at the target supplier as current target areas;
iteratively executing the following steps until a stop condition is met, wherein the stop condition comprises that the number of the current target areas is less than a preset number:
determining order density central points corresponding to part or all of the current target areas respectively based on the target information, and determining matched target areas meeting preset target conditions in the part or all of the current target areas according to navigation distances among the order density central points, wherein the total number of orders corresponding to the part or all of the current target areas is less than or equal to a preset number;
and carrying out region merging based on the matched target region so as to update the current target region.
2. The method according to claim 1, wherein for any one of the partial or all current target areas, the order density center point corresponding to the target area is determined as follows:
determining order quantity information and position information corresponding to each target supplier in the target area based on the target information;
determining a position weight corresponding to each target supplier in the target area based on the order quantity information corresponding to each target supplier in the target area;
and performing weighted average calculation on the positions of the target suppliers in the target area based on the position weight and the position information corresponding to each target supplier in the target area to obtain an order density central point corresponding to the target area.
3. The method of claim 2, wherein for any target supplier in the target area, the location weight corresponding to the target supplier is determined by:
and determining the proportion of the number of the orders corresponding to the target supplier in the total number of the orders corresponding to the target area as the position weight corresponding to the target supplier.
4. The method of claim 1, wherein the performing region merging based on the matched target region comprises:
if a group of matched target areas exists, merging the group of matched target areas;
and if a plurality of groups of matched target areas exist, determining the dispersity of the target suppliers corresponding to each group of matched target areas after combination, and carrying out area combination based on the dispersity.
5. The method of claim 4, wherein the performing region combination based on the degree of dispersion comprises:
and combining the corresponding matched target areas with the minimum dispersion degree.
6. The method of claim 4, wherein for any group of matched target regions, the degree of dispersion corresponding to the group of matched target regions after merging is positively correlated to the sum of the navigation distances between every two target suppliers in the merged region, and is negatively correlated to the number of target suppliers in the merged region.
7. The method of claim 6, wherein for any group of matched target regions, the degree of dispersion of the group of matched target regions after combination is calculated by the following formula:
wherein f represents the degree of dispersion corresponding to the group of matched target regions after merging, phi represents the set of target suppliers in the regions obtained after merging, and DijAnd representing the navigation distance between the ith target supplier and the jth target supplier in the set phi, and m represents the number of the target suppliers in the region obtained after combination.
8. The method of claim 1, further comprising:
after the iteration is stopped, if the target area with the order total number smaller than the preset threshold value exists in the current target area, combining the target area with the order total number smaller than the preset threshold value and the target area selected from the current target area.
9. An apparatus for dividing a region, the apparatus comprising:
the system comprises a first determining module, a second determining module and a third determining module, wherein the first determining module is used for determining target information, and the target information comprises order quantity information and position information of each target supplier in a plurality of target suppliers;
the second determining module is used for taking a plurality of unit areas which are divided in advance and aim at the target supplier as current target areas;
the control module is used for controlling the following modules to carry out iterative operation until a stop condition is met, wherein the stop condition comprises that the number of the current target areas is less than a preset number:
a third determining module, configured to determine, based on the target information, order density center points corresponding to part or all of the current target areas, and determine, according to a navigation distance between the order density center points, a matched target area that meets a preset target condition in the part or all of the current target areas, where a total number of orders corresponding to the part or all of the current target areas is less than or equal to a preset number;
and the merging module is used for performing region merging based on the matched target region so as to update the current target region.
10. A computer-readable storage medium, characterized in that the storage medium stores a computer program which, when being executed by a processor, carries out the method of any of the preceding claims 1-8.
11. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any of claims 1-8 when executing the program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810786367.9A CN109064218B (en) | 2018-07-17 | 2018-07-17 | Method and device for dividing regions and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810786367.9A CN109064218B (en) | 2018-07-17 | 2018-07-17 | Method and device for dividing regions and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109064218A CN109064218A (en) | 2018-12-21 |
| CN109064218B true CN109064218B (en) | 2021-04-27 |
Family
ID=64816946
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810786367.9A Active CN109064218B (en) | 2018-07-17 | 2018-07-17 | Method and device for dividing regions and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109064218B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109741142A (en) * | 2019-01-03 | 2019-05-10 | 上海拉扎斯信息科技有限公司 | Order allocation method, Order splitting device, readable storage medium storing program for executing and electronic equipment |
| CN111754147B (en) * | 2019-03-28 | 2024-11-19 | 北京京东振世信息技术有限公司 | Road area division method, system, device and computer readable storage medium |
| CN110363414A (en) * | 2019-06-28 | 2019-10-22 | 秒针信息技术有限公司 | Dispense the partitioning method and device in region |
| CN111191982B (en) * | 2019-12-25 | 2020-12-01 | 北京顺达同行科技有限公司 | Order grouping method and device, computer equipment and storage medium |
| CN112017003B (en) * | 2020-08-28 | 2023-06-20 | 杭州拼便宜网络科技有限公司 | Service processing method, device, equipment and storage medium |
| CN111861591B (en) * | 2020-09-24 | 2020-12-15 | 武汉木仓科技股份有限公司 | Information delivery method and device |
| CN113222509A (en) * | 2021-05-14 | 2021-08-06 | 海盐顺顺运输有限公司 | Cold chain logistics distribution system based on Internet of things |
| CN118890638A (en) * | 2024-07-24 | 2024-11-01 | 中国信息通信研究院 | Method, device, electronic device and storage medium for characterizing base station density |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104463516A (en) * | 2013-09-18 | 2015-03-25 | Sap欧洲公司 | Order/vehicle distribution based on order density |
| CN107451673A (en) * | 2017-06-14 | 2017-12-08 | 北京小度信息科技有限公司 | Dispense region partitioning method and device |
| CN108038500A (en) * | 2017-12-07 | 2018-05-15 | 东软集团股份有限公司 | Clustering method, device, computer equipment, storage medium and program product |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2826729A1 (en) * | 2013-07-17 | 2015-01-21 | Dematic Accounting Services GmbH | Method of order fulfilling and replenishment of storage units |
-
2018
- 2018-07-17 CN CN201810786367.9A patent/CN109064218B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104463516A (en) * | 2013-09-18 | 2015-03-25 | Sap欧洲公司 | Order/vehicle distribution based on order density |
| CN107451673A (en) * | 2017-06-14 | 2017-12-08 | 北京小度信息科技有限公司 | Dispense region partitioning method and device |
| CN108038500A (en) * | 2017-12-07 | 2018-05-15 | 东软集团股份有限公司 | Clustering method, device, computer equipment, storage medium and program product |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109064218A (en) | 2018-12-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109064218B (en) | Method and device for dividing regions and electronic equipment | |
| CN109003028B (en) | Method and device for dividing logistics area | |
| US11367352B2 (en) | Utilizing determined optimized time windows for precomputing optimal path matrices to reduce computer resource usage | |
| US20180121829A1 (en) | Training a machine to automate spot pricing of logistics services in a large-scale network | |
| CN111428991B (en) | Method and device for determining delivery vehicles | |
| US20160217410A1 (en) | Worker Task Assignment Based on Correlation and Capacity Information | |
| US20170046653A1 (en) | Planning of transportation requests | |
| CN110363476B (en) | Cargo warehousing distribution processing method and device | |
| CN109345166B (en) | Method and apparatus for generating information | |
| CN110503528B (en) | Line recommendation method, device, equipment and storage medium | |
| US10976165B2 (en) | Utilizing a geo-locator service and zone servers to reduce computer resource requirements for determining high quality solutions to routing problems | |
| CN116862091A (en) | Tobacco industry distribution line optimization method, system, equipment and medium | |
| Ruiz-Lendínez et al. | Automatic positional accuracy assessment of geospatial databases using line-based methods | |
| CN116148890A (en) | High-precision map lane planning method, system, electronic equipment and storage medium | |
| CN113807555B (en) | Address selection method and device for distribution center, electronic equipment and storage medium | |
| US20210217083A1 (en) | Method and system for optimizing resource redistribution | |
| Liu | A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes | |
| US11359925B2 (en) | Utilizing estimated traversal values to accelerate the determination of high quality solutions to routing problems | |
| CN112215453A (en) | Inventory information processing method and device, electronic equipment and storage medium | |
| US20150235247A1 (en) | Computer implemented system and method for determining a multi stage facility location and allocation | |
| CN113971247A (en) | Data processing method and computer program product | |
| Qin et al. | Dynamic Detection of Topological Information from Grid‐Based Generalized Voronoi Diagrams | |
| CN114943407A (en) | Area planning method, device, equipment, readable storage medium and program product | |
| CN110414758B (en) | Region determination method and device and electronic equipment | |
| Warner et al. | Optimizing Surveillance Satellites for the Synthetic Theater Operations Research Model |
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 | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1258199 Country of ref document: HK |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |