WO2023098698A1 - Logistics distribution network determination method and apparatus, terminal device, and storage medium - Google Patents

Abstract

A logistics distribution network determination method and apparatus, a terminal device, and a storage medium. The logistics distribution network determination method comprises: taking an initial network as a candidate network, determining a lower bound value and an upper bound value of the initial network; taking a candidate network having a minimum lower bound value as a parent node in a current loop, and determining, according to a difference between a lower bound value and an upper bound value of the parent node, whether to stop the loop or not; if not stopping the loop, generating a subnode by setting the consequent connected relationship between a station and a sorting center on the basis of the father node; updating the candidate network in the current loop according to a lower bound value of the subnode, and entering a next loop; and if stopping the loop, taking a network corresponding to an upper bound value of the parent node when stopping the loop as a logistics distribution network. The lower bound value is determined on the basis of the antecedent connected relationship between a warehouse and a sorting center in a corresponding network, and the upper bound value is determined on the basis of the consequent connected relationship between a station and a sorting center in a corresponding network and the antecedent connected relationship.

Description

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

This application claims priority to a Chinese patent application with application number 202111444293.9 filed with the China Patent Office on November 30, 2021, the entire contents of which are incorporated herein by reference.

technical field

The present application relates to the field of logistics transportation, for example, to a method, device, terminal equipment and storage medium for determining a logistics distribution network.

Background technique

In the field of logistics and transportation, the network composed of warehouses, sorting centers and stations can be called a logistics distribution network. By constructing the connection relationship among warehouses, sorting centers and stations, the logistics distribution network can be determined. In the related technology, for the determination of the logistics distribution network, two kinds of solving algorithms, the precise algorithm and the heuristic algorithm, can be mainly applied.

There are at least the following technical problems in the related art:

When using precise algorithms to determine large-scale networks, due to the large amount of calculations, it is difficult to complete the solution to the network within an acceptable time; when using heuristic algorithms to determine networks, due to the randomness of the solution process, it is impossible to evaluate the current rationality of the solution.

Contents of the invention

The present application provides a method, device, terminal equipment, and storage medium for determining a logistics distribution network, which can not only quickly solve large-scale networks, but also evaluate the rationality of the current solution.

In the first aspect, the present application provides a method for determining a logistics distribution network, including:

Using the initial network as a candidate network, determining the lower bound value and upper bound value of the initial network; wherein the connection relationship between multiple sorting centers in the initial network is preset;

Determine the candidate network with the minimum lower bound value as the parent node in the current loop, 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;

If the cycle is not stopped, then by setting the subsequent connected relationship between the station and the sorting center on the basis of the parent node, the child node of the parent node is generated; the candidate network in the current cycle is updated according to the lower bound value of the child node , and enter the next cycle;

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 connection relationship between the warehouse and the sorting center in the corresponding network; The transport cost is determined by the subsequent connectivity relationship of the center.

In a second aspect, the present application provides a device for determining a logistics distribution network, including:

The initialization module is configured to use the initial network as a candidate network, and determine the lower limit value and the upper limit value of the initial network; wherein, the connection relationship between multiple sorting centers in the initial network is preset;

The evaluation module is configured to determine the candidate network with the smallest lower bound value as the parent node in the current cycle, and determine whether to stop the cycle according to the difference between the lower bound value and the upper bound value of the parent node determined in the current cycle;

The branch and delimitation module is configured to generate a child node of the parent node by setting the subsequent connection relationship between the station and the sorting center on the basis of the parent node if the loop is not stopped; according to the lower bound value of the child node Update the candidate network in the current cycle and enter the next cycle;

The network determination module is configured to determine the network corresponding to the upper bound value of the parent node determined when the cycle is stopped as the logistics distribution network if the cycle is stopped;

Wherein, the lower bound value is the transportation cost determined based on the previous connection relationship between the warehouse and the sorting center in the corresponding network; The transport cost is determined by the subsequent connectivity relationship of the center.

In a third aspect, the present application provides a terminal device, including:

one or more processors;

memory configured to store one or more programs;

When the one or more programs are executed by the one or more processors, the one or more processors are made to implement the above-mentioned method for determining the logistics distribution network.

In a fourth aspect, the present application provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the above-mentioned method for determining a logistics distribution network is implemented.

Description of drawings

FIG. 1 is a flowchart of a method for determining a logistics distribution network provided in Embodiment 1 of the present application;

FIG. 2 is a schematic diagram of an initial network in a method for determining a logistics distribution network provided in Embodiment 1 of the present application;

Fig. 3 is a schematic diagram of determining the lower limit value and the upper limit value in stages in a method for determining a logistics distribution network provided in Embodiment 1 of the present application;

FIG. 4 is a schematic diagram of determining the network lower limit value in a method for determining a logistics distribution network provided in Embodiment 2 of the present application;

Fig. 5 is a schematic diagram of determining the network upper limit value in a method for determining a logistics distribution network provided in Embodiment 3 of the present application;

FIG. 6 is a flow diagram based on a priority queue in a method for determining a logistics distribution network provided in Embodiment 4 of the present application;

FIG. 7 is a schematic structural diagram of a device for determining a logistics distribution network provided in Embodiment 5 of the present application;

FIG. 8 is a schematic diagram of a hardware structure of a terminal device provided in Embodiment 6 of the present application.

Detailed ways

The following will describe the technical solutions of the present application through implementation with reference to the drawings in the embodiments of the present application, and the described embodiments are part of the embodiments of the present application. In the following multiple embodiments, optional features and examples are provided in each embodiment, and multiple features described in the embodiments can be combined to form multiple optional solutions.

Embodiment one

FIG. 1 is a flowchart of a method for determining a logistics distribution network provided in Embodiment 1 of the present application. The method for determining the logistics distribution network provided in the embodiment of the present application can be applied to the situation of determining the logistics distribution network, such as a network determined for the connection relationship between multiple sorting centers, determining the previous connection relationship between the warehouse and the sorting center, and Determine the status of the connection relationship between the station and the sorting center. The method can be executed by a device for determining the logistics distribution network, which is implemented in the form of software and/or hardware, and can be configured in a terminal device, for example, in a terminal device such as a computer.

As shown in Figure 1, the method for determining the logistics distribution network provided in the embodiment of the present application includes:

S110. Using the initial network as a candidate network, determine a lower limit value and an upper limit value of the initial network; the connection relationship between multiple sorting centers in the initial network is preset.

In the embodiment of this application, the initial network can be considered as the connection relationship between the sorting centers has been preset, while the previous connection relationship between the warehouse and the sorting center is waiting to be set, and the subsequent connection between the station and the sorting center A network of relationships waiting to be set. The determination of the logistics distribution network can be realized by determining the former connection relationship between the warehouse and the sorting center in the initial network, and the latter connection relationship between the station and the sorting center. Wherein, the logistics distribution network may be a logistics distribution network applied within a region or within a city, or a trunk logistics distribution network applied between multiple regions and multiple cities.

Exemplarily, FIG. 2 is a schematic diagram of an initial network in a method for determining a logistics distribution network provided in Embodiment 1 of the present application. Referring to Fig. 2, the initial network may include warehouse k ₁ - warehouse k ₃ , sorting center f ₁ - sorting center f ₆ , station z ₁ -site z ₄ . Among them, the solid line can indicate that the connected relationship between the two ends of the line has been determined, and there is no need to set the connected relationship; the dashed connected line can indicate that the connected relationship between the two ends of the two lines has not been determined, and the connected relationship needs to be set. For example, in Fig. 2, the connection relationship within f ₁ -f ₆ is determined, but the connection relationship between k ₁ -k ₃ and the sorting center and z ₁ -z ₄ and the sorting center is uncertain.

The connection relationship between the previous term and the latter term 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 every two logistics points in the network (logistics points include warehouses, sorting centers and stations) can be considered to be positively correlated with the quantity of goods transported and the transportation distance between logistics points. Among them, the transportation distance between logistics points can be determined according to the geographical location between the two points. The quantity of goods transported can be obtained by predicting the quantity of goods between the two logistics points according to the forecast model; , physical point storage characteristics, etc.), and the cargo volume of the logistics point are generated through learning and training.

In addition, in the process of estimating the transportation cost, it can also be determined according to the feasible configuration of the previous item/next item connectivity relationship. Wherein, the lower bound value of the transportation cost can be regarded as the minimum estimated value of the overall transportation cost; the upper bound value of the transportation cost can be regarded as the maximum estimated value of the overall transportation cost. In addition, the lower bound value can be the transportation cost determined based on the preceding connectivity relationship between the warehouse and the sorting center in the corresponding network; the upper bound value can be based on the preceding connectivity relationship, based on the subsequent term of the station and the sorting center in the corresponding network The transportation cost determined by the connectivity relationship.

Exemplarily, FIG. 3 is a schematic diagram of determining the lower limit value and the upper limit value in stages in a method for determining a logistics distribution network provided in Embodiment 1 of the present application. For any network (such as the initial network, and the network of parent nodes and child nodes disclosed later), based on the current network, if multiple connectivity relationships are configured, the lower bound of the overall transportation cost can be predicted separately through two-stage estimation values and upper bounds. Referring to FIG. 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.

In the first stage of estimation: firstly, the minimum cost generated by the feasible setting of the antecedent connectivity of a warehouse can be estimated; then the antecedent connectivity of the site can be determined according to the estimation results; finally, according to the antecedent connectivity of multiple sites The estimated lower bound value of the connectivity relationship.

When different warehouses set the preceding connection relationship to produce the minimum cost, the corresponding subsequent connection relationship may be different. For example, referring to Fig. 2, the following situation may exist in the first stage of estimation: when warehouse k ₁ sets the previous connection relationship to produce the minimum cost, station z ₁ needs to be connected with sorting center f ₅ ; and warehouse k ₂ sets the previous connection When the relationship produces the minimum cost, station z ₁ needs to be connected with sorting center f ₆ . Therefore, the lower bound value can be the idealized minimum transportation cost, which is usually smaller than the real transportation cost.

In the second stage of estimation: on the basis of determining the antecedent connectivity relationship of the site, the minimum cost generated by the feasible setting of the subsequent connectivity relationship of each site can be estimated first; then, the minimum cost can be estimated based on the minimum cost of different sites upper bound value. The upper bound value is the estimated transportation cost of the network based on the idealized lower bound value.

By dividing the transportation cost into two stages of estimation, the lower bound value and upper bound value can be obtained, and the evaluation standard of network rationality can be obtained. Since the logistics distribution network is globally optimal, the upper and lower bounds determined based on the above technical characteristics are the same. By determining the upper and lower bounds of the network, the rationality of the network can be evaluated to lay a foundation.

S120. In the current loop, determine the candidate network with the smallest lower bound value 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.

In this embodiment, the current candidate network includes the initial network during the initial cycle, and more candidate networks can be updated as the parent node is branched during the subsequent cycle. Since the logistics distribution network is determined with the goal of minimizing the transportation cost, in each cycle, the network with the smallest lower bound value can be used as the parent node to generate the logistics distribution network according to the parent node, or continue to update the candidate network based on the parent node .

When evaluating the rationality of the parent node to meet the demand according to the difference between the lower bound value and the upper bound value of the parent node determined in the current loop, it can be determined to stop the loop; when the lower bound value and the upper bound of the parent node determined in the current loop The gap value of the value, when evaluating the rationality of the parent node not meeting the requirement, it can be determined to continue the loop.

In some implementations, 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 includes: determining the relative difference between the lower bound value and the upper bound value of the parent node determined in the current loop value, if the relative difference is less than or equal to the preset threshold, the loop will stop.

In these implementations, the relative difference between the lower bound value and the upper bound value of the parent node can be expressed as

Wherein UB may represent the upper bound value of the parent node, and LB may represent the lower bound value of the parent node. Wherein, the preset threshold can be set according to empirical values or experimental values. Since the logistics distribution network is globally optimal, the upper and lower bounds are the same (that is, GAP is 0), and when the relative difference between the parent node and the parent node is less than or equal to the preset threshold, the parent node and the global optimal solution can be considered The gap is small, and the current parent node has met the requirements of rationality. 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 scenarios with high transportation costs (such as logistics distribution scenarios between cities) and scenarios with small transportation costs (such as intra-city Logistics distribution scenario), the determination of the logistics distribution network can improve the scope of application of the determination method.

In addition, in some other implementation manners, in addition to judging whether to stop the loop according to the relative difference between the lower bound value and the upper bound value of the parent node, other loop stop conditions may also be preset. Other loop stop conditions may include, for example: a preset number of loops N, all subsequent connection relationships are set, and the like. In these achievable ways, when the current number reaches the preset number of cycles, the cycle can be stopped, which can avoid the situation that too many cycles lead to a long time-consuming situation when the preset threshold setting is unreasonable. It is also possible to stop the loop when all the connected relations of the latter items are set, so that the global optimal solution of the logistics distribution network can be obtained.

S130. If the loop is not stopped, generate a child node of the parent node by setting the subsequent connection relationship between the station and the sorting center on the basis of the parent node; update the candidate network in the current loop according to the lower bound value of the child node, and enter the next one cycle.

In this embodiment, when evaluating the rationality that the parent node does not meet the requirement according to the gap value corresponding to the lower bound value and the upper bound value of the current parent node, it can be considered that the current parent node is far from the global optimal solution. At this time, on the basis of the parent node, the connection relationship of one station in the subsequent connection relationship between the station to be determined and the sorting center can be set, that is, branching is carried out on the basis of the parent node, in order to expect to generate the global optimal solution of distance Recent new candidate networks.

In some implementation manners, by setting the subsequent connection relationship between the station and the sorting center on the basis of the parent node, generating the child node of the parent node includes: selecting the first station from the stations that do not set the connection relationship in the parent node; On the basis of the parent node, a network with a subsequent connection relationship between the first station and the sorting center is determined as a child node of the parent node.

Taking Figure 2 as an example, the parent node is the initial network during the first cycle, and the initial network usually does not satisfy the rationality. At this time, it is necessary to generate the child nodes of the initial network. Generating child nodes on the basis of the initial network, for example, may include: randomly selecting the first site from sites z ₁ -z ₄ that have no connectivity relationship, for example, selecting z ₁ ; on the basis of the parent node, setting z ₁ and the sorting center Connectivity relationship, for example, set z ₁ to be connected to f ₅ to get a child node, and set z ₁ to be connected to f ₆ to get another child node.

In these implementations, by gradually fixing the connectivity relationship of the latter term, not only can the amount of calculation be reduced, but also the estimation of the upper and lower bound values of the network can be made more accurate, which is conducive to quickly obtaining the optimal solution that is closer to the global optimal solution. Network for continuous circulation or output logistics distribution network.

In this embodiment, after the child nodes of the parent node are generated, it is also possible to determine whether the child nodes are optimized for the parent node according to the lower bound value of the generated child nodes, that is, delimit each child node.

In some implementations, updating the candidate network in the current cycle according to the lower bound value of the child node may include: when the lower bound value of the child node is smaller than the upper bound value of the parent node, using the child node as a new candidate network, and deleting the parent node .

Because usually the lower bound value of the child node is closer to the real 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 greater than the upper bound value of the parent node. At this time, the child node is compared to The parent node is farther away from the global optimal solution, and the child node can be pruned without updating the child node to the candidate network. When the lower bound value of the child node is smaller than the upper bound value of the parent node, the child node can be used as a new candidate network.

In these implementation manners, by pruning some child nodes with low rationality generated in the branching process, full branching can be avoided, thereby improving the network determination speed. At the same time, after getting the 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 kept as a candidate network to reduce storage space consumption .

In this embodiment, after the candidate network is updated, the loop of S120 may continue to be executed until the parent node in the evaluation loop satisfies the rationality of the requirement and stops. By using the candidate network with the smallest lower bound value as the parent node, branch child nodes are generated according to the feasible setting of the subsequent connectivity relationship in the parent node, and the lower bound value of the child node is used to delimit the candidate network to update the candidate network, avoiding the need for full-scale Branch and bound, which can speed up the solution speed of the network, and can quickly determine the large-scale network.

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

In this embodiment, when evaluating the rationality of the parent node satisfying the requirement according to the gap value corresponding to the lower bound value and the upper bound value of the current parent node, it can be considered that the current parent node is closer to the global optimal solution. At this point, the loop can be stopped, and the logistics distribution network can be determined according to the parent node determined when the loop is stopped. Among them, since in the network corresponding to the upper bound value of the parent node, both the preceding connected relationship and the following connected relationship are determined, the network corresponding to the upper bound value of the parent node can be determined as the logistics distribution network.

The embodiment of the present application provides a method for determining a logistics distribution network. By using the candidate network with the minimum lower bound value as the parent node, branch child nodes are generated according to the feasible setting of the subsequent connection relationship in the parent node, and based on the child node The lower bound value is delimited to update the candidate network, which avoids the need to perform a full amount of branch and delimitation, thereby speeding up the solution speed of the network, and can quickly determine large-scale networks.

In addition, the lower bound value of the transportation cost is determined based on the former connection relationship between the warehouse and the sorting center in the network, and the upper limit value of the transportation cost is determined based on the former connection relationship and the latter connection relationship between the station and the sorting center. The boundary value can obtain the evaluation standard of network rationality. Since the logistics distribution network is globally optimal, the upper and lower bounds determined based on the above-mentioned technical characteristics are the same, and the rationality of the parent node can be realized based on the gap between the upper and lower bounds of the parent node in the current cycle. to evaluate. Furthermore, by stopping the loop when the evaluation of the parent node is reasonable, and determining the final logistics distribution network, the network solution quality and solution speed can be balanced.

Embodiment two

This embodiment describes the manner of determining the lower limit value on the basis of the foregoing embodiments. By pre-constructing the connection relationship between a warehouse and each first sorting center, the transportation cost can be predicted according to the connection relationship constructed each time; according to the transportation cost predicted each time, the warehouse and the first sorting center can be obtained The optimal connection mode of the center; furthermore, the determination of the lower bound value can be realized according to the optimal connection mode of each warehouse.

Exemplarily, FIG. 4 is a schematic diagram of determining a network lower limit value in a method for determining a logistics distribution network provided in Embodiment 2 of the present application. Referring to the network shown in FIG. 4, in some implementations, the manner of determining the lower bound value may include:

First, each warehouse in the candidate network is traversed, and the network formed by the currently traversed warehouse and the networks except all warehouses in the candidate network is used as the first sub-network. Referring to Fig. 4, taking the currently traversed warehouse as warehouse k ₁ as an example, the first sub-network is composed of k ₁ and the network except all warehouses in Fig. 4, that is, the first sub-network includes k ₁ and the sorting center f ₁ -f ₆ , and station z ₁ -z ₄ .

Then, with the goal of minimizing the transportation cost of the first sub-network, determine the previous connectivity relationship between the currently traversed warehouse and at least one first sorting center among the plurality of sorting centers. Wherein, the multiple sorting centers can be divided into multiple layers, and the sorting center on the first layer geographically close to the warehouse can be called the first sorting center. Referring to Fig. 4, the sorting centers f ₁ and f ₂ can be called the first sorting center. When the currently traversed warehouse is k ₁ , the connection relationship between k ₁ and f ₁ and f ₂ can be set respectively, and the transportation cost of the first sub-network can be determined when it is connected with f ₁ and f ₂ . In addition, the connection relationship corresponding to when the transportation cost of the first sub-network is minimum can be determined as the previous connection relationship between k ₁ and the first sorting center.

Finally, according to the previous connected relationship of each warehouse, the lower bound value of the candidate network is determined. Wherein, after using the above method to determine the preceding connection relationship of each warehouse, the transportation costs corresponding to the preceding connection relations of each warehouse can be summed to obtain the lower bound value of the network.

Referring again to FIG. 4 , in some implementations, with the goal of minimizing the transportation cost of the first sub-network, determining the previous connectivity relationship between the currently traversed warehouse and at least one first sorting center among the plurality of sorting centers includes:

Firstly, a connected relationship is established between the currently traversed warehouse and each of the first sorting centers among the multiple sorting centers, and the sum of the minimum transportation costs from the currently connected first sorting center to the multiple sites is determined.

Taking the currently traversed warehouse as warehouse k ₁ , and the first sorting center currently connected to k ₁ as f ₁ as an example, determining the sum of transportation costs from f ₁ to z ₁ -z ₄ may include: traversing z ₁ -z ₄ , for the currently traversed station (take z ₁ as an example), respectively set the connection relationship between the station and the sorting center that can be connected (for example, set the connection relationship between z ₁ and f ₅ , f ₆ respectively); Estimate the transport cost from k ₁ to the current traversal site, and determine the minimum transport cost corresponding to the current site (for example, determine the transport costs C _f1,z5 of f ₁ to f ₅ to z ₁ , and determine f ₁ to f ₆ to The transportation cost C _f1,z6 of z ₁ , and take the minimum value); after the traversal, sum the minimum transportation costs corresponding to z ₁ -z ₄ to obtain a minimum transportation cost sum C _f1 .

Then, according to the sum of the minimum transportation costs corresponding to each first sorting center, determine the previous connection relationship between the currently traversed warehouse and the first target center in the at least one first sorting center.

Based on the same method as above, the sum C _f2 of the transportation costs from f ₂ to z ₁ -z ₄ is determined. Furthermore, the minimum value of the total transportation cost of the currently traversed warehouse can be determined; for example, the total transportation cost C _sum1 = C _k1,f1 + C _f1 when k ₁ and f ₁ are connected; the total transportation cost when k ₁ and f ₂ are connected Cost C _sum2 =C _k1,f2 +C _f2 . Then, the connection relationship corresponding to the minimum total transportation cost can be determined as the previous connection relationship between the current traversed warehouse and the first target center in the first sorting center; for example, when C _sum1 is the smallest, it can be determined that the current traversed The first target center for the warehouse k ₁ to establish the connection relationship of the preceding item is the sorting center f ₁ .

In these implementations, by estimating the total transportation cost based on the feasible configuration of the previous item/next item connection relationship, the connection relationship between the currently traversed warehouse and the first target center can be determined according to the minimum total transportation cost.

The embodiment of the present application describes the manner of determining the lower limit value on the basis of the foregoing embodiments. By pre-constructing the connection relationship between a warehouse and each first sorting center, the transportation cost can be predicted according to the connection relationship constructed each time; according to the transportation cost predicted each time, the warehouse and the first sorting center can be obtained The optimal connection mode of the center; furthermore, the determination of the lower bound value can be realized according to the optimal connection mode of each warehouse. In addition, the method of determining the logistics distribution network proposed in the embodiment of the present application and the above-mentioned embodiment belongs to the same idea, and the technical details not described in detail in this embodiment can be referred to the above-mentioned embodiment, and this embodiment has the same features as the above-mentioned embodiment Effect.

Embodiment Three

This embodiment describes the manner of determining the upper limit value on the basis of the foregoing embodiments. By pre-constructing the connection relationship between a station and each second sorting center on the basis of the connection relationship determined in the previous item, the transportation cost can be predicted according to the connection relationship constructed each time; according to the transportation cost predicted each time, The optimal connection mode between the station and the second sorting center can be obtained; furthermore, the determination of the upper limit value can be realized according to the optimal connection mode of each station.

Exemplarily, FIG. 5 is a schematic diagram of determining an upper limit value of a network in a method for determining a logistics distribution network provided in Embodiment 3 of the present application. Referring to the network shown in FIG. 5, in some implementations, the manner of determining the upper limit value may include:

Firstly, on the basis of the connectivity relationship in the previous item, traverse the sites without connectivity relationships in the candidate network, and use the network composed of the currently traversed sites, the sites with connectivity relationships, and the candidate networks except all the sites in the network as the second sub-network. network.

The preceding connectivity relationship can be determined through the methods provided in the above embodiments, and other methods aiming at minimizing the transportation cost can also be used to determine the preceding connectivity relationship of the network, for example, a machine learning model can be used to determine the preceding connectivity relationship . After determining the previous connection relationship of the network, the upper limit value can be determined on the basis of it.

Referring to Fig. 5, the connection relationship between warehouses k ₁ -k ₃ and the sorting center has been determined. In Fig. 5, taking the currently traversed station without a connected relationship as z ₁ as an example, since the station with connected connected relationship is empty, the second sub-network is composed of z ₁ , which is composed of the network except all stations in Fig. 5, That is, the second sub-network includes z ₁ , sorting centers f ₁ -f ₆ , and warehouses k ₁ -k ₃ .

Then, with the goal of minimizing the transportation cost of the second sub-network, determine the subsequent connection relationship between the currently traversed site and at least one second sorting center among the plurality of sorting centers.

Multiple sorting centers can be divided into multiple layers, and the sorting center on the layer close to the site geographically can be called the second sorting center. Referring to Fig. 5, the sorting centers f ₅ and f ₆ can be called the second sorting center. When the currently traversed site is z ₁ , the connection relationship between z ₁ and f ₅ and f ₆ can be set respectively, and the transportation cost of the second sub-network can be determined when connecting with f ₅ and f ₆ . In addition, the connection relationship corresponding to when the transportation cost of the second sub-network is minimum can be determined as the subsequent connection relationship between z ₁ and the second sorting center.

Finally, according to the subsequent connection relationship of each site, the upper bound value of the candidate network is determined. Wherein, after using the above method to determine the subsequent connection relationship of each site, the transportation costs corresponding to the subsequent connection relationship of each site can be summed to obtain the upper limit value of the network.

Referring again to FIG. 5 , in some implementations, with the goal of minimizing the transportation cost of the second sub-network, determining the subsequent connection relationship between the current traversal site and at least one second sorting center among the plurality of sorting centers includes:

First, establish a connection relationship between the current traversal site and each second sorting center among the multiple sorting centers, and determine the transportation from the multiple warehouses to the current traversal site corresponding to the second sorting center that currently establishes the connection relationship sum of costs.

Taking the currently traversed site without a connected relationship as z ₁ , and the second sorting center that currently establishes a connected relationship with z ₁ as f ₅ as an example, determine the location from warehouse k ₁ -k ₃ to z ₁ corresponding to f ₅ The sum of transportation costs can include: respectively determine the transportation costs of k ₁ -k ₃ to f ₅ to z ₁ , C _k1,f5,z1 , C _k2,f5,z1 and C _k3,f5,z1 , and carry out the three items The sum of transportation costs from warehouse k ₁ -k ₃ to z ₁ corresponding to f ₅ is obtained by summing C _f5,z1 .

Then, according to the sum of the transportation costs corresponding to each second sorting center, determine the subsequent connection relationship between the current traverse station and the second target center in at least one second sorting center.

Based on the same method as above, determine the transportation cost and C _f6,z1 corresponding to f ₆ from warehouse k ₁ -k ₃ to z ₁ . Furthermore, the subsequent connectivity relationship corresponding to the minimum value of C _{f5, z1} and C _{f6, z1} can be determined as the second target center that establishes the subsequent connectivity relationship with the currently traversed _z1 ; for example, when C _{f5, z1} is the most hour, it can be determined that the second target center that establishes a subsequent connection relationship with the currently traversed z ₁ is the sorting center f ₅ .

In these implementation manners, based on the sum of the transportation costs from multiple warehouses to the current traversal site, the subsequent connection relationship of the current traversal site can be determined. And based on the same method, the subsequent connection relationship of each site can be realized.

The embodiment of the present application describes the manner of determining the upper limit value on the basis of the foregoing embodiments. By pre-constructing the connection relationship between a station and each second sorting center on the basis of the connection relationship determined in the previous item, the transportation cost can be predicted according to the connection relationship constructed each time; according to the transportation cost predicted each time, The optimal connection mode between the station and the second sorting center can be obtained; furthermore, the determination of the upper limit value can be realized according to the optimal connection mode of each station. In addition, the method for determining the logistics distribution network proposed in the embodiment of the present application and the above-mentioned embodiment belongs to the same idea, and the technical details not described in detail in this embodiment can be referred to the above-mentioned embodiment, and this embodiment and the above-mentioned embodiment have the same Effect.

Embodiment Four

In this embodiment, on the basis of the foregoing embodiments, the technical features of priority queues are added. Based on the feature that the priority queue can be sorted according to the priority of the data attributes in it, the parent node can be quickly obtained in each cycle.

Exemplarily, FIG. 6 is a flowchart based on priority queues in a method for determining a logistics distribution network provided in Embodiment 4 of the present application. Referring to Figure 6, the method for determining the logistics distribution network may include:

S610. Using the initial network as a candidate network, determine a lower limit value and an upper limit value of the initial network; the connection relationship between multiple sorting centers in the initial network is preset.

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 determined based on the latter connectivity relationship between the station and the sorting center in the corresponding network on the basis of the previous connectivity relationship transportation cost.

S620. Add each candidate network to a priority queue; wherein, the priority is set in the priority queue according to the lower bound value of different candidate networks.

In this embodiment, the data (for example, data in matrix format) representing the connection relationship of logistics points in the candidate network can be added to the priority queue as a node. Among them, the queue attribute of the node may include but not limited to: the lower bound value of the network represented by the node, the parent node of the node (that is, the data corresponding to the connection relationship of the logistics point in the parent node network of the node representing the network), and the subsequent item of the node Connected state (that is, the setting of the connection relationship between nodes and subsequent items in the network). Wherein, the priority queue can set the priority for the node according to the lower bound value in the queue attribute, that is, set the priority for the candidate network corresponding to the node.

When determining the initial network, the lower bound value and the upper bound value of the initial network, the priority queue can be initialized accordingly. Initializing the priority queue may include: adding data representing the connection relationship of multiple logistics points in the initial network as a root node to the priority queue; and setting queue attributes for the root node.

S630. Determine the parent node in the candidate network in the current loop 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.

The highest priority can be set to the node with the smallest lower bound value, 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, whether to stop the loop can be determined according to the difference between the lower bound value and the upper bound value of the parent node.

S640. If the loop is not stopped, generate a child node of the parent node by setting the subsequent connection relationship between the station and the sorting center on the basis of the parent node; update the candidate network in the current loop according to the lower bound value of the child node, and enter the next one cycle.

According to the connection status attribute of the next item in the priority queue, the station without a connection relationship can be determined, and then the connection relationship between the first station and the sorting center can be set to generate a child node of the parent node. Wherein, after updating the candidate network, you can jump to 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; , pop the corresponding parent node in the priority queue to ensure that the node corresponding to the updated candidate network is always stored in the priority queue.

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

When the parent node in the current cycle is evaluated as satisfying the rationality, the parent node can be popped up, and can be determined as the logistics distribution network based on the parent node popped up when the cycle stops.

On the basis of the foregoing embodiments, the embodiment of the present application adds the technical features of the priority queue. Based on the feature that the priority queue can be sorted according to the priority of the data attributes in it, the parent node can be quickly obtained in each cycle. In addition, the method of determining the logistics distribution network proposed in the embodiment of the present application and the above-mentioned embodiment belongs to the same idea, and the technical details not described in detail in this embodiment can be referred to the above-mentioned embodiment, and this embodiment has the same features as the above-mentioned embodiment Effect.

Embodiment five

FIG. 7 is a schematic structural diagram of an apparatus for determining a logistics distribution network provided in Embodiment 5 of the present application. The device for determining the logistics distribution network provided in the embodiment of the present application can be applied to the situation of determining the logistics distribution network, for example, for a network determined for the connection relationship between multiple sorting centers, determine the preceding connection relationship between the warehouse and the sorting center, and Determine the status of the connection relationship between the station and the sorting center.

As shown in Figure 7, the device for determining the logistics distribution network in the embodiment of the present application includes:

The initialization module 710 is set to use the initial network as a candidate network to determine the lower bound value and upper bound value of the initial network; the connection relationship between multiple sorting centers in the initial network is preset; the evaluation module 720 is set to The candidate network with the minimum lower bound value is determined as the parent node, and the difference between the lower bound value and the upper bound value of the parent node determined in the current cycle determines whether to stop the cycle; the branch and bound module 730 is set to if the cycle is not stopped , then by setting the connection relationship between the station and the sorting center on the basis of the parent node, the child node of the parent node is generated; the candidate network in the current cycle is updated according to the lower bound value of the child node, and enters the next cycle; the network determination module 740, 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 based on the preceding connectivity relationship between the warehouse and the sorting center in the corresponding network The determined transportation cost; the upper limit value is the transportation cost determined based on the connection relationship between the previous item and the subsequent connection relationship between the station and the sorting center in the corresponding network.

In some implementations, the branch and bound module 730 includes:

The branch unit is set to select the first station from the stations that have no connection relationship in the parent node; the network that has the connection relationship between the first station and the sorting center on the basis of the parent node is determined as the child of the parent node. node.

In some implementations, the branch and bound module 730 includes:

Delimiting unit, when the lower bound value of the child node is smaller 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.

In some implementations, the initialization module 710 and the branch and bound module 730 may include:

The lower bound value determination unit is set to determine the lower bound value according to the following determination methods:

Traverse each warehouse in the candidate network, and use the network composed of the currently traversed warehouse and the network except all warehouses in the candidate network as the first sub-network; aiming at the minimum transportation cost of the first sub-network, determine the current traversed warehouse and The previous connection relationship of at least one first sorting center among the plurality of sorting centers; according to the previous connection relationship of each warehouse, the lower limit value of the candidate network is determined.

In some embodiments, the lower limit value determination unit can be set to:

Establish a connected relationship between the current traversing warehouse and each of the first sorting centers among the multiple sorting centers, and determine the sum of the minimum transportation costs from the first sorting center that currently establishes a connected relationship to multiple sites; The sum of the minimum transportation costs corresponding to the first sorting center determines the preceding connectivity relationship between the currently traversed warehouse and the first target center in at least one first sorting center.

In some implementations, the initialization module 710 and the evaluation module 720 may also include:

The upper limit value determination unit is set to determine the upper limit value according to the following determination methods:

On the basis of the connection relationship in the preceding item, traverse the sites in the candidate network that do not have a connection relationship, and use the network formed by the currently traversed site, the site that has a connection relationship, and the network except all the sites in the candidate network as the second sub-network; Aiming at the minimum transportation cost of the second sub-network, determine the subsequent connection relationship between the current traversal site and at least one second sorting center among the plurality of sorting centers; upper bound value.

In some embodiments, the upper limit value determination unit can be set to:

Establish a connection relationship between the current traversal site and each second sorting center in multiple sorting centers, and determine the transportation cost from multiple warehouses to the current traversal site corresponding to the second sorting center with the current connection relationship and; according to the sum of the transportation costs corresponding to each second sorting center, determine the subsequent connection relationship between the current traverse station and the second target center in at least one second sorting center.

In some embodiments, the means for determining the logistics distribution network may also include:

The queue addition module is set to add each candidate network to the priority queue; wherein, the priority is set in the priority queue according to the lower bound value of different candidate networks; correspondingly, the evaluation module can be set to: determine the current cycle according to the priority The parent node in the candidate network in .

In some implementations, the assessment module can be set to:

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.

The device for determining the logistics distribution network provided in the embodiment of the present application belongs to the same concept as the method for determining the logistics distribution network provided in the above-mentioned embodiment. For technical details not described in detail in the embodiment of the present application, please refer to the above-mentioned embodiment, and this application The embodiment has the same effect as the above-described embodiment.

Embodiment six

FIG. 8 is a schematic diagram of a hardware structure of a terminal device provided in Embodiment 6 of the present application. The terminal equipment in the embodiment of the present application may include but not limited to mobile phones, notebook computers, digital broadcast receivers, personal digital assistants (Personal Digital Assistant, PDA), tablet computers (Portable Android Device, PAD), portable multimedia players (Portable Media Player, PMP), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital televisions (Television, TV), desktop computers, etc. The terminal device 800 shown in FIG. 8 is only an example, and should not limit the functions and scope of use of this embodiment of the present application.

As shown in FIG. 8, a terminal device 800 may include a processing device (such as a central processing unit, a graphics processing unit, etc.) 801, which may be stored in a read-only memory (Read-Only Memory, ROM) 802 according to the Various appropriate actions and processes are performed by a program loaded into a random access memory (Random Access Memory, RAM) 803 by 808 . In the RAM 803, various programs and data necessary 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 through a bus 804. An input/output (Input/Output, I/O) interface 805 is also connected to the bus 804 .

Generally, the following devices can be connected to the I/O interface 805: an input device 806 including, for example, a touch screen, a touchpad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; including, for example, a liquid crystal display (Liquid Crystal Display, LCD) , an output device 807 such as a speaker, a vibrator, etc.; a storage device 808 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 809. The communication means 809 may allow the terminal device 800 to perform wireless or wired communication with other devices to exchange data. Although FIG. 8 shows a terminal device 800 having various means, it is not required to implement or possess all of the means shown. More or fewer means may alternatively be implemented or provided.

According to an embodiment of the present application, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, the embodiments of the present application include a computer program product, which includes a computer program carried on a computer-readable medium, where the computer program includes program codes for executing the methods shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via communication means 809, or from storage means 808, or from ROM 802. When the computer program is executed by the processing device 801, the above-mentioned functions defined in the method for determining the logistics delivery network provided in the embodiment of the present application are executed.

The terminal provided in the embodiment of the present application and the method for determining the logistics distribution network provided in the above embodiment belong to the same concept. For technical details not described in detail in the embodiment of the present application, please refer to the above embodiment, and the embodiment of the present application is consistent with the above embodiment has the same effect.

Embodiment seven

An embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, the method for determining a logistics distribution network provided in the foregoing embodiments is implemented.

The above-mentioned computer-readable storage medium in the embodiment of the present application may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the above two. A 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 thereof. Examples of computer readable storage media may include, but are not limited to: electrical connections with one or more conductors, portable computer disks, hard disks, RAM, Read-Only Memory, ROM, Erasable Programmable Read-Only Memory (Erasable Programmable Read-Only Memory) -Only Memory, Erasable Programmable Read-Only Memory, EPROM) or flash memory (FLASH), optical fiber, portable compact disk read-only memory (Compact Disc Read-Only Memory, CD-ROM), optical storage device, magnetic storage device, or the above any suitable combination. In the embodiments of the present application, a computer-readable storage medium may be any tangible medium containing or storing a program, and the program may be used by or in combination with an instruction execution system, device or device. However, in the embodiment of the present application, the computer-readable signal medium may include a data signal propagated in the baseband or as a part of the carrier wave, and the computer-readable program code is carried therein. Such propagated data signals may take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, which can transmit, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device . The program code contained on the computer readable medium can be transmitted by any appropriate medium, including but not limited to: electric wire, optical cable, radio frequency (Radio Frequency, RF), etc., or any suitable combination of the above.

In some implementations, the client and the server can communicate using any currently known or future-developed network protocols such as Hyper Text Transfer Protocol (Hyper Text Transfer Protocol, HTTP), and can communicate with any form or medium of digital Data communication (eg, communication network) interconnections. Examples of communication networks include local area networks (Local Area Network, LAN), wide area networks (Wide Area Network, WAN), internetworks (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently existing networks that are known or developed in the future.

The above-mentioned computer-readable storage medium may be contained in the above-mentioned terminal device, or may exist independently without being assembled into the terminal device.

The terminal device stores one or more programs, and when the one or more programs are executed by the terminal device, the terminal device:

The initial network is used as the candidate network, and the lower and upper bound values of the initial network are determined; the connection relationship between multiple sorting centers in the initial network is preset; in the current cycle, the candidate network with the smallest lower bound value is determined as the parent The node determines 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; if the loop does not stop, then by setting the subsequent connection relationship between the station and the sorting center on the basis of the parent node, Generate child nodes of the parent node; update the candidate network in the current cycle according to the lower bound value of the child node, and enter the next cycle; if the cycle is stopped, the network corresponding to the upper limit value of the parent node determined when the cycle is stopped is determined as Logistics distribution network; wherein, the lower bound value is the transportation cost determined based on the previous connection relationship between the warehouse and the sorting center in the corresponding network; the upper bound value is based on the previous connection relationship, based on the corresponding network. The transportation cost determined by the connectivity relationship of the latter item.

Computer program code for performing the operations of the present application may be written in one or more programming languages or combinations thereof, including object-oriented programming languages—such as Java, Smalltalk, C++, and conventional Procedural Programming Language - such as "C" or a similar programming language. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. Where a remote computer is involved, the remote computer can be connected to the user computer through any kind of network, including a LAN or WAN, or it can be connected to an external computer (eg via the Internet using an Internet Service Provider).

The flowchart and block diagrams in the figures illustrate the architecture, functionality and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in a flowchart or block diagram may represent a module, program segment, or portion of code that contains one or more logical functions for implementing specified executable instructions. It should also be noted that, in some alternative implementations, the functions noted in the blocks may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or they may sometimes be executed in the reverse order, depending upon the functionality involved. It should also be noted that each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented by a dedicated hardware-based system that performs the specified functions or operations , or may be implemented by a combination of dedicated hardware and computer instructions.

The units involved in the embodiments described in the present application may be implemented by means of software or by means of hardware. Wherein, the name of the unit does not constitute a limitation of the unit itself in one case.

The functions described herein above may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary forms of hardware logic components that may be used include: Field Programmable Gate Array (Field Programmable Gate Array, FPGA), Application Specific Integrated Circuit (ASIC), Application Specific Standard Products (Application Specific Standard Parts, ASSP), System on Chip (System on Chip, SOC), Complex Programmable Logic Device (Complex Programming Logic Device, CPLD) and so on.

Claims (12)

1. A method for determining a logistics distribution network, comprising:

   Using the initial network as a candidate network, determine the lower bound value and upper bound value of the initial network; wherein, the connectivity relationship between multiple sorting centers in the initial network is preset;

   Determine the candidate network with the minimum lower bound value as the parent node in the current loop, 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;

   In response to not stopping the cycle, by setting the subsequent connected relationship between the station and the sorting center on the basis of the parent node, the child node of the parent node is generated; the candidate network in the current cycle is updated according to the lower bound value of the child node , and enter the next cycle;

   In response to stopping the loop, determining the network corresponding to the upper bound value of the parent node determined in the case of stopping the loop as the logistics distribution network;

   Wherein, the lower bound value is the transportation cost determined based on the previous connection relationship between the warehouse and the sorting center in the corresponding network; The transport cost is determined by the subsequent connectivity relationship of the center.
2. The method according to claim 1, wherein said generating a child node of said parent node by setting a subsequent connected relationship between a station and a sorting center on the basis of said parent node includes:

   Selecting the first site from the sites with no connection relationship set in the parent node;

   Determining the network with the subsequent connected relationship between the first station and the sorting center based on the parent node as a child node of the parent node.
3. The method according to claim 1, wherein said updating the candidate network in the current cycle according to the lower bound value of the child node comprises:

   When the lower bound value of the child node is smaller 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, wherein the method of determining the lower limit value comprises:

   Traverse each warehouse in the candidate network, and use the network formed by the currently traversed warehouse and the network except all warehouses in the candidate network as the first sub-network;

   With the minimum transportation cost of the first sub-network as the goal, determine the previous connection relationship between the currently traversed warehouse and at least one first sorting center among the plurality of sorting centers;

   Determine the lower bound value of the candidate network according to the previous connected relationship of each warehouse.
5. The method according to claim 4, wherein, with the goal of minimizing the transportation cost of the first sub-network, determining the distance between the currently traversed warehouse and at least one first sorting center among the plurality of sorting centers Item connectivity, including:

   Establishing a connected relationship between the current traversing warehouse and each first sorting center in the plurality of sorting centers, and determining the sum of the minimum transportation costs from the first sorting center currently establishing a connected relationship to multiple sites;

   According to the sum of the minimum transportation costs corresponding to each first sorting center, determine the previous connection relationship between the currently traversed warehouse and the first target center in the at least one first sorting center.
6. The method according to claim 1, wherein the method of determining the upper limit value comprises:

   On the basis of the connectivity relationship in the preceding item, traverse the sites in the candidate network that do not have a connectivity relationship, and combine the currently traversed sites and the sites that have a connectivity relationship with the network formed by the networks except all the sites in the candidate network, as a second sub-network;

   With the minimum transportation cost of the second sub-network as the goal, determine the subsequent connection relationship between the current traversed site and at least one second sorting center among the plurality of sorting centers;

   The upper limit value of the candidate network is determined according to the subsequent connectivity relationship of each site.
7. The method according to claim 6, wherein, with the goal of minimizing the transportation cost of the second sub-network, determining the distance between the current traversal site and at least one second sorting center in the plurality of sorting centers Item connectivity, including:

   Establish a connection relationship between the current traversal site and each second sorting center in the plurality of sorting centers, and determine the transportation from the multiple warehouses to the current traversal site corresponding to the second sorting center with the current connection relationship established sum of costs;

   According to the sum of the transportation costs corresponding to each second sorting center, determine the subsequent connection relationship between the current traversed site and the second target center in the at least one second sorting center.
8. The method according to claim 1, further comprising:

   Adding each candidate network to a priority queue; wherein, the priority is set according to the lower bound value of different candidate networks in the priority queue;

   The determining the candidate network with the minimum lower bound value as the parent node in the current cycle includes:

   Determine the parent node in the candidate network in the current cycle according to the priority.
9. The method according to claim 1, wherein, 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 includes:

   Determine the relative difference between the lower limit value and the upper limit value of the parent node determined in the current cycle, and stop the cycle when the relative difference value is less than or equal to a preset threshold.
10. A device for determining a logistics distribution network, comprising:

    The initialization module is configured to use the initial network as a candidate network, and determine the lower limit value and the upper limit value of the initial network; wherein, the connection relationship between multiple sorting centers in the initial network is preset;

    The evaluation module is configured to determine the candidate network with the smallest lower bound value as the parent node in the current cycle, and determine whether to stop the cycle according to the difference between the lower bound value and the upper bound value of the parent node determined in the current cycle;

    A branch-and-bound module, configured to respond to the non-stop loop, by setting the subsequent connection relationship between the station and the sorting center on the basis of the parent node, to generate a child node of the parent node; according to the lower bound value of the child node Update the candidate network in the current cycle and enter the next cycle;

    The network determination module is configured to determine the network corresponding to the upper bound value of the parent node determined in the case of stopping the loop as the logistics distribution network in response to stopping the loop;

    Wherein, the lower bound value is the transportation cost determined based on the previous connection relationship between the warehouse and the sorting center in the corresponding network; The transport cost is determined by the subsequent connectivity relationship of the center.
11. A terminal device comprising:

    at least one processor;

    a memory configured to store at least one program;

    When the at least one program is executed by the at least one processor, the at least one processor is made to implement the method for determining the logistics distribution network according to any one of claims 1-9.
12. A computer-readable storage medium storing a computer program, the program implementing the method for determining a logistics distribution network according to any one of claims 1-9 when the program is executed by a processor.

Images