A method, device and computing equipment for determining the delivery range of a forward warehouse

By dividing areas into sub-regions and optimizing warehouse allocation using historical data and integer programming, the method addresses inaccuracies in determining forward warehouse delivery ranges, enhancing accuracy and efficiency.

CN115034706BActive Publication Date: 2024-12-03SHANGHAI 100 METERS NETWORK TECH CO LTD
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202210649471.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-06-09
Publication Date
2024-12-03
Estimated Expiration
2042-06-09

AI Technical Summary

Technical Problem

Existing methods for determining the delivery range of forward warehouses are inaccurate, leading to overlapping areas and inefficient use of storage capacity, particularly in the food and express delivery industries, due to the lack of precise inventory and storage capacity restrictions.

Method used

A method involving the division of areas into first and second-category sub-regions based on historical order data, using graph structure information and community discovery algorithms, followed by integer programming to optimize the allocation of forward warehouses, ensuring accurate delivery range determination and reducing data processing complexity.

Benefits of technology

Improves the accuracy and efficiency of delivery range division by ensuring forward warehouses are not overloaded and storage space is utilized optimally, while enhancing compatibility and flexibility in distribution range.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115034706B_ABST
    Figure CN115034706B_ABST
Patent Text Reader

Abstract

The present application relates to the field of data processing technology, and in particular to a method, device and computing equipment for determining the delivery range of a forward warehouse. The method includes: each sub-region includes a first type of sub-region and a second type of sub-region, and the delivery demand information of each sub-region is determined according to the historical order data corresponding to each sub-region; based on the delivery demand information of each sub-region and the delivery capacity of each forward warehouse in the area to be optimized, the unique forward warehouse corresponding to each sub-region is determined; for any forward warehouse, the delivery range of the forward warehouse is determined according to the sub-region corresponding to the forward warehouse. In the above method, there is no need to process each order, which reduces the amount of data to be processed and effectively improves the efficiency of determining the delivery range of the forward warehouse. Since the historical order data is generated before each sub-region, the delivery demand information extracted therefrom is less different from the actual delivery demand information, which can better improve the accuracy of the division of the delivery range of the forward warehouse.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a method, device and computing equipment for determining a delivery range of a forward warehouse. Background Art

[0002] A forward warehouse is a small warehouse that is moved from a location far away from the city to a location closer to consumers. Setting up a forward warehouse in the city forms a small-scale warehouse distribution model close to consumers. Based on this new warehouse distribution model, the distribution range needs to be re-divided.

[0003] The existing distribution range division mainly exists in the food delivery industry and the express delivery industry. In the delivery of food delivery orders, the delivery ranges of different merchants overlap to a certain extent, and the problem is mainly avoided by riders taking orders. There are no strict restrictions on inventory and storage capacity (for example, refrigerated, frozen, and room temperature). Although warehouses in the express delivery industry have certain storage restrictions, the allocation of storage capacity is very rough, and there are also overlapping areas for the coverage of the distribution range. For example, a Cainiao station will serve multiple communities, and there may be multiple Cainiao stations in the same community, and the distribution range is not precisely defined for a specific community.

[0004] Based on this, there is an urgent need for a method, device and computing equipment for determining the delivery range of a forward warehouse, so as to improve the accuracy of the delivery range of the forward warehouse. Summary of the invention

[0005] The present application provides a method, apparatus and computing device for determining the delivery range of a forward warehouse, so as to improve the accuracy of the delivery range of the forward warehouse.

[0006] In a first aspect, the present application provides a method for determining the delivery range of a forward warehouse, the method comprising: determining each sub-region in the area to be optimized through historical order data of the area to be optimized, wherein each sub-region includes a first-category sub-region and a second-category sub-region, and any order address in the first-category historical order data corresponding to the first-category sub-region has fence information in the map data; the second-category sub-region is a sub-region determined after aggregating the order addresses in the second-category historical order data; the second-category historical order data is historical order data whose order addresses do not have fence information in the map data; according to the historical order data corresponding to each sub-region, determining the delivery demand information of each sub-region; based on the delivery demand information of each sub-region and the delivery capacity of each forward warehouse in the area to be optimized, determining the unique forward warehouse corresponding to each sub-region; for any forward warehouse, determining the delivery range of the forward warehouse according to the sub-region corresponding to the forward warehouse.

[0007] In the above method, the area to be optimized is divided into the first type of sub-area and the second type of sub-area, and the orders are aggregated into this type of sub-area, and then the sub-area is divided. It is not necessary to process each order, which reduces the amount of data to be processed and effectively improves the efficiency of determining the distribution range of the forward warehouse. And according to the historical order data corresponding to each sub-area, the distribution demand information of each sub-area is determined. Since the historical order data is generated from each sub-area, the difference between the distribution demand information extracted from it and the actual distribution demand information is small, which can better improve the division accuracy of the distribution range of the forward warehouse. According to the distribution demand information and the distribution capacity of the forward warehouse, the sub-area and the forward warehouse are uniquely corresponding, which not only ensures that the forward warehouse will not be overloaded, but also ensures that the distribution demand can be met and the storage space of the forward warehouse will not be wasted. After determining the unique forward warehouse corresponding to each sub-area, the distribution range is divided from the perspective of the forward warehouse, and the corresponding relationship between the single-dimensional sub-area and the forward warehouse is processed into a two-dimensional corresponding relationship between the distribution range and the forward warehouse, which increases the compatibility and flexibility of the forward warehouse distribution range.

[0008] In one possible implementation, the second type of sub-region is a sub-region determined by aggregating order addresses in the second type of historical order data, including: generating graph structure information based on the historical order data of the area to be optimized; the graph structure information includes a bounding box of the first type of sub-region and nodes corresponding to each order address in the second type of historical order data; setting a connection line between any two nodes whose distance between the nodes is less than a first distance threshold and have no intersection with any bounding box; and determining each second type of sub-region after clustering each node based on the connection between each node and each node.

[0009] Through the above method, the second type of sub-areas are divided according to the scattered historical order data, and the scattered orders can be clustered. After the scattered orders are clustered, the amount of data is reduced, so that the efficiency of determining the overall delivery range is improved.

[0010] In one possible implementation, each second-class sub-region after clustering each node is determined based on each node and the connection between each node, including: setting the weight of the connection based on the distance between the nodes, wherein the greater the distance between the nodes, the lower the weight; and determining each second-class sub-region based on the weight of each node and the connection between each node through a community discovery algorithm.

[0011] Through the above method, the weight of the connection is determined based on the distance between the connections, so that nodes with closer distances can be clustered together, which is more in line with the requirements of distribution range division and helps to improve the accuracy of distribution range division.

[0012] In one possible implementation, based on the delivery demand information of each sub-region and the delivery capacity of each forward warehouse, a unique forward warehouse corresponding to each sub-region is determined, including: determining the unique forward warehouse corresponding to each sub-region through an integer programming model; the restriction conditions of the integer programming model are that the storage capacity demand information of each sub-region corresponding to the forward warehouse is not greater than the storage capacity of the forward warehouse, and the order quantity of each sub-region corresponding to the forward warehouse is not greater than the maximum carrying order quantity of the forward warehouse; the optimization goal of the integer programming model is to shorten the total delivery distance from the forward warehouse to the corresponding sub-region.

[0013] Through the above method, the sub-area division problem is planned as an integer programming problem, and the optimization goal is set according to the actual distribution requirements, so that the sub-area division step program can be automatically executed and the optimal solution can be obtained, which effectively improves the accuracy of the distribution range division.

[0014] In one possible implementation, for any forward warehouse, the optimized delivery range of the forward warehouse is determined according to the sub-area corresponding to the forward warehouse, including: for any forward warehouse, all sub-areas corresponding to the forward warehouse are regarded as a set of points, and a concave hull algorithm or a convex hull algorithm is used to generate a coverage range of the forward warehouse covering all points in the set; for any forward warehouse, a first part of the coverage range of the forward warehouse that exceeds the existing delivery range of the forward warehouse is removed; and a second part of the existing delivery range of the forward warehouse that does not belong to the coverage range of any forward warehouse is merged into the coverage range of the forward warehouse to obtain an updated coverage range, and the optimized delivery area of ​​the forward warehouse is obtained based on the updated coverage range; the existing delivery range of the forward warehouse is the delivery range before optimization.

[0015] Through the above method, after determining the unique forward warehouse corresponding to each sub-region, the distribution range is divided from the perspective of the forward warehouse, and the one-dimensional correspondence between the sub-region and the forward warehouse is processed into a two-dimensional correspondence between the distribution range and the forward warehouse, which increases the compatibility and flexibility of the forward warehouse distribution range. Further comparison with the existing distribution range makes the optimized distribution range compatible and comprehensive with the actual distribution range.

[0016] In one possible implementation, a convex hull algorithm is used to generate a coverage range of the forward warehouse that covers all points in the set, including: if there is an overlapping area between the initial coverage ranges of any two forward warehouses, the sub-areas within the overlapping area are exchanged and allocated by the forward warehouses, and the initial coverage range of the forward warehouses is updated until there is no overlapping area between the forward warehouses; when there is no overlapping area between any two forward warehouses and the order volume of the sub-area corresponding to each forward warehouse meets the delivery threshold, the coverage range of the forward warehouse is obtained.

[0017] Through the above method, overlapping areas of the coverage can be eliminated, avoiding the situation where one sub-area requires delivery from two or more forward warehouses, making the division of the delivery range more accurate.

[0018] In one possible implementation, the points in the overlapping area are exchanged and allocated to forward warehouses, and the initial coverage range of the forward warehouses is updated, including: determining the total number of intersecting edges in the overlapping area; if the total number of intersecting edges in the overlapping area meets the first condition, then for any point in the overlapping area, the correspondence between the point and the any two forward warehouses is changed according to the distance from the any two forward warehouses to the point, and the correspondence satisfies that the distance increment between the point and the forward warehouse is minimal; if the total number of intersecting edges in the overlapping area meets the second condition, then determining the sub-area that contains the least order volume and is not an overlapping area, assigning the sub-area to other forward warehouses, and using the convex hull algorithm to update the initial coverage range of the forward warehouse.

[0019] Through the above method, the vertices or sub-areas of the overlapping areas can be re-divided according to the specific circumstances of the overlapping areas, so as to further improve the rationality and accuracy of the distribution range division.

[0020] In one possible implementation, based on the updated coverage range, an optimized delivery area of ​​the forward warehouse is obtained, including: for the coverage range of any forward warehouse, if it is determined according to map data that the coverage range is divided into at least two sub-coverage ranges, then it is determined whether the order volume within the sub-coverage range after the division is greater than the order volume threshold; if so, it is determined that the sub-coverage range belongs to the forward warehouse; if not, it is determined that the sub-coverage range belongs to the forward warehouse closest to the sub-coverage range.

[0021] Through the above method, when the coverage area is divided in physical space, the order volume of the sub-coverage area is judged. If the order volume of the sub-coverage area is too small, the sub-coverage area is divided into other nearby forward warehouses, thereby enhancing the effectiveness of the distribution work.

[0022] In a second aspect, the present application provides a device for determining the delivery range of a forward warehouse, the device comprising: an order aggregation module, used to determine each sub-region in the area to be optimized through the historical order data of the area to be optimized, wherein each sub-region includes a first-category sub-region and a second-category sub-region, and any order address in the first-category historical order data corresponding to the first-category sub-region has fence information in the map data; the second-category sub-region is a sub-region determined after aggregating the order addresses in the second-category historical order data; the second-category historical order data is historical order data whose order addresses do not have fence information in the map data; a data preprocessing module, used to determine the delivery demand information of each sub-region according to the historical order data corresponding to each sub-region; an area allocation module, used to determine the unique forward warehouse corresponding to each sub-region based on the delivery demand information of each sub-region and the delivery capacity of each forward warehouse in the area to be optimized; a delivery range generation module, used to determine the delivery range of any forward warehouse according to the sub-region corresponding to the forward warehouse.

[0023] In a third aspect, the present application provides a computer-readable storage medium, which stores a computer program. When the computer program is run, any one of the methods in the first aspect is executed.

[0024] In a fourth aspect, the present application provides a computing device, comprising: a memory for storing program instructions; a processor for calling the program instructions stored in the memory, and executing the method in any one of the designs in the above-mentioned first aspect according to the obtained program.

[0025] In a fifth aspect, the present application provides a computer program product, which, when executed on a processor, implements a method as in any one of the designs of the first aspect.

[0026] The beneficial effects of the second to fifth aspects mentioned above can be specifically referred to the beneficial effects that can be achieved by any design of the first aspect mentioned above, and will not be described in detail here. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Figure 1 A schematic diagram of an application scenario provided by an embodiment of the present application is exemplified;

[0028] Figure 2 A schematic flow chart of a method for determining a forward warehouse delivery range provided in an embodiment of the present application is exemplarily shown;

[0029] Figure 3 A schematic diagram exemplarily illustrates a flow chart of a method for determining a second type of sub-region provided in an embodiment of the present application;

[0030] Figure 4A schematic diagram of a city area map data provided by an embodiment of the present application is exemplarily shown;

[0031] Figure 5 A schematic diagram of a city area map data provided by an embodiment of the present application is exemplarily shown;

[0032] Figure 6 A schematic diagram of a method for dividing a delivery area provided in an embodiment of the present application is exemplarily shown;

[0033] Figure 7 A schematic diagram of a delivery range provided in an embodiment of the present application is exemplarily shown;

[0034] Figure 8 An exemplary diagram of an overlap area provided in an embodiment of the present application is shown;

[0035] Fig. 9 Another schematic diagram of overlapping areas provided in an embodiment of the present application is exemplarily shown;

[0036] Fig.10 A schematic diagram of the coverage range of a forward warehouse provided in an embodiment of the present application is exemplarily shown;

[0037] Fig.11 A schematic diagram of a device for determining a delivery range of a forward warehouse provided in an embodiment of the present application is shown by way of example. DETAILED DESCRIPTION

[0038] In order to make the purpose, technical scheme and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0039] Figure 1 The following is a schematic diagram of an application scenario provided by an embodiment of the present application. Figure 1 As shown in the figure, the application scenario is a life scenario in an urban area, including a distribution warehouse and an urban area. In the urban area, there are roads, forward warehouses, residential areas, hospitals, industrial parks, some roadside stores and urban villages.

[0040] In the distribution scenario, the distribution warehouse located at the edge of the city is used to distribute goods to the forward warehouse in the city, that is, the warehouse is moved from a location far away from the city to a location closer to consumers, making distribution to consumers more convenient. For a city area, different distribution warehouses can distribute goods to the forward warehouses in the city area at the same time. Figure 1Only one is shown in the figure. The distribution warehouse predicts the types and quantities of goods that need to be supplied to each forward warehouse based on the storage capacity of the forward warehouse and the demand for goods in the urban area, and supplies goods to the forward warehouse in advance.

[0041] like Figure 1 As shown, the small black boxes represent forward warehouses, which are distributed in various locations in urban areas. They are characterized by being close to roads and order gathering areas, such as residential areas, industrial parks, shopping malls, and urban villages. Each forward warehouse has different storage capacities, mainly including three types of warehouses: refrigerated, frozen, and room temperature. The sizes of these three warehouses are set when the forward warehouse is established. In addition, each forward warehouse is equipped with a certain number of sorters and riders. The sorting ability of the sorters, the delivery ability of the riders, and the storage capacity of the forward warehouse all affect the number of orders that this forward warehouse can undertake.

[0042] After the riders get the goods from the forward warehouse, they deliver them to the destination of the order. For destinations such as residential areas, shopping malls, and industrial parks, there are clear walls or railings to separate them from the outside space. Even if there are no walls or railings, it is an area with a clear range on the map. For roadside stores and urban villages, which do not have clear railings and walls, they are isolated points and the order has no clear area range.

[0043] The main industries that need to divide the distribution range in urban areas are the express delivery industry and the takeaway industry. For the large warehouses in the express delivery industry, it is different from the distribution warehouses in scenario 1, which are located far away from the urban area, but are distributed in the urban area. However, the division range of this large warehouse is very rough, and it only relies on administrative divisions to divide the responsible areas. For example, Pudong warehouse, Xuhui warehouse, Huangpu warehouse, etc. Although it covers the entire urban area, this rough division method cannot accurately divide the distribution of the community. Small warehouses located near the community, such as Cainiao Post Station, express cabinet, etc., only serve specific communities, and there may be multiple Cainiao Post Stations or express cabinets in a community. Parcels delivered to Cainiao Post Stations or express cabinets are mainly picked up by users, rather than delivered by personnel. This distribution range is chaotic, and the relationship between Cainiao Post Stations and communities cannot be accurately divided.

[0044] In the food delivery industry, the goods are delivered from the merchants to the users. There is no warehouse, so there is no limit on inventory and storage capacity. In addition, the delivery range of the merchants is limited and cannot fully cover the urban area.

[0045] Based on this, the present application provides a method for determining the delivery range of a forward warehouse, which is used to make the division of the delivery range more accurate, achieve comprehensive coverage, and improve the efficiency of delivery.

[0046] Figure 2A schematic diagram of a method for determining a forward warehouse delivery range provided in an embodiment of the present application is exemplarily shown as follows: Figure 2 As shown, the method includes:

[0047] Step 201, determine each sub-region in the region to be optimized through historical order data of the region to be optimized, wherein each sub-region includes a first type of sub-region and a second type of sub-region.

[0048] Optionally, the forward warehouse delivery range is determined according to an optimization cycle, that is, the forward warehouse delivery range is optimized once every specific period of time. The historical order data may be the historical order data generated in the last optimization cycle, or the historical order data generated in all previous optimization cycles.

[0049] Preferably, the optimization cycle can be set to three months. Since three months just coincides with domestic climate change, for the forward warehouse, the storage capacity demand for refrigeration, freezing, and room temperature will not change significantly within three months. When the seasons change, due to changes in ambient temperature, the storage capacity demand for refrigeration, freezing, and room temperature will also change, and the user's requirements for commodity categories will also change. In the embodiment of the present application, the commodity category mainly refers to fresh food that needs to be refrigerated, frozen, or stored at room temperature. Therefore, taking three months as an optimization cycle can well ensure the rationality of the distribution range, and will not cause the riders in the front cabin to often need to re-familiarize themselves with the distribution path due to frequent changes in the distribution range, making the administrative management of the forward warehouse relatively simple. It should be noted that the optimization cycle can also be set according to other conditions. For example, in a demolition area, the buildings in the distribution area are often changing, so the optimization cycle can be set to one week. For another example, for some cities in my country located in the subtropical monsoon climate zone. There is no obvious distinction between the four seasons, so the optimization cycle can be set to half a year.

[0050] The historical order data obtained in an optimization cycle includes the destination information of the order, the category and quantity of the goods in the order. Table 1 exemplarily shows a historical order data provided by an embodiment of the present application:

[0051] Table 1

[0052]

[0053] As shown in Table 1, this is the information included in an order data obtained in an optimization cycle. According to Table 1, in this order, the required frozen storage capacity is 20 liters, the normal temperature storage capacity is 15 liters, the refrigerated storage capacity is 10 liters, and the aquatic storage capacity is 50 liters. In addition, according to the order header information, it is determined that the destination of the order is xx community and the order time is 2021 / 02 / 14 / 10:22:30.

[0054] Still Figure 1 As an example, the area to be optimized in step 201 may be Figure 1 The historical order data is the city area in an optimization cycle. Figure 1 Data of all orders generated in the city area in .

[0055] According to the destination of the order, the orders can be divided into the first sub-area and the second sub-area.

[0056] Among them, any order address in the first category of historical order data corresponding to the first category of sub-areas has fence information in the map data. Figure 4 The following is a schematic diagram of a city area map data provided by an embodiment of the present application. Figure 4 As shown in the figure, there are communities A, C, D, shopping malls, industrial parks, factories, schools, hospitals, etc. These areas can obtain fence information based on map data, that is, there is a clear boundary in a two-dimensional plane map, so orders can be gathered into the area surrounded by the boundary in this two-dimensional plane map according to the address of the order. For example, if community A has fence A, then orders 1, 2, and 3 are gathered into the area surrounded by fence A.

[0057] The second type of sub-area is a sub-area determined by aggregating the order addresses in the second type of historical order data; the second type of historical order data is the historical order data whose order addresses do not have fence information in the map data. Figure 4 As shown in the figure, orders 4 to 16 near the urban village are the isolated order addresses in the historical order data. These addresses are located on the roadside, in the urban village, etc. The second type of historical order data is displayed as isolated points in the two-dimensional plane. Therefore, when dividing the delivery range according to these orders, these isolated points need to be processed into a bounded area. Dividing the bounded area reduces the amount of data to be processed and helps to improve the efficiency of determining the delivery range.

[0058] Step 202: Determine the delivery demand information of each sub-region based on the historical order data corresponding to each sub-region.

[0059] According to the above Table 1, the delivery demand information of an order in the historical order data can be determined, including the order address, the order storage capacity requirement, etc. In addition, according to the order placement time and other information, the delivery demand information of each sub-region in a period of time can be determined. For example, the storage capacity for a forward warehouse can be determined in combination with the replenishment time of the forward warehouse. For example, the last replenishment time of the forward warehouse was Sunday, and it was replenished every two days. Then, when dividing the delivery range, the storage capacity restriction condition of the forward warehouse is to accommodate all the goods in the orders expected to be generated on Monday and Tuesday within the delivery range. Once this storage capacity restriction condition is exceeded, the delivery range of this forward warehouse will no longer be increased. It should be understood that the above is only an example of how to determine the delivery demand information of each sub-region and the storage capacity restriction of the forward warehouse based on historical order data. How to determine the delivery range based on the delivery demand information will be introduced in the following steps.

[0060] Step 203: Determine a unique forward warehouse corresponding to each sub-region based on the delivery demand information of each sub-region and the delivery capacity of each forward warehouse in the region to be optimized.

[0061] Step 204: for any forward warehouse, determine the delivery range of the forward warehouse according to the sub-area corresponding to the forward warehouse.

[0062] In the above method, the area to be optimized is divided into the first type of sub-area and the second type of sub-area, and the orders are aggregated into these sub-areas, and then the sub-areas are divided. It is not necessary to process each order, which reduces the amount of data to be processed and effectively improves the efficiency of determining the distribution range of the forward warehouse. And according to the historical order data corresponding to each sub-area, the distribution demand information of each sub-area is determined. Since the historical order data is generated before each sub-area, the distribution demand information extracted from it is less different from the actual distribution demand information, which can better improve the division accuracy of the distribution range of the forward warehouse. According to the distribution demand information and the distribution capacity of the forward warehouse, the sub-area and the forward warehouse are uniquely corresponding, which not only ensures that the forward warehouse will not be overloaded, but also ensures that the distribution demand can be met and the storage space of the forward warehouse will not be wasted. After determining the unique forward warehouse corresponding to each sub-area, the distribution range is divided from the perspective of the forward warehouse, and the corresponding relationship between the single-dimensional sub-area and the forward warehouse is processed into the corresponding relationship between the two-dimensional distribution range and the forward warehouse, which increases the compatibility and flexibility of the forward warehouse distribution range.

[0063] In the above step 201, the second type of sub-region is a sub-region determined by aggregating the order addresses in the second type of historical order data. The method for determining the second type of sub-region is described below. Figure 3 The following is a flow chart showing a method for determining a second type of sub-region provided in an embodiment of the present application. Figure 3 As shown, the method for determining the second type of sub-area includes:

[0064] Step 301: Generate graph structure information based on historical order data of the area to be optimized.

[0065] Continue as Figure 4 As shown, the generated graph structure information includes the bounding boxes of the first type of sub-areas with fence information, such as bounding box A, bounding box C, and bounding box D, and also includes the nodes corresponding to each order address in the second type of historical order data, such as Figure 4 As shown by the white dots in the figure, each node corresponds to an order.

[0066] Step 302: Set a connection line between any two nodes whose distance between the nodes is less than a first distance threshold and which have no intersection with any bounding box.

[0067] For example, assuming that the first distance threshold is 3 km, nodes whose distance between nodes is less than 3 km are connected to form a Figure 4 As shown in the figure, for example, in the urban village area, the lines between nodes 4 to 10 are formed. For the lines that pass through the boundary box of the first type of sub-area, they need to be removed. For example, the line between node 13 and node 16 passes through the boundary box C of community C. Therefore, the line between node 13 and node 16 is deleted.

[0068] Step 303: Determine the second-type sub-regions after clustering the nodes based on the nodes and the connections between the nodes.

[0069] In this step, the weight of the connection is set based on the distance between nodes, where the farther the distance between nodes, the lower the weight. For example, in the urban village area, the distance between nodes 4 and 5 is close, so the weight of the connection between nodes 4 and 5 is large. The distance between nodes 4 and 12 is far, so the weight of the connection between nodes 4 and 12 is low.

[0070] After determining each second-type sub-region after clustering each node, each second-type sub-region is determined based on the weights of each node and the connections between the nodes through a community discovery algorithm.

[0071] The following uses the graph network (GN) algorithm as an example to introduce the basic idea of ​​the community discovery algorithm. The GN algorithm deletes some connections between communities, so each remaining connected part is a community. Define the weight of an edge, and an edge with a high weight is more likely to be an edge between communities than an edge with a low weight. Delete the edge with the smallest weight in the network each time until all edges in the network are deleted. In this way, the process of the community discovery algorithm corresponds to a hierarchical tree built from top to bottom. Just select a suitable hierarchical split in the hierarchical tree. It should be noted that the GN algorithm introduced here is only one of the algorithms for community discovery. The community is a substructure of the network, and its characteristics are that the nodes in the community are closely connected, while the nodes are sparsely connected to nodes outside the community. The community discovery algorithm is an algorithm for discovering communities in a network. In addition, common algorithms include Louvian and LPA.

[0072] Figure 5 The following is a schematic diagram of a city area map data provided by an embodiment of the present application. Figure 5 As shown, a bounding box X is formed in the urban village area, connecting nodes 4, 5, 7, 9, 10, 11, 8 and 4 respectively, and node 6 is enclosed in this bounding box X. Then, bounding box X is the bounding box of this second type of sub-area. Near community C, a bounding box Y is formed, connecting nodes 14, 15 and 16 respectively, and the area enclosed by bounding box Y also forms a second type of sub-area. After determining the bounding box of the second type of sub-area, the orders corresponding to each node can be gathered into the bounding box. In this way, the second type of sub-area can perform the same data processing as the first type of sub-area, effectively improving the efficiency of determining the distribution range.

[0073] It should be noted that when using the community discovery algorithm, there may be independent nodes such as node 12, which have no edges connected to node 12. Therefore, node 12 is treated as a second-type sub-region alone.

[0074] In the above step 203, the unique forward warehouse corresponding to each sub-region can be determined through an integer programming model.

[0075] Integer programming refers to the variables in the programming being restricted to integers. If the variables in the linear model are restricted to integers, it is called integer linear programming. Preferably, the integer programming model in the embodiment of the present application can be a mixed integer programming model, which refers to an integer programming model in which some decision variables are restricted to integers.

[0076] In the embodiment of the present application, the restriction conditions of the integer programming model include:

[0077] Condition 1: The storage capacity demand information of each sub-region corresponding to the forward warehouse is not greater than the storage capacity of the forward warehouse. The corresponding formula is:

[0078]

[0079]

[0080] Where I represents the set of forward warehouses to be selected, j represents any forward warehouse in the set of forward warehouses; J represents the set of sub-areas to be divided, i represents any sub-area to be divided in the set of sub-areas to be divided; k j Refers to the storage capacity requirement of any order in the acquired historical order data; Refers to the maximum storage capacity of any forward warehouse; x ij Indicates whether a sub-region is assigned to forward warehouse i, 1 means that the sub-region is assigned to forward warehouse i, and 0 means that the sub-region is not assigned to forward warehouse i. Formula (2) is used to restrict that a sub-region must be assigned to a forward warehouse.

[0081] Condition 2: The order volume of each sub-area corresponding to the forward warehouse is not greater than the maximum order volume of the forward warehouse, and the order volume of each sub-area corresponding to the forward warehouse is not less than the minimum order volume of the forward warehouse. The corresponding formula is:

[0082]

[0083] Where n j Refers to all orders in the historical order data obtained, Refers to the maximum number of orders that any forward warehouse can carry. It refers to the minimum order quantity limit for any forward warehouse.

[0084] Condition 3: The distance between the forward warehouse and the corresponding sub-areas is not greater than the second distance threshold. The corresponding formula is:

[0085]

[0086] Among them, d ij is the distance from any sub-area to any forward warehouse, D j is the second distance threshold.

[0087] Condition 4: The proportion of orders whose distance from the forward warehouse to the corresponding sub-regions is greater than the third distance threshold is less than the proportion threshold. The corresponding formula is:

[0088]

[0089] Among them, z ij =1 means that any sub-area is assigned to a forward warehouse and the distance is greater than the third distance threshold, zij =0 means that the above conditions are not met. Represents the maximum number of orders allowed that are greater than the third distance threshold.

[0090] Input one or more of the above conditions 1 to 4 into the mixed integer optimization model, and set the optimization goal to minimize the total delivery distance from the forward warehouse to the corresponding sub-regions. The corresponding formula is:

[0091]

[0092] Through the above mixed integer optimization model, all sub-areas are assigned to the forward warehouse, and one sub-area corresponds to only one forward warehouse, and one forward warehouse corresponds to multiple sub-areas. At this time, there is a point-to-point correspondence between the forward warehouse and the sub-area. Since one forward warehouse may correspond to multiple sub-areas, the multiple sub-areas corresponding to this forward warehouse should be divided into a large distribution area.

[0093] The following is a method for dividing multiple sub-areas into large distribution areas. Figure 6 The following is a schematic flow chart of a method for dividing a delivery area provided in an embodiment of the present application, including:

[0094] Step 601: for any forward warehouse, all sub-areas corresponding to the forward warehouse are regarded as a set of points, and a concave hull algorithm or a convex hull algorithm is used to generate a coverage range of the forward warehouse covering all points in the set.

[0095] Step 602, determine whether any forward warehouse exceeds the original delivery range; if so, execute step 603; if not, execute step 604.

[0096] Step 603: remove the first part of the existing delivery range that exceeds the forward warehouse. The existing delivery range of the forward warehouse is the delivery range before optimization.

[0097] Step 604: merge the second part of the existing delivery range of the forward warehouse that does not belong to the coverage range of any forward warehouse into the coverage range of the forward warehouse.

[0098] Step 605, obtain the updated coverage area, and obtain the optimized delivery area of ​​the forward warehouse based on the updated coverage area.

[0099] Figure 7 The following is a schematic diagram of a delivery range provided by an embodiment of the present application. Figure 7As shown in the figure, the area circled by the thick circle is the coverage of the forward warehouse that uses the concave hull algorithm or the convex hull algorithm to generate the coverage of all points in the set. The area circled by the thin circle is the original delivery range, and the middle area A does not belong to the original delivery range. The original delivery range was divided manually according to the streets, so the shape is relatively regular. In the original delivery range, some areas do not need to be delivered, which may be due to the poor delivery conditions in these areas, or these areas have never generated orders. Therefore, these areas need to be removed from the optimized delivery range. Figure 7 In the original delivery range, area A is not delivered. Therefore, area A needs to be removed from the newly generated delivery range. The area between the thick line and the thin line does not belong to the coverage of any forward warehouse generated by the algorithm, so this part needs to be incorporated into the coverage of the forward warehouse.

[0100] In a possible implementation, the above-mentioned method for generating the coverage range of the forward warehouse can be executed for one forward warehouse. After judging one forward warehouse, another forward warehouse is judged, and finally the coverage range of all forward warehouses is generated.

[0101] In another possible implementation, the above method can be executed for all forward warehouses. The delivery ranges of all forward warehouses are summarized and compared with the original delivery ranges to generate the final coverage range of all forward warehouses.

[0102] In the above step 601, for any forward warehouse, the convex hull algorithm is used to generate the initial coverage range of the forward warehouse covering all points in the set; due to the characteristics of the convex hull algorithm, the generated initial coverage range overlaps, so it is necessary to eliminate the overlapping areas of the initial coverage ranges of any two forward warehouses.

[0103] Optionally, the sub-areas in the overlapping area are exchanged and allocated to the forward warehouses, and the initial coverage of the forward warehouses is updated until there is no overlapping area between the forward warehouses. If there is no overlapping area between any two forward warehouses, and the order volume of the sub-areas corresponding to each forward warehouse meets the delivery threshold, the coverage of the forward warehouse is obtained.

[0104] In one possible implementation, if the total number of intersecting edges in the overlapping area meets the first condition, the correspondence between the vertex and any two forward warehouses is changed according to the distance from any two forward warehouses to the vertex, and the correspondence satisfies the minimum distance increment between the vertex and the forward warehouse.

[0105] Figure 8 The following is a schematic diagram of an overlap area provided in an embodiment of the present application. Figure 8As shown, the first setting condition is: the total number of intersecting edges is 4, including edge 801, edge 802, edge 803, and edge 804, and the vertices of the overlapping parts are point A, point B, and point C. According to the distance from forward warehouse 1 and forward warehouse 2 to point A, point B, and point C, vertices B and vertex C are assigned to forward warehouse 1, and vertex A is assigned to forward warehouse 2, so that the distance increment between the vertex and the forward warehouse is minimized. For each overlapping area, after the vertices are redistributed, the convex hull algorithm is used to update the coverage area. In each iteration, only the vertices at the edge of the overlapping area are removed. The points inside the overlapping area are gradually removed in subsequent iterations.

[0106] In another possible implementation, if the total number of intersecting edges in the overlapping area meets the second condition, a sub-area containing the least order volume and not an overlapping area is determined, and this sub-area is allocated to other forward warehouses.

[0107] Fig. 9 Another schematic diagram of overlapping areas provided in the embodiment of the present application is exemplarily shown. Fig. 9 As shown, the second setting condition is: the total number of intersecting edges is 8, including edge 901, edge 902, edge 903, edge 904, 905, edge 906, edge 907, and edge 908. Among them, sub-area 911 is in the delivery range of forward warehouse 4, and sub-area 912 is in the delivery range of forward warehouse 3. And sub-area 911 and sub-area 912 are not in the overlapping area, so sub-area 911 is reallocated to forward warehouse 3, and sub-area 912 is reallocated to forward warehouse 4. After the sub-areas are reallocated, the convex hull algorithm is used to update the coverage area.

[0108] In the above step 605, for the updated coverage range, for any forward warehouse, if it is determined according to the map data that the coverage range is divided into at least two sub-coverage ranges, it is determined whether the order volume within the sub-coverage range after the division is greater than the order volume threshold; if so, it is determined that the sub-coverage range belongs to the forward warehouse; if not, it is determined that the sub-coverage range belongs to the forward warehouse closest to the sub-coverage range.

[0109] Fig.10 The following is a schematic diagram showing the coverage of a forward warehouse provided in an embodiment of the present application. Fig.10 As shown, the coverage range of the forward warehouse 5 is divided into sub-coverage range one and sub-coverage range two by the river, and it is determined whether the order volume in sub-coverage range two is greater than the order volume threshold. If it is greater, sub-coverage range two is still divided into the coverage range of the forward warehouse 5; if it is less, sub-coverage range two is divided into the coverage range of the forward warehouse 6 closest to coverage range two.

[0110] In the above manner, when the coverage area is divided, the order volume of the sub-coverage area is determined. If the order volume of the sub-coverage area is too small, the cost of delivering these orders across the partition is high, so the sub-coverage area is allocated to other nearby forward warehouses. If the order volume in the coverage area is large enough, the cost of delivering these orders across the partition is low, so the sub-coverage area is still divided into the original delivery area.

[0111] Based on the same technical concept, an embodiment of the present application also provides a device for determining the delivery range of a forward warehouse. Fig.11 The schematic diagram of a device for determining the delivery range of a forward warehouse provided in an embodiment of the present application is exemplarily shown. The device can execute the aforementioned method for determining the delivery range of a forward warehouse, such as Fig.11 As shown, the device comprises:

[0112] The order aggregation module 1101 is used to determine each sub-region in the area to be optimized through the historical order data of the area to be optimized, wherein each sub-region includes a first-category sub-region and a second-category sub-region, and any order address in the first-category historical order data corresponding to the first-category sub-region has fence information in the map data; the second-category sub-region is a sub-region determined after aggregating the order addresses in the second-category historical order data; the second-category historical order data is historical order data whose order addresses do not have fence information in the map data;

[0113] A data preprocessing module 1102 is used to determine the delivery demand information of each sub-region according to the historical order data corresponding to each sub-region;

[0114] The area allocation module 1103 is used to determine a unique forward warehouse corresponding to each sub-area based on the delivery demand information of each sub-area and the delivery capacity of each forward warehouse in the area to be optimized;

[0115] The delivery range generating module 1104 is used to determine the delivery range of any forward warehouse according to the sub-area corresponding to the forward warehouse.

[0116] In one possible implementation, the area allocation module 1103 is specifically used to determine the unique forward warehouse corresponding to each sub-area through an integer programming model; the restriction conditions of the integer programming model are that the storage capacity demand information of each sub-area corresponding to the forward warehouse is not greater than the storage capacity of the forward warehouse, and the order quantity of each sub-area corresponding to the forward warehouse is not greater than the maximum carrying order quantity of the forward warehouse; the optimization goal of the integer programming model is to shorten the total delivery distance from the forward warehouse to the corresponding sub-area.

[0117] Based on the same technical concept, an embodiment of the present invention further provides a computing device, including: a memory for storing program instructions;

[0118] The processor is used to call the program instructions stored in the memory and execute the following according to the obtained program: Figure 2 , Figure 3 and Figure 6 The method indicated.

[0119] Based on the same technical concept, an embodiment of the present invention further provides a computer-readable storage medium, which, when the computer program product is run on a processor, implements the following Figure 2 , Figure 3 and Figure 6 The method indicated.

[0120] Based on the same technical concept, an embodiment of the present invention further provides a computer program product, which, when executed on a processor, implements the following Figure 2 , Figure 3 and Figure 6 The method indicated.

[0121] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0122] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0123] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0124] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps of the functions specified in one or more boxes. Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A method for determining the delivery range of a forward warehouse, characterized in that: The method comprises: Determine each sub-region in the area to be optimized through the historical order data of the area to be optimized, wherein each sub-region includes a first-category sub-region and a second-category sub-region, and any order address in the first-category historical order data corresponding to the first-category sub-region has fence information in the map data; the second-category sub-region is a sub-region determined after aggregating the order addresses in the second-category historical order data; the second-category historical order data is historical order data whose order addresses do not have fence information in the map data; Determine the delivery demand information of each sub-region according to the historical order data corresponding to each sub-region, and determine the unique forward warehouse corresponding to each sub-region based on the delivery demand information of each sub-region and the delivery capacity of each forward warehouse in the region to be optimized; For any forward warehouse, each sub-area corresponding to the forward warehouse is regarded as a set of points, and a concave hull algorithm or a convex hull algorithm is used to generate a coverage range of the forward warehouse covering all points in the set, a first part of the coverage range of the forward warehouse that exceeds the existing delivery range of the forward warehouse is removed, and a second part of the existing delivery range of the forward warehouse that does not belong to the coverage range of any forward warehouse is incorporated into the coverage range of the forward warehouse to obtain an updated coverage range, and based on the updated coverage range, an optimized delivery area of ​​the forward warehouse is obtained; the existing delivery range of the forward warehouse is the delivery range before optimization; The second type of sub-region is a sub-region determined by aggregating order addresses in the second type of historical order data, including: generating graph structure information based on the historical order data of the area to be optimized, the graph structure information including a bounding box of the first type of sub-region and nodes corresponding to each order address in the second type of historical order data; setting a connection line between any two nodes whose distance between the nodes is less than a first distance threshold and have no intersection with any bounding box, and determining each second type of sub-region after each node is clustered based on the connection lines between each node; Wherein, the coverage range of the forward warehouse covering all points in the set is generated using a convex hull algorithm, including: if there is an overlapping area between the initial coverage ranges of any two forward warehouses, the total number of intersecting edges in the overlapping area is determined; if the total number of intersecting edges in the overlapping area meets the first condition, then for any point in the overlapping area, the correspondence between any point in the overlapping area and any two forward warehouses is changed according to the distance from the any two forward warehouses to any point in the overlapping area, and the correspondence satisfies that the distance increment between the point and the forward warehouse is minimal; if the total number of intersecting edges in the overlapping area meets the second condition, the sub-area containing the least order volume and not an overlapping area is determined, the sub-area is allocated to other forward warehouses, and the initial coverage range of the forward warehouse is updated using the convex hull algorithm until there is no overlapping area between the forward warehouses; when there is no overlapping area between any two forward warehouses and the order volume of each sub-area corresponding to each forward warehouse meets the delivery threshold, the coverage range of the forward warehouse is obtained.

2. The method according to claim 1, characterized in that Based on each node and the connection between each node, each second-class sub-region after each node is clustered is determined, including: Set the weight of the connection based on the distance between nodes, where the farther the distance between nodes, the lower the weight; Through the community discovery algorithm, each second-category sub-area is determined based on the weights of each node and the connections between nodes.

3. The method according to claim 1, characterized in that Based on the distribution demand information of each sub-region and the distribution capacity of each forward warehouse, a unique forward warehouse corresponding to each sub-region is determined, including: Through the integer programming model, determine the unique forward warehouse corresponding to each sub-region; The restriction condition of the integer programming model is that the storage capacity demand information of each sub-area corresponding to the forward warehouse is not greater than the storage capacity of the forward warehouse, and the order quantity of each sub-area corresponding to the forward warehouse is not greater than the maximum carrying quantity of the forward warehouse; The optimization goal of the integer programming model is to minimize the total delivery distance from each forward warehouse to the corresponding sub-areas.

4. The method according to any one of claims 1 to 3, characterized in that Based on the updated coverage, the optimized delivery area of ​​the forward warehouse is obtained, including: For the coverage area of ​​any forward warehouse, if it is determined according to the map data that the coverage area is divided into at least two sub-coverage areas, then determining whether the order volume in the sub-coverage areas after the division is greater than the order volume threshold; If yes, it is determined that the sub-coverage area belongs to the forward warehouse; If not, it is determined that the sub-coverage range belongs to the forward warehouse closest to the sub-coverage range.

5. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed, the method according to any one of claims 1 to 4 is executed.

6. A computing device, characterized in that include: A memory for storing program instructions; A processor is used to call the program instructions stored in the memory and execute the method according to any one of claims 1 to 4 according to the obtained program.

Citation Information

Patent Citations

  • Preposed warehouse fresh food shopping and distribution mode

    CN107292565A

  • Distribution range generation method and device, electronic equipment and storage medium

    CN109615122A

  • Warehousing goods update method and apparatus, and logistics system

    WO2021068700A1