Method, device, terminal equipment and storage medium for determining logistics distribution network

Abstract

The embodiment of the present invention discloses a method, device, terminal device and storage medium for determining a logistics distribution network. The method includes: taking an initial network as a candidate network, determining its lower bound value and upper bound value; cyclically taking the network with the smallest lower bound value in the candidate network as a parent node, and determining whether to stop the loop according to the difference value between the lower bound value and the upper bound value of the parent node; if the loop is not stopped, generating a child node by setting the subsequent connectivity relationship between a site and a sorting center based on the parent node; updating the row candidate network according to the lower bound value of the child node; if the loop is stopped, taking the network corresponding to the upper bound value of the parent node when the loop is stopped as the logistics distribution network; the lower bound value is determined based on the previous connectivity relationship between the warehouse and the sorting center in the corresponding network; the upper bound value is determined based on the previous connectivity relationship and the subsequent connectivity relationship between the site and the sorting center in the corresponding network. For large-scale networks, the solution can be quickly obtained, and the rationality of the current solution can be evaluated.

Description

Technical Field

[0001] Embodiments of the present invention relate to the field of logistics and transportation, and in particular to a method, apparatus, terminal equipment and storage medium for determining a logistics distribution network. Background Art

[0002] In the field of logistics and transportation, the network composed of warehouses, sorting centers and stations is called a logistics distribution network. By building the connectivity between warehouses, sorting centers and stations, the logistics distribution network can be determined. In the prior art, two main solution algorithms can be applied to determine the logistics distribution network: the exact algorithm and the heuristic algorithm.

[0003] In the process of implementing the present invention, the inventors found that there are at least the following technical problems in the prior art:

[0004] When using precise algorithms to determine large-scale networks, it is difficult to solve the network within an acceptable time due to the large amount of calculations; when using heuristic algorithms to determine the network, the rationality of the current solution cannot be evaluated due to the randomness of the solution process. Summary of the invention

[0005] The embodiments of the present invention provide a method, apparatus, terminal device and storage medium for determining a logistics distribution network, which can not only quickly solve a large-scale network, but also evaluate the rationality of the current solution.

[0006] In a first aspect, an embodiment of the present invention provides a method for determining a logistics distribution network, comprising:

[0007] Taking the initial network as a candidate network, determining the lower bound value and the upper bound value of the initial network; the connectivity relationship between the sorting centers in the initial network is preset;

[0008] The network with the smallest lower bound value in the current candidate network is determined as the parent node in a loop, and whether to stop the loop is determined according to the difference between the lower bound value and the upper bound value of the parent node determined in the current loop;

[0009] If the loop is not stopped, then the child nodes of the parent node are generated by setting the subsequent connectivity relationship between the site and the sorting center based on the parent node; and the candidate network is updated according to the lower bound value of the child node;

[0010] If the loop is stopped, the network corresponding to the upper bound value of the parent node determined when the loop is stopped is determined as the logistics distribution network;

[0011] Among them, the lower limit value is the transportation cost determined based on the preceding connectivity relationship between the warehouse and the sorting center in the corresponding network; the upper limit value is the transportation cost determined based on the subsequent connectivity relationship between the site and the sorting center in the corresponding network on the basis of the preceding connectivity relationship.

[0012] In a second aspect, an embodiment of the present invention provides a device for determining a logistics distribution network, including:

[0013] An initialization module, used to take an initial network as a candidate network and determine a lower bound value and an upper bound value of the initial network; the connectivity relationship between the sorting centers in the initial network is preset;

[0014] An evaluation module is used to cyclically determine the network with the smallest lower bound value in the current candidate network as the parent node, and determine whether to stop the loop according to the difference between the lower bound value and the upper bound value of the parent node determined in the current loop;

[0015] A branch and bound module, for generating a child node of the parent node by setting a subsequent connectivity relationship between the site and the sorting center based on the parent node if the loop is not stopped; and updating the candidate network according to the lower bound value of the child node;

[0016] A network determination module, for determining, if the loop is stopped, a network corresponding to the upper bound value of the parent node determined when the loop is stopped as a logistics distribution network;

[0017] Among them, the lower limit value is the transportation cost determined based on the preceding connectivity relationship between the warehouse and the sorting center in the corresponding network; the upper limit value is the transportation cost determined based on the subsequent connectivity relationship between the site and the sorting center in the corresponding network on the basis of the preceding connectivity relationship.

[0018] In a third aspect, an embodiment of the present invention provides a terminal device, including:

[0019] one or more processors;

[0020] A memory for storing one or more programs;

[0021] When the one or more programs are executed by the one or more processors, the one or more processors implement the method for determining a logistics distribution network as described in any embodiment of the present invention.

[0022] In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method for determining a logistics distribution network as described in any embodiment of the present invention.

[0023] The embodiment of the present invention provides a method, apparatus, terminal device and storage medium for determining a logistics distribution network. The method takes an initial network as a candidate network, determines a lower boundary value and an upper boundary value of the initial network; the connectivity relationship between sorting centers in the initial network is preset; the network with the smallest lower boundary value in the current candidate network is determined as a parent node in a loop, and determines whether to stop the loop according to the difference value between the lower boundary value and the upper boundary value of the parent node determined in the current loop; if the loop is not stopped, a child node of the parent node is generated by setting a subsequent connectivity relationship between a site and a sorting center on the basis of the parent node; the candidate network is updated according to the lower boundary value of the child node; if the loop is stopped, the network corresponding to the upper boundary value of the parent node determined when the loop is stopped is determined as a logistics distribution network; wherein the lower boundary value is a transportation cost determined based on the previous connectivity relationship between the warehouse and the sorting center in the corresponding network; and the upper boundary value is a transportation cost determined based on the previous connectivity relationship and the subsequent connectivity relationship between the site and the sorting center in the corresponding network.

[0024] By taking the candidate network with the minimum lower bound value as the parent node, generating branch child nodes according to the feasible settings of the subsequent connectivity relationship in the parent node, and delimiting based on the lower bound value of the child node to update the candidate network, the full amount of branch and bound is avoided, thereby speeding up the network solution and enabling rapid determination for large-scale networks.

[0025] In addition, by determining the lower limit of the transportation cost based on the preceding connectivity relationship between the warehouse and the sorting center in the network, and determining the upper limit of the transportation cost based on the following connectivity relationship between the site and the sorting center on the basis of the preceding connectivity relationship, the evaluation standard for the rationality of the network can be obtained. Since the upper and lower limits determined based on the above technical features are the same when the logistics distribution network is globally optimal, the rationality of the parent node can be evaluated based on the difference between the upper and lower limits of the parent node in the current cycle. Furthermore, by stopping the cycle when the parent node is evaluated as reasonable and determining the final logistics distribution network, the quality and speed of network solution can be balanced. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0027] Figure 1 A flow chart of a method for determining a logistics distribution network provided in Embodiment 1 of the present invention is shown;

[0028] Figure 2A schematic diagram of an initial network in a method for determining a logistics distribution network provided in Embodiment 1 of the present invention is shown;

[0029] Figure 3 A schematic diagram showing the step-by-step determination of a lower limit value and an upper limit value in a method for determining a logistics distribution network provided in Embodiment 1 of the present invention;

[0030] Figure 4 A schematic diagram showing a method for determining a logistics distribution network lower boundary value provided in a second embodiment of the present invention is shown;

[0031] Figure 5 A schematic diagram showing a method for determining a logistics distribution network provided in a third embodiment of the present invention for determining a network boundary value is shown;

[0032] Figure 6 A flowchart based on a priority queue in a method for determining a logistics distribution network provided by a fourth embodiment of the present invention is shown;

[0033] Figure 7 A schematic diagram of the structure of a device for determining a logistics distribution network provided by a fifth embodiment of the present invention is shown;

[0034] Figure 8 A schematic diagram of the hardware structure of a terminal device provided in Embodiment 6 of the present invention is shown. DETAILED DESCRIPTION

[0035] In order to make the purpose, technical solutions and advantages of the present invention clearer, the technical solutions of the present invention will be clearly and completely described through implementation methods with reference to the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments in 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. In the following embodiments, each embodiment provides optional features and examples at the same time. The various features recorded in the embodiments can be combined to form multiple optional solutions. Each numbered embodiment should not be regarded as only one technical solution.

[0036] Embodiment 1

[0037] Figure 1A flow chart of a method for determining a logistics distribution network provided in the first embodiment of the present invention is shown. The method for determining a logistics distribution network provided in the embodiment of the present invention can be applied to the case of determining a logistics distribution network, such as a network determined for the connectivity relationship between sorting centers, determining the antecedent connectivity relationship between a warehouse and a sorting center, and determining the latter connectivity relationship between a site and a sorting center. The method can be executed by a device for determining a logistics distribution network, which is implemented in software and / or hardware, and is preferably configured in a terminal device, such as a terminal device such as a computer.

[0038] like Figure 1 As shown, the method for determining a logistics distribution network provided in an embodiment of the present invention includes the following steps:

[0039] S110, taking the initial network as a candidate network, and determining the lower limit value and the upper limit value of the initial network; the connectivity relationship between the sorting centers in the initial network is preset.

[0040] In the embodiment of the present invention, the initial network can be considered as a network in which the connectivity relationship between the sorting centers has been pre-set, while the preceding connectivity relationship between the warehouse and the sorting center is waiting to be set, and the following connectivity relationship between the site and the sorting center is waiting to be set. By determining the preceding connectivity relationship between the warehouse and the sorting center and the following connectivity relationship between the site and the sorting center in the initial network, the logistics distribution network can be determined. Among them, the logistics distribution network can be a logistics distribution network applied to a certain region or a certain city, or a trunk logistics distribution network applied to multiple regions or multiple cities.

[0041] For example, Figure 2 FIG. 1 is a schematic diagram showing an initial network in a method for determining a logistics distribution network provided in Embodiment 1 of the present invention. Figure 2 , the initial network may include warehouse k1-warehouse k3, sorting center f1-sorting center f6, site z1-site z4. Among them, the solid line connection can indicate that the connectivity relationship between the two ends of the connection has been determined, and there is no need to set the connectivity relationship; the dotted line connection can indicate that the connectivity relationship between the two ends of the two lines is not determined, and the connectivity relationship needs to be set. For example, Figure 2 The internal connectivity relationship between f1-f6 is certain, while the connectivity relationship between k1-k3 and the sorting center, and the connectivity relationship between z1-z4 and the sorting center are uncertain.

[0042] Among them, the antecedent / successor connectivity relationship in the logistics distribution network can be determined on the basis of the initial network with the goal of minimizing the overall transportation cost of the network. Among them, the transportation cost between each two logistics points in the network (logistics points include warehouses, sorting centers and stations) can be considered to be positively correlated with the amount of goods transported and the transportation distance between the logistics points. Among them, the transportation distance between the logistics points can be determined based on the geographical location between the two points. Among them, the amount of goods transported can be predicted by the prediction model for the amount of goods between the two logistics points; wherein the prediction model can be generated by learning and training based on the characteristics of the two logistics points in the sample logistics network in the historical records (such as the location between the two logistics points, traffic characteristics, physical point storage characteristics, etc.), and the amount of goods at the logistics points.

[0043] Moreover, during the transportation cost estimation process, it can also be determined based on the feasible configuration of the predecessor / successor connectivity relationship. Among them, the lower limit value of the transportation cost can be considered as the minimum estimated value of the overall transportation cost; the upper limit value of the transportation cost can be considered as the maximum estimated value of the overall transportation cost. Moreover, the lower limit value can be the transportation cost determined based on the predecessor connectivity relationship between the warehouse and the sorting center in the corresponding network; the upper limit value can be the transportation cost determined based on the predecessor connectivity relationship and the subsequent connectivity relationship between the station and the sorting center in the corresponding network.

[0044] For example, Figure 3 The following is a schematic diagram showing the staged determination of the lower bound and upper bound values ​​in a method for determining a logistics distribution network provided by the first embodiment of the present invention. For any network (e.g., the initial network, and the network of parent nodes and child nodes disclosed later), the lower bound and upper bound values ​​of the overall transportation cost can be predicted based on the current network if the configuration of each connectivity relationship is completed. Figure 3 , the first stage estimation can estimate the lower bound value of the network, and the second stage estimation can estimate the lower bound value of the network.

[0045] In the first stage estimation: first, the minimum cost of the feasible setting of the predecessor connectivity relationship of a warehouse can be estimated; then the predecessor connectivity relationship of the site can be determined based on the estimation result; finally, the lower bound value can be estimated based on the predecessor connectivity relationship of each site.

[0046] It is understandable that when each warehouse sets the previous connectivity relationship to generate the minimum cost, the corresponding subsequent connectivity relationship may be different. For example, see Figure 2, the following situations may exist in the first stage estimation: when warehouse k1 sets the previous connection relationship to generate the minimum cost, site z1 needs to be connected to sorting center f5; and when warehouse k2 sets the previous connection relationship to generate the minimum cost, site z1 needs to be connected to sorting center f6. Therefore, the lower bound value can be understood as the ideal minimum transportation cost, which is usually smaller than the actual transportation cost.

[0047] In the second stage of estimation: based on the determination of the previous connectivity of the site, the minimum cost of the feasible setting of the subsequent connectivity of a site can be estimated first; then, the upper bound value can be estimated based on the minimum cost of each site. It can be understood that the upper bound value is the estimated transportation cost of the network based on the idealized lower bound value.

[0048] By dividing the transportation cost into two stages, the lower and upper bounds are obtained, and the evaluation criteria for the rationality of the network can be obtained. Since the upper and lower bounds determined based on the above technical characteristics are the same when the logistics distribution network is globally optimal, the rationality of the network can be evaluated by determining the upper and lower bounds.

[0049] S120, looping to determine the network with the smallest lower bound value in the current candidate network as the parent node, and determining whether to stop the loop according to the difference between the lower bound value and the upper bound value of the parent node determined in the current loop.

[0050] In this embodiment, the current candidate network includes the initial network in the initial cycle, and as the parent node is branched in the subsequent cycle process, more candidate networks can be updated. Since the logistics distribution network is determined with the minimum transportation cost as the goal, in each cycle process, the network with the smallest lower bound value can be used as the parent node to generate a logistics distribution network based on the parent node, or the candidate network can be continuously updated based on the parent node.

[0051] Among them, when the rationality of the parent node meeting the requirements is evaluated based on the gap value between the lower limit value and the upper limit value of the parent node determined in the current loop, it can be determined to stop the loop; when the rationality of the parent node not meeting the requirements is evaluated based on the gap value between the lower limit value and the upper limit value of the parent node determined in the current loop, it can be determined to continue the loop.

[0052] In some optional embodiments, whether to stop the loop is determined based on the difference between the lower bound value and the upper bound value of the parent node determined in the current loop, including: determining the relative difference between the lower bound value and the upper bound value of the parent node determined in the current loop, and stopping the loop if the relative difference is less than or equal to a preset threshold.

[0053] In these optional implementations, the relative difference between the lower bound and the upper bound of the parent node can be expressed as Among them, UB can represent the upper limit value of the parent node, and LB can represent the lower limit value of the parent node. Among them, the preset threshold value can be set according to the empirical value or the experimental value. Since when the logistics distribution network is globally optimal, the upper limit value is the same as the lower limit value (that is, GAP is 0), when the relative difference corresponding to the parent node is less than or equal to the preset threshold, it can be considered that the gap between the parent node and the global optimal solution is small, and the current parent node has met the rationality requirements. In addition, by judging the rationality of the parent node based on the relative difference, it is beneficial to make the determination method applicable to both scenarios with higher transportation costs (such as logistics distribution scenarios between cities) and scenarios with lower transportation costs (such as logistics distribution scenarios within cities). The determination of the logistics distribution network can improve the scope of application of the determination method.

[0054] In addition, in some other implementations, in addition to determining whether to stop the loop based on the relative difference corresponding to the parent node, other loop stop conditions may be preset. Other loop stop conditions may include, for example: a preset number of loops N, all subsequent connectivity relationships are set, etc. In these achievable methods, the loop may be stopped when the current number reaches the preset number of loops, which can avoid the situation where too many loops lead to a long time consumption when the preset threshold is set unreasonably. The loop may also be stopped when all subsequent connectivity relationships are set, so as to obtain the global optimal solution of the logistics distribution network.

[0055] S130, if the loop is not stopped, then the child nodes of the parent node are generated by setting the subsequent connectivity relationship between the site and the sorting center based on the parent node; and the candidate network is updated according to the lower bound value of the child node.

[0056] In this embodiment, when the rationality of the parent node not meeting the requirements is evaluated based on the gap value corresponding to the current parent node, it can be considered that the current parent node is far from the global optimal solution. At this time, the connectivity relationship of a certain site in the subsequent connectivity relationship between the site to be determined and the sorting center can be set based on the parent node, that is, branching can be performed based on the parent node, in order to generate a new candidate network that is closer to the global optimal solution.

[0057] In some optional embodiments, a child node of a parent node is generated by setting a subsequent connectivity relationship between a site and a sorting center on the basis of the parent node, including: selecting a first site from sites for which a connectivity relationship is not set in the parent node; and determining a network in which a subsequent connectivity relationship between the first site and the sorting center is set on the basis of the parent node as a child node of the parent node.

[0058] by Figure 2For example, in the first cycle, the parent node is the initial network, which usually does not meet the rationality. In this case, it is necessary to generate child nodes of the initial network. Generating child nodes based on the initial network may include: randomly selecting the first site from sites z1-z4 that have not been set up with a connectivity relationship, such as selecting z1; and setting the connectivity relationship between z1 and the sorting center based on the parent node, such as setting z1 to be connected to f5 to obtain a child node, and setting z1 to be connected to f6 to obtain another child node.

[0059] In these optional implementations, by gradually fixing the subsequent connectivity relationships, not only the amount of calculation can be reduced, but also the estimation of the upper and lower bounds of the network can be made more accurate, which is conducive to quickly obtaining a network that is closer to the global optimal solution for continued circulation or output of the logistics distribution network.

[0060] In this embodiment, after the child nodes of the parent node are generated, it is also possible to determine whether the child nodes are optimizations of the parent node based on the lower bound values ​​of the generated child nodes, that is, to delimit each child node.

[0061] In some optional implementations, updating the candidate network according to the lower bound value of the child node may include: when the lower bound value of the child node is less than the upper bound value of the parent node, taking the child node as a new candidate network and deleting the parent node.

[0062] Among them, since the lower bound value of the child node is usually closer to the true value than the lower bound value of the parent node, the lower bound value of the child node is usually greater than or equal to the lower bound value of the parent node. However, when the lower bound value of the child node is too large, for example, greater than or equal to the upper bound value of the parent node, then the upper bound value of the child node is usually larger than the upper bound value of the parent node. At this time, the child node is farther from the global optimal solution than the parent node, and the child node may not be updated to the candidate network, that is, the child node is pruned. On the contrary, when the lower bound value of the child node is less than the upper bound value of the parent node, the child node can be used as a new candidate network.

[0063] In these optional implementations, by pruning some of the child nodes with lower rationality generated by the branching process, full branching can be avoided, thereby improving the network determination speed. At the same time, after obtaining child nodes closer to the global optimal solution based on the parent node, the parent node with poor satisfaction can be deleted, so that only the current better network can be retained as a candidate network to reduce storage space consumption.

[0064] In this embodiment, after the candidate network is updated, the loop of step S120 can be continued until the parent node in the evaluation loop meets the rationality of the requirements. By taking the candidate network with the minimum lower bound value as the parent node, generating branch child nodes according to the feasible setting of the subsequent connectivity relationship in the parent node, and delimiting based on the lower bound value of the child node to update the candidate network, the full amount of branch and bound is avoided, thereby speeding up the network solution speed and enabling rapid determination for large-scale networks.

[0065] S140. If the loop is stopped, the network corresponding to the upper limit value of the parent node determined when the loop is stopped is determined as the logistics distribution network.

[0066] In this embodiment, when the rationality of the parent node meeting the demand is evaluated based on the gap value corresponding to the current parent node, it can be considered that the current parent node is close to the global optimal solution. At this time, the loop can be stopped, and the logistics distribution network can be determined based on the parent node determined when the loop is stopped. Among them, since the network corresponding to the upper limit value of the parent node determines both the antecedent connectivity relationship and the posterior connectivity relationship, the network corresponding to the upper limit value of the parent node can be determined as the logistics distribution network.

[0067] A method for determining a logistics distribution network provided by an embodiment of the present invention uses a candidate network with a minimum lower bound value as a parent node, generates branch child nodes according to a feasible setting of the subsequent connectivity relationship in the parent node, and performs delimitation based on the lower bound value of the child node to update the candidate network, thereby avoiding full branch and delimitation, thereby speeding up the network solution speed and enabling rapid determination for large-scale networks.

[0068] In addition, by determining the lower limit of the transportation cost based on the preceding connectivity relationship between the warehouse and the sorting center in the network, and determining the upper limit of the transportation cost based on the following connectivity relationship between the site and the sorting center on the basis of the preceding connectivity relationship, the evaluation standard for the rationality of the network can be obtained. Since the upper and lower limits determined based on the above technical features are the same when the logistics distribution network is globally optimal, the rationality of the parent node can be evaluated based on the difference between the upper and lower limits of the parent node in the current cycle. Furthermore, by stopping the cycle when the parent node is evaluated as reasonable and determining the final logistics distribution network, the quality and speed of network solution can be balanced.

[0069] Embodiment 2

[0070] Based on the above embodiment, this embodiment describes in detail the steps of determining the lower limit value. By pre-constructing the connectivity relationship between a warehouse and each first sorting center, the transportation cost can be predicted according to the connectivity relationship constructed each time; according to the transportation cost predicted each time, the best connectivity mode between the warehouse and the first sorting center can be obtained; further, the lower limit value can be determined according to the best connectivity mode of each warehouse.

[0071] For example, Figure 4 A schematic diagram showing a method for determining a logistics distribution network lower bound value provided in a second embodiment of the present invention is shown. Figure 4 In the network shown in FIG. 1 , in some optional implementations, the step of determining the lower bound value may include:

[0072] First, traverse the warehouses in the network, and use the network composed of the current traversed warehouse and the network except all warehouses in the candidate network as the first sub-network. Figure 4 , taking the currently traversed warehouse as warehouse k1 as an example, the first subnetwork is k1, and Figure 4 The network composition excluding all warehouses, that is, the first sub-network includes k1, sorting centers f1-f6, and sites z1-z4.

[0073] Then, with the goal of minimizing the transportation cost of the first subnetwork, determine the previous connectivity relationship between the current traversed warehouse and the first sorting center in the sorting center. The sorting center can be divided into several layers, and the sorting center in the layer that is geographically close to the warehouse can be called the first sorting center. Figure 4 , the sorting centers f1 and f2 can be called the first sorting centers. When the currently traversed warehouse is k1, the connectivity relationship between k1 and f1 and f2 can be set respectively, and the transportation cost of the first subnetwork when connected with f1 and f2 can be determined. In addition, the connectivity relationship corresponding to the minimum transportation cost of the first subnetwork can be determined as the previous connectivity relationship between k1 and the first sorting center.

[0074] Finally, the lower bound of the network is determined based on the previous connectivity relationship of each warehouse. After the previous connectivity relationship of each warehouse is determined by the above method, the transportation costs corresponding to the previous connectivity relationship of each warehouse can be summed to obtain the lower bound of the network.

[0075] Reference again Figure 4 In some further implementations, with the goal of minimizing the transportation cost of the first subnetwork, determining the preceding connectivity relationship between the current traversed warehouse and the first sorting center among the sorting centers includes:

[0076] First, a connection relationship is established between the currently traversed warehouse and the first sorting center among the sorting centers, and the sum of the minimum transportation costs from the first sorting center with the currently established connection relationship to each site is determined.

[0077] Taking the warehouse currently traversed as warehouse k1 and the first sorting center currently connected to k1 as f1 as an example, determining the sum of the transportation costs from f1 to z1-z4 may include: traversing z1-z4, for the currently traversed site (taking z1 as an example), respectively setting the connectivity between the site and the connectable sorting centers (for example, respectively setting the connectivity between z1 and f5 and f6); estimating the transportation cost from k1 to the currently traversed site, and determining the minimum transportation cost corresponding to the current site (for example, respectively determining the transportation cost C from f1 to f5 to z1); estimating the transportation cost from k1 to the currently traversed site, and determining the minimum transportation cost corresponding to the current site (for example, respectively determining the transportation cost C from f1 to f5 to z1); estimating the transportation cost from k1 to the currently traversed site, and determining the minimum transportation cost C from f1 to f5 to z1; estimating the transportation cost from k1 to the currently traversed site, and determining the minimum transportation cost C from f1 to f5 to z1; estimating the transportation cost C from k ... f1,z5 , and determine the transportation cost C from f1 to f6 to z1 f1,z6 , and take the minimum value from them); after the traversal is completed, sum the minimum transportation costs corresponding to z1-z4 to obtain a minimum transportation cost sum C f1 .

[0078] Then, according to the sum of the minimum transportation costs corresponding to each first sorting center, the preceding connectivity relationship between the current traversed warehouse and the first target center in the first sorting center is determined.

[0079] Based on the same method as above, determine the sum of the transportation costs from f2 to z1-z4, C f2 . Then, the minimum value of the total transportation cost of the currently traversed warehouse can be determined; for example, the total transportation cost C when k1 is connected to f1 is sum1 =C k1,f1 +C f1 ; The total transportation cost C when k1 is connected to f2 sum2 =C k1,f2 +C f2 Then, the connectivity relationship corresponding to the minimum total transportation cost can be determined as the preceding connectivity relationship between the current traversed warehouse and the first target center in the first sorting center; for example, when C sum1 When it is the smallest, the first target center that establishes a preceding connectivity relationship with the currently traversed warehouse k1 can be determined to be the sorting center f1.

[0080] In these further implementations, by estimating the total transportation cost based on feasible configurations of the predecessor / successor connectivity relationship, it is possible to determine the connectivity relationship between the current traversal warehouse and the first target center based on the minimum total transportation cost.

[0081] Based on the above embodiment, the embodiment of the present invention describes in detail the steps of determining the lower limit value. By pre-constructing the connectivity relationship between a warehouse and each first sorting center respectively, the transportation cost can be predicted according to the connectivity relationship constructed each time; according to the transportation cost predicted each time, the best connectivity mode between the warehouse and the first sorting center can be obtained; then, the determination of the lower limit value can be achieved according to the best connectivity mode of each warehouse. In addition, the method for determining the logistics distribution network proposed in the embodiment of the present invention and the above embodiment belongs to the same inventive concept, and the technical details not described in detail in this embodiment can be referred to the above embodiment, and this embodiment has the same beneficial effects as the above embodiment.

[0082] Embodiment 3

[0083] Based on the above embodiment, this embodiment describes in detail the steps of determining the upper limit value. By pre-constructing the connectivity relationship between a site and each second sorting center based on the connectivity relationship determined in the previous item, the transportation cost can be predicted according to the connectivity relationship constructed each time; according to the transportation cost predicted each time, the best connectivity mode between the site and the second sorting center can be obtained; further, the upper limit value can be determined according to the best connectivity mode of each site.

[0084] For example, Figure 5 FIG. 1 is a schematic diagram showing a method for determining a logistics distribution network according to a third embodiment of the present invention, in which a network upper boundary value is determined. Figure 5 In the network shown in FIG. 1 , in some optional implementations, the step of determining the upper limit value may include:

[0085] First, based on the previous connectivity relationship, the sites in the network that have no connectivity relationship set are traversed, and the network composed of the current traversed sites, the sites with connectivity set, and the network excluding all sites in the network is used as the second sub-network.

[0086] The preceding connectivity relationship can be determined by the method provided in the above embodiment, or by other methods with the goal of minimizing transportation costs, such as machine learning models. After determining the preceding connectivity relationship of the network, the upper limit value can be determined based on it.

[0087] See also Figure 5 , the previous connectivity relationship between warehouses k1-k3 and the sorting center has been determined. Figure 5 In the example, the currently traversed site without a connected relationship is z1. Due to the control of the site with a connected relationship, the second sub-network consists of z1 and Figure 5 The network composition excluding all sites, that is, the second sub-network includes z1, sorting centers f1-f6, and warehouses k1-k3.

[0088] Then, taking the minimization of the transportation cost of the second sub-network as the goal, the subsequent connectivity relationship between the current traversal site and the second sorting center in the sorting centers is determined.

[0089] The sorting center can be divided into several layers, and the sorting center in the layer that is geographically close to the site can be called the second sorting center. Figure 5 , the sorting centers f5 and f6 can be called the second sorting centers. When the currently traversed site is z1, the connectivity relationship between z1 and f5 and f6 can be set respectively, and the transportation cost of the second sub-network when connected with f5 and f6 can be determined. In addition, the connectivity relationship corresponding to the minimum transportation cost of the second sub-network can be determined as the subsequent connectivity relationship between z1 and the second sorting center.

[0090] Finally, the upper bound of the network is determined according to the subsequent connectivity relationship of each station. After the subsequent connectivity relationship of each station is determined by the above method, the transportation cost corresponding to the subsequent connectivity relationship of each station can be summed to obtain the upper bound of the network.

[0091] Reference again Figure 5 In some further implementations, with the goal of minimizing the transportation cost of the second subnetwork, determining the subsequent connectivity relationship between the current traversal site and the second sorting center in the sorting center includes:

[0092] First, a connection relationship is established between the current traversal site and the second sorting center in the sorting center, and the sum of the transportation costs from each warehouse to the current traversal site corresponding to the second sorting center with the current connection relationship is determined.

[0093] Taking the currently traversed site without a connected relationship as z1, and the second sorting center currently connected to z1 as f5 as an example, determining the transportation cost and corresponding to f5 from warehouse k1-k3 to z1 may include: determining the transportation cost from k1-k3 to f5 to z1, C k1,f5,z1 , C k2,f5,z1 and C k3,f5,z1 , and add the three items to get the transportation cost and C from warehouse k1-k3 to z1 corresponding to f5 f5,z1 .

[0094] Then, according to the sum of the transportation costs corresponding to each second sorting center, the subsequent connectivity relationship between the current traversal site and the second target center in the second sorting center is determined.

[0095] Based on the same method as above, determine the transportation cost and C from warehouse k1-k3 to z1 corresponding to f6 f6,z1 . Then, C f5,z1 and Cf6,z1 The subsequent connectivity relationship corresponding to the minimum value in is determined as the second target center that establishes the subsequent connectivity relationship with the currently traversed z1; for example, when C f5,z1 When it is the smallest, the second target center that establishes a subsequent connectivity relationship with the currently traversed z1 can be determined to be the sorting center f5.

[0096] In these further implementations, the subsequent connectivity relationship of the current traversal site can be determined based on the sum of the transportation costs from each warehouse to the current traversal site, and the subsequent connectivity relationship of each site can be realized based on the same method.

[0097] The embodiment of the present invention describes in detail the steps of determining the upper limit value based on the above embodiment. By pre-constructing the connectivity relationship between a site and each second sorting center based on the connectivity relationship determined in the previous item, the transportation cost can be predicted according to the connectivity relationship constructed each time; according to the transportation cost predicted each time, the best connectivity method between the site and the second sorting center can be obtained; and then, the upper limit value can be determined according to the best connectivity method for each site. In addition, the method for determining the logistics distribution network proposed in the embodiment of the present invention and the above embodiment belongs to the same inventive concept. The technical details not described in detail in this embodiment can be referred to the above embodiment, and this embodiment has the same beneficial effects as the above embodiment.

[0098] Embodiment 4

[0099] This embodiment adds the technical feature of a priority queue based on the above embodiment. Based on the feature that the priority queue can be sorted according to the priority of the data attributes therein, the parent node can be quickly obtained in each cycle.

[0100] For example, Figure 6 The flowchart of the method for determining a logistics distribution network based on a priority queue provided by the fourth embodiment of the present invention is shown. Figure 6 , the method for determining the logistics distribution network may include the following steps:

[0101] S610: Taking the initial network as a candidate network, determining the lower bound value and the upper bound value of the initial network; the connectivity relationship between the sorting centers in the initial network is preset.

[0102] Among them, the lower limit value is the transportation cost determined based on the preceding connectivity relationship between the warehouse and the sorting center in the corresponding network; the upper limit value is the transportation cost determined based on the subsequent connectivity relationship between the site and the sorting center in the corresponding network on the basis of the preceding connectivity relationship.

[0103] S620, cyclically adding each candidate network to the priority queue; wherein the priority of the priority queue is set according to the lower limit value of each candidate network.

[0104] In this embodiment, data representing the connectivity relationship of each logistics point in the candidate network (e.g., data in matrix format) can be added to the priority queue as a node. Among them, the queue attributes of the node may include but are not limited to: the lower limit value of the network represented by the node, the parent node of the node (i.e., the data corresponding to the connectivity relationship of each logistics point in the parent node network of the node representation network), and the subsequent connectivity state of the node (i.e., the setting of the subsequent connectivity relationship in the node representation network). Among them, the priority queue can set the priority for the node according to the lower limit value in the queue attribute, that is, set the priority for the candidate network corresponding to the node.

[0105] When the initial network, the lower bound value and the upper bound value of the initial network are determined, the priority queue can be initialized accordingly. The step of initializing the priority queue can include: adding the data representing the connectivity relationship of each logistics point in the initial network as a root node to the priority queue; and setting queue attributes for the root node.

[0106] S630: Determine the parent node in the current candidate network according to the priority, and determine whether to stop the loop according to the difference between the lower bound value and the upper bound value of the parent node determined in the current loop.

[0107] Among them, the node with the smallest lower bound value can be set as the highest priority, so that the parent node in each cycle can be the node with the highest priority, which is conducive to the rapid determination of the parent node. After the parent node is determined, it can be determined whether to stop the cycle based on the difference between the lower bound value and the upper bound value of the parent node.

[0108] S640: If the loop is not stopped, a child node of the parent node is generated by setting a subsequent connectivity relationship between the site and the sorting center based on the parent node; and the candidate network is updated according to the lower bound value of the child node.

[0109] Among them, the site without a connection relationship can be determined according to the subsequent connection state attribute in the priority queue, and then the subsequent connection relationship between the first site and the sorting center in the unset connection relationship can be set to generate the child node of the parent node. Among them, after the candidate network is updated, it can jump to step S620, add a new node to the priority queue according to the newly added candidate network, and set the queue attribute of the new node; it can also pop up the corresponding parent node in the priority queue according to the parent node attribute of the newly added node to ensure that the node corresponding to the updated candidate network is always stored in the priority queue.

[0110] S650: If the loop is stopped, the network corresponding to the upper limit value of the parent node determined when the loop is stopped is determined as the logistics distribution network.

[0111] When the parent node in the current cycle is evaluated to meet rationality, the parent node can be popped out, and the parent node that is popped out when the cycle stops can be determined as a logistics distribution network.

[0112] The embodiment of the present invention adds the technical features of the priority queue based on the above embodiment. Based on the feature that the priority queue can be sorted according to the priority of the data attributes therein, the parent node can be quickly obtained in each cycle. In addition, the method for determining the logistics distribution network proposed in the embodiment of the present invention and the above embodiment belongs to the same inventive concept, and the technical details not described in detail in this embodiment can be referred to the above embodiment, and this embodiment has the same beneficial effects as the above embodiment.

[0113] Embodiment 5

[0114] Figure 7 The structure diagram of a device for determining a logistics distribution network provided by Embodiment 5 of the present invention is shown. The device for determining a logistics distribution network provided by the embodiment of the present invention can be applied to situations where a logistics distribution network is determined, such as a network determined for connectivity relationships between sorting centers, a situation where a front-end connectivity relationship between a warehouse and a sorting center is determined, and a situation where a back-end connectivity relationship between a site and a sorting center is determined.

[0115] like Figure 7 As shown, the device for determining a logistics distribution network in an embodiment of the present invention includes:

[0116] Initialization module 710, used to take the initial network as a candidate network and determine the lower bound value and the upper bound value of the initial network; the connectivity relationship between the sorting centers in the initial network is preset;

[0117] Evaluation module 720, used for looping to determine the network with the smallest lower bound value in the current candidate network as the parent node, and determining whether to stop the loop according to the difference between the lower bound value and the upper bound value of the parent node determined in the current loop;

[0118] The branch and bound module 730 is used to generate child nodes of the parent node by setting the subsequent connectivity relationship between the site and the sorting center based on the parent node if the loop is not stopped; and update the candidate network according to the lower bound value of the child node;

[0119] A network determination module 740, for determining, if the loop is stopped, a network corresponding to the upper bound value of the parent node determined when the loop is stopped as a logistics distribution network;

[0120] Among them, the lower limit value is the transportation cost determined based on the preceding connectivity relationship between the warehouse and the sorting center in the corresponding network; the upper limit value is the transportation cost determined based on the subsequent connectivity relationship between the site and the sorting center in the corresponding network on the basis of the preceding connectivity relationship.

[0121] In some optional implementations, the branch and bound module includes:

[0122] The branch unit is used to select the first site from the sites that are not connected in the parent node; and determine the network that is connected with the first site and the sorting center on the basis of the parent node as the child node of the parent node.

[0123] In some optional implementations, the branch and bound module includes:

[0124] The delimiting unit is used to treat the child node as a new candidate network and delete the parent node when the lower bound value of the child node is less than the upper bound value of the parent node.

[0125] In some optional implementations, the initialization module and the branch and bound module may include:

[0126] The lower limit value determination unit is used to determine the lower limit value according to the following determination steps:

[0127] The warehouses in the traversal network are used, and the network formed by the currently traversed warehouse and the network except all warehouses in the candidate network is used as the first sub-network;

[0128] Taking the transportation cost of the first sub-network as the minimum as the goal, determine the previous connectivity relationship between the current traversed warehouse and the first sorting center in the sorting center;

[0129] Determine the lower bound of the network based on the previous connectivity relationship of each warehouse.

[0130] In some optional implementations, the lower limit value determination unit may be specifically used to:

[0131] Establishing a connection relationship between the currently traversed warehouse and the first sorting center among the sorting centers, and determining the sum of the minimum transportation costs from the first sorting center currently established with a connection relationship to each site;

[0132] According to the sum of the minimum transportation costs corresponding to each first sorting center, the preceding connectivity relationship between the current traversed warehouse and the first target center in the first sorting center is determined.

[0133] In some optional implementations, the initialization module and the evaluation module may further include:

[0134] The upper limit value determining unit is used to determine the upper limit value according to the following determining steps:

[0135] On the basis of the connectivity relationship in the previous item, the sites in the network that are not set with connectivity are traversed, and the network formed by the currently traversed site, the site with connectivity set, and the network excluding all sites in the network is used as the second sub-network;

[0136] Taking the transportation cost of the second sub-network as the minimum as the goal, determine the subsequent connectivity relationship between the current traversal site and the second sorting center in the sorting center;

[0137] The upper bound of the network is determined based on the subsequent connectivity relationship of each site.

[0138] In some optional implementations, the upper limit value determining unit may be specifically used to:

[0139] Establishing a connection relationship between the current traversal site and the second sorting center in the sorting center, and determining the sum of the transportation costs from each warehouse to the current traversal site corresponding to the second sorting center that has established a connection relationship;

[0140] According to the sum of the transportation costs corresponding to each second sorting center, the subsequent connectivity relationship between the current traversal site and the second target center in the second sorting center is determined.

[0141] In some optional implementations, the device for determining the logistics distribution network may further include:

[0142] A queue adding module is used to add each candidate network to a priority queue; wherein the priority of the priority queue is set according to the lower limit value of each candidate network;

[0143] Accordingly, the evaluation module can be used to determine the parent node in the current candidate network according to the priority.

[0144] In some optional implementations, the evaluation module may be specifically used to:

[0145] Determine the relative difference between the lower bound value and the upper bound value of the parent node determined in the current loop, and stop the loop if the relative difference is less than or equal to a preset threshold.

[0146] The device for determining a logistics distribution network provided in an embodiment of the present invention belongs to the same inventive concept as the method for determining a logistics distribution network provided in the above embodiment. Technical details not fully described in the embodiment of the present invention can be referred to the above embodiment, and the embodiment of the present invention has the same beneficial effects as the above embodiment.

[0147] Embodiment 6

[0148] Figure 8 The hardware structure diagram of a terminal device provided by the sixth embodiment of the present invention is shown. The terminal device in the embodiment of the present invention may include but is not limited to mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 8The terminal device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0149] like Figure 8 As shown, the terminal device 800 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 801, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 802 or a program loaded from a storage device 808 to a random access memory (RAM) 803. In the RAM 803, various programs and data required for the operation of the terminal device 800 are also stored. The processing device 801, the ROM 802, and the RAM 803 are connected to each other via a bus 804. An input / output (I / O) interface 805 is also connected to the bus 804.

[0150] Typically, the following devices may be connected to the I / O interface 805: input devices 806 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; output devices 807 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 808 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 809. The communication devices 809 may allow the terminal device 800 to communicate with other devices wirelessly or by wire to exchange data. Although Figure 8 The terminal device 800 is shown to have various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead.

[0151] In particular, according to an embodiment of the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present invention includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication device 809, or installed from the storage device 808, or installed from the ROM 802. When the computer program is executed by the processing device 801, the above functions defined in the method for determining the logistics distribution network provided by the embodiment of the present invention are executed.

[0152] The terminal provided in the embodiment of the present invention and the method for determining the logistics distribution network provided in the above embodiment belong to the same inventive concept. The technical details not fully described in the embodiment of the present invention can be referred to the above embodiment, and the embodiment of the present invention has the same beneficial effects as the above embodiment.

[0153] Embodiment 7

[0154] An embodiment of the present invention provides a computer-readable storage medium having a computer program stored thereon. When the program is executed by a processor, the method for determining a logistics distribution network provided in the above embodiment is implemented.

[0155] It should be noted that the computer-readable storage medium in the embodiment of the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM) or a flash memory (FLASH), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In an embodiment of the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, device or device. In an embodiment of the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer readable signal media may also be any computer readable medium other than computer readable storage media, which may send, propagate, or transmit programs for use by or in conjunction with an instruction execution system, apparatus, or device. The program code contained on the computer readable medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0156] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (Hyper Text Transfer Protocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or future developed network.

[0157] The computer-readable storage medium may be included in the terminal device, or may exist independently without being installed in the terminal device.

[0158] The terminal device stores and carries one or more programs. When the one or more programs are executed by the terminal device, the terminal device:

[0159] The initial network is taken as a candidate network, and the lower and upper bounds of the initial network are determined; the connectivity relationship between the sorting centers in the initial network is preset; the network with the smallest lower bound in the current candidate network is determined as the parent node in a loop, and whether to stop the loop is determined according to the difference between the lower and upper bounds of the parent node determined in the current loop; if the loop is not stopped, the child nodes of the parent node are generated by setting the subsequent connectivity relationship between the site and the sorting center on the basis of the parent node; the candidate network is updated according to the lower bound value of the child node; if the loop is stopped, the network corresponding to the upper bound value of the parent node determined when the loop is stopped is determined as the logistics distribution network; wherein the lower bound value is the transportation cost determined based on the previous connectivity relationship between the warehouse and the sorting center in the corresponding network; the upper bound value is the transportation cost determined based on the previous connectivity relationship and the subsequent connectivity relationship between the site and the sorting center in the corresponding network.

[0160] Computer program code for performing the operations of the present invention may be written in one or more programming languages, or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0161] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the function pages marked in the square box can occur in a different order from the order marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0162] The units involved in the embodiments of the present invention may be implemented by software or hardware, wherein the name of a unit does not limit the unit itself in some cases.

[0163] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

[0164] Note that the above are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art will understand that the present invention is not limited to the specific embodiments herein, and that various obvious changes, readjustments and substitutions can be made by those skilled in the art without departing from the scope of protection of the present invention. Therefore, although the present invention has been described in more detail through the above embodiments, the present invention is not limited to the above embodiments, and may include more other equivalent embodiments without departing from the concept of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

Claims

1. A method for determining a logistics distribution network, characterized in that: include: Taking the initial network as a candidate network, determining a lower bound value and an upper bound value of the initial network; The connectivity relationship between the sorting centers in the initial network is preset; The network with the smallest lower bound value in the current candidate network is determined as the parent node in a loop, and whether to stop the loop is determined according to the difference between the lower bound value and the upper bound value of the parent node determined in the current loop; If the loop is not stopped, a child node of the parent node is generated by setting a subsequent connectivity relationship between the site and the sorting center based on the parent node; the candidate network is updated according to the lower bound value of the child node; wherein the child node is a network for which the subsequent connectivity relationship is set based on the parent node; If the loop is stopped, the network corresponding to the upper bound value of the parent node determined when the loop is stopped is determined as the logistics distribution network; The lower limit is the transportation cost determined based on the preceding connectivity relationship between the warehouse and the sorting center in the corresponding network; the upper limit is the transportation cost determined based on the subsequent connectivity relationship between the station and the sorting center in the corresponding network on the basis of the preceding connectivity relationship; The step of determining the lower limit value includes: Traversing the warehouses in the network, and taking the network formed by the currently traversed warehouse and the network excluding all warehouses in the candidate network as the first sub-network; Taking the transportation cost of the first sub-network as the minimum as the goal, determining the preceding connectivity relationship between the currently traversed warehouse and the first sorting center among the sorting centers; The lower bound of the network is determined based on the transportation costs corresponding to the preceding connectivity relationships of the warehouses.

2. The method according to claim 1, characterized in that The generating of the child node of the parent node by setting the subsequent connectivity relationship between the site and the sorting center based on the parent node includes: Selecting a first site from sites that are not connected to the parent node; A network having a subsequent connectivity relationship between the first site and the sorting center set on the basis of the parent node is determined as a child node of the parent node.

3. The method according to claim 1, characterized in that The updating of the candidate network according to the lower bound value of the child node includes: When the lower bound value of the child node is less than the upper bound value of the parent node, the child node is used as a new candidate network and the parent node is deleted.

4. The method according to claim 1, characterized in that The step of determining the preceding connectivity relationship between the currently traversed warehouse and the first sorting center among the sorting centers with the goal of minimizing the transportation cost of the first sub-network includes: Establishing a connection relationship between the currently traversed warehouse and the first sorting center among the sorting centers, and determining the sum of the minimum transportation costs from the first sorting center currently established with a connection relationship to each of the sites; According to the sum of the minimum transportation costs corresponding to each of the first sorting centers, a preceding connectivity relationship between the current traversed warehouse and the first target center in the first sorting center is determined.

5. The method according to claim 1, characterized in that The step of determining the upper limit value comprises: On the basis of the aforementioned connectivity relationship, traverse the sites in the network that are not set with connectivity, and use the network formed by the currently traversed sites, the sites with connectivity set, and the network other than all the sites in the network as the second sub-network; Taking the transportation cost of the second sub-network as the minimum as the goal, determining the subsequent connectivity relationship between the current traversal site and the second sorting center among the sorting centers; An upper limit value of the network is determined according to the subsequent connectivity relationship of each of the sites.

6. The method according to claim 5, characterized in that The step of determining the subsequent connectivity relationship between the current traversal site and the second sorting center among the sorting centers with the goal of minimizing the transportation cost of the second sub-network includes: Establishing a connection relationship between the current traversal site and the second sorting center among the sorting centers respectively, and determining the sum of the transportation costs from each of the warehouses to the current traversal site corresponding to the second sorting center with which the connection relationship is currently established; According to the sum of the transportation costs corresponding to each of the second sorting centers, a subsequent connectivity relationship between the current traversal site and the second target center in the second sorting center is determined.

7. The method according to claim 1, characterized in that Also includes: Adding each candidate network to a priority queue; wherein the priority of each candidate network in the priority queue is set according to the lower limit value of each candidate network; Correspondingly, determining the network with the smallest lower bound value in the current candidate networks as the parent node includes: determining the parent node in the current candidate networks according to the priority.

8. The method according to claim 1, characterized in that The step of determining whether to stop the loop according to the difference between the lower bound value and the upper bound value of the parent node determined in the current loop comprises: The relative difference between the lower bound value and the upper bound value of the parent node determined in the current loop is determined, and if the relative difference is less than or equal to a preset threshold, the loop is stopped.

9. A device for determining a logistics distribution network, characterized in that: include: An initialization module, used to take the initial network as a candidate network and determine the lower bound value and the upper bound value of the initial network; The connectivity relationship between the sorting centers in the initial network is preset; An evaluation module is used to cyclically determine the network with the smallest lower bound value in the current candidate network as the parent node, and determine whether to stop the loop according to the difference between the lower bound value and the upper bound value of the parent node determined in the current loop; A branch and bound module, for generating a child node of the parent node by setting a subsequent connectivity relationship between the site and the sorting center based on the parent node if the loop is not stopped; and updating the candidate network according to the lower bound value of the child node; wherein the child node is a network for which the subsequent connectivity relationship is set based on the parent node; A network determination module, for determining, if the loop is stopped, a network corresponding to the upper bound value of the parent node determined when the loop is stopped as a logistics distribution network; The lower limit is the transportation cost determined based on the preceding connectivity relationship between the warehouse and the sorting center in the corresponding network; the upper limit is the transportation cost determined based on the subsequent connectivity relationship between the station and the sorting center in the corresponding network on the basis of the preceding connectivity relationship; Among them, the initialization module and the branch and bound module may include: The lower limit value determination unit is used to determine the lower limit value according to the following determination steps: Traversing the warehouses in the network, and taking the network formed by the currently traversed warehouse and the network excluding all warehouses in the candidate network as the first sub-network; Taking the transportation cost of the first sub-network as the minimum as the goal, determining the preceding connectivity relationship between the currently traversed warehouse and the first sorting center among the sorting centers; The lower bound of the network is determined based on the transportation costs corresponding to the preceding connectivity relationships of the warehouses.

10. A terminal device, characterized in that: The terminal comprises: one or more processors; A memory for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the method for determining a logistics distribution network as described in any one of claims 1-8.

11. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, it implements the method for determining a logistics distribution network as described in any one of claims 1-8.

Images