CN114154930A

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

Info

Publication number: CN114154930A
Application number: CN202111444293.9A
Authority: CN
Inventors: 吴盛楠; 庄晓天; 牛志强; 佟路
Original assignee: Beijing Jingdong Zhenshi Information Technology Co Ltd
Current assignee: Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date: 2021-11-30
Filing date: 2021-11-30
Publication date: 2022-03-08
Also published as: WO2023098698A1

Abstract

The embodiment of the invention discloses a method, a device, terminal equipment and a storage medium for determining a logistics distribution network, wherein the method comprises the following steps: taking the initial network as a candidate network, and determining a lower bound value and an upper bound value of the initial network; circularly taking the network with the minimum lower bound value in the candidate networks as a father node, and determining whether to stop circulation or not according to the difference value between the lower bound value and the upper bound value of the father node; if the circulation is not stopped, generating child nodes by setting a back item communication relation between the station and the sorting center on the basis of the father node; updating the row candidate network according to the lower bound value of the child node; if the circulation is stopped, taking a network corresponding to the upper bound value of the father node when the circulation is stopped as a logistics distribution network; the lower bound value is determined based on the previous item communication relation between the warehouse and the sorting center in the corresponding network; and determining the upper bound value based on the last item communication relation between the station in the corresponding network and the sorting center on the basis of the last item communication relation. And the method can quickly solve the network with larger scale and evaluate the rationality of the current solution.

Description

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

Technical Field

The embodiment of the invention relates to the field of logistics transportation, in particular to a method and a device for determining a logistics distribution network, terminal equipment and a storage medium.

Background

In the field of logistics transportation, a network consisting of warehouses, sorting centers and stations may be referred to as a logistics distribution network. The logistics distribution network can be determined by establishing the communication relation among the warehouse, the sorting center and the stations. In the prior art, two solving algorithms, namely an accurate algorithm and a heuristic algorithm, can be mainly applied to the determination of the logistics distribution network.

In the process of implementing the invention, the inventor finds that at least the following technical problems exist in the prior art:

when a network with a large scale is determined by using an accurate algorithm, the network is difficult to solve within an acceptable time due to large calculation amount; when a heuristic algorithm is used for determining the network, the rationality of the current solution cannot be evaluated due to certain randomness of the solving process.

Disclosure of Invention

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

In a first aspect, an embodiment of the present invention provides a method for determining a logistics distribution network, including:

taking an initial network as a candidate network, and determining a lower bound value and an upper bound value of the initial network; the communication relation among the sorting centers in the initial network is preset;

determining a network with the minimum lower bound value in the current candidate networks as a father node in a circulating manner, and determining whether to stop circulating or not according to the difference value between the lower bound value and the upper bound value of the father node determined in the current circulating manner;

if the circulation is not stopped, generating child nodes of the father nodes by setting a back item communication relation between the station and the sorting center on the basis of the father nodes; updating the candidate network according to the lower bound value of the child node;

if the circulation is stopped, determining a network corresponding to the upper bound value of the father node determined when the circulation is stopped as a logistics distribution network;

the lower bound value is the transportation cost determined based on the previous item communication relation between the warehouse and the sorting center in the corresponding network; and the upper bound value is the transportation cost determined based on the back item communication relation between the station in the corresponding network and the sorting center on the basis of the front item communication relation.

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

the initialization module is used for taking an initial network as a candidate network and determining a lower bound value and an upper bound value of the initial network; the communication relation among the sorting centers in the initial network is preset;

the evaluation module is used for determining a network with the minimum lower bound value in the current candidate networks as a father node in a circulating manner, and determining whether to stop circulating or not according to the difference value between the lower bound value and the upper bound value of the father node determined in the current circulating manner;

the branch and bound module is used for generating child nodes of the father nodes by setting a post item communication relation between the station points and the sorting center on the basis of the father nodes if the circulation is not stopped; updating the candidate network according to the lower bound value of the child node;

the network determining module is used for determining a network corresponding to the upper bound value of the father node determined when the circulation is stopped as the logistics distribution network if the circulation is stopped;

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

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 according to any embodiment of the present invention.

In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements a method for determining a logistics distribution network according to any embodiment of the present invention.

The method, the device, the terminal equipment and the storage medium for determining the logistics distribution network provided by the embodiment of the invention take an initial network as a candidate network and determine a lower bound value and an upper bound value of the initial network; the communication relation among the sorting centers in the initial network is preset; determining a network with the minimum lower bound value in the current candidate networks as a father node in a circulating manner, and determining whether to stop circulating or not according to the difference value between the lower bound value and the upper bound value of the father node determined in the current circulating manner; if the circulation is not stopped, generating child nodes of the father nodes by setting a back item communication relation between the station and the sorting center on the basis of the father nodes; updating the candidate network according to the lower bound value of the child node; if the circulation is stopped, determining a network corresponding to the upper bound value of the father node determined when the circulation is stopped as a logistics distribution network; the lower bound value is the transportation cost determined based on the previous item communication relation between the warehouse and the sorting center in the corresponding network; the upper bound value is the transportation cost determined based on the last item communication relation between the station in the corresponding network and the sorting center on the basis of the last item communication relation.

The candidate network with the minimum lower bound value is used as a father node, branch child nodes are generated according to the feasible setting of the consequent connectivity in the father node, and the lower bound value of the child nodes is used for delimitation so as to update the candidate network, so that the full branch delimitation is avoided, the solving speed of the network can be accelerated, and the rapid determination can be carried out on the network with a large scale.

In addition, the lower bound value of the transportation cost is determined based on the front item communication relation between the warehouse and the sorting center in the network, and the upper bound value of the transportation cost is determined based on the rear item communication relation between the station and the sorting center on the basis of the front item communication relation, so that the evaluation standard of the network rationality can be obtained. When the logistics distribution network is globally optimal, the upper bound value and the lower bound value determined based on the technical characteristics are the same, and the rationality of the father node can be evaluated according to the difference value between the upper bound value and the lower bound value of the father node in the current cycle. Furthermore, by stopping the cycle when the parent node evaluates to be reasonable and determining the final logistics distribution network, the network solution quality and the solution speed can be equalized.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, a brief description will be given below of the drawings required for the embodiments or the technical solutions in the prior art, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.

Fig. 1 is a flowchart illustrating a method for determining a logistics distribution network according to an embodiment of the present invention;

fig. 2 is a schematic diagram illustrating an initial network in a method for determining a logistics distribution network according to an embodiment of the present invention;

fig. 3 is a schematic diagram illustrating a step-by-step determination of a lower bound value and an upper bound value in a determination method for a logistics distribution network according to an embodiment of the present invention;

fig. 4 is a schematic diagram illustrating a determination of a network lower bound value in a method for determining a logistics distribution network according to a second embodiment of the present invention;

fig. 5 is a schematic diagram illustrating a determination of a network upper bound value in a method for determining a logistics distribution network according to a third embodiment of the present invention;

fig. 6 is a flow chart illustrating a priority queue based method for determining a logistics distribution network according to a fourth embodiment of the present invention;

fig. 7 is a schematic structural diagram illustrating a determining apparatus of a logistics distribution network according to a fifth embodiment of the present invention;

fig. 8 shows a schematic diagram of a hardware structure of a terminal device according to a sixth embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention clearer, the technical solutions of the present invention will be clearly and completely described through embodiments with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention. In the following embodiments, optional features and examples are provided in each embodiment, and various features described in the embodiments may be combined to form a plurality of alternatives, and each numbered embodiment should not be regarded as only one technical solution.

Example one

Fig. 1 is a flowchart illustrating a method for determining a logistics distribution network according to an embodiment of the present invention. The method for determining the logistics distribution network provided by the embodiment of the invention can be applied to the situation of determining the logistics distribution network, such as the situation of determining the former item communication relation between a warehouse and a sorting center and the latter item communication relation between a station and the sorting center for the network determined according to the communication relation between the sorting centers. The method may be performed by a determining means of the logistics distribution network, which means is implemented in software and/or hardware, preferably in a terminal device, such as a computer or the like.

As shown in fig. 1, the method for determining a logistics distribution network provided in an embodiment of the present invention includes the following steps:

s110, taking the initial network as a candidate network, and determining a lower bound value and an upper bound value of the initial network; the connection relationship between the sorting centers in the initial network is preset.

In the embodiment of the present invention, the initial network may be considered as a network in which the connectivity between the sorting centers is preset, the former connectivity between the warehouse and the sorting center is waiting to be set, and the latter connectivity between the station and the sorting center is waiting to be set. The logistics distribution network can be determined by determining the front item communication relationship between the warehouse and the sorting center in the initial network and the back item communication relationship between the station and the sorting center. The logistics distribution network may be a logistics distribution network applied to an area and an urban area, or a trunk logistics distribution network applied to multiple areas and multiple urban areas.

Fig. 2 is a schematic diagram illustrating an initial network in a method for determining a logistics distribution network according to an embodiment of the present invention. Referring to fig. 2, a warehouse k may be included in the initial network₁Warehouse k₃Sorting centre f₁-a sorting center f₆Station z₁Station z₄. The solid line connecting line can represent that the communication relation of the two ends of the connecting line is determined, and the communication relation does not need to be set; the dotted line can represent that the communication relation at the two ends of the two lines is not determined and the communication relation needs to be set. For example, f in FIG. 2₁-f₆The internal communication relationship is determined, and k₁-k₃Respectively with sorting centre, z₁-z₄The respective communication with the sorting centers is uncertain.

The connectivity relationship between the antecedent and the consequent in the logistics distribution network can be determined on the basis of the initial network by aiming at the minimum transportation cost of the overall network. The transportation cost between every two logistics points (logistics points including warehouse, sorting center and station) in the network can be considered to be positively correlated with the amount of goods transported and the transportation distance between the logistics points. Wherein the transport distance between the stream points can be determined according to the geographical position between the two points. The amount of the transported goods can be obtained by predicting the amount of the goods between two logistics points according to the prediction model; the prediction model can be generated by learning and training according to the characteristics (such as the position between two logistics points, traffic characteristics, physical point storage characteristics and the like) of the two logistics points in the historical sample logistics network and the cargo quantity of the logistics points.

In addition, in the transportation cost estimation process, the determination can be carried out according to the feasible configuration of the front item/back item communication relation. 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 on the cost of transportation can be considered to be the largest estimate of the cost of transportation in general. And the lower bound value can be transportation cost determined based on the previous item communication relation between the warehouse and the sorting center in the corresponding network; the upper bound value can be the transportation cost determined based on the back item communication relation between the station in the corresponding network and the sorting center on the basis of the front item communication relation.

Fig. 3 is a schematic diagram illustrating a step-by-step determination of a lower bound value and an upper bound value in a determination method for a logistics distribution network according to an embodiment of the present invention. For any network (such as an initial network, and a network of a parent node and a child node disclosed later), a lower bound value and an upper bound value of the total transportation cost can be respectively predicted by two-stage estimation on the basis of the current network if the configuration of each connectivity relation is completed. Referring to fig. 3, the first stage estimation may estimate a lower bound value of the network, and the second stage estimation may estimate the lower bound value of the network.

In the first stage estimation: firstly, the minimum cost generated by feasible setting of the previous item communication relation of a certain warehouse can be estimated; then, determining the previous item connectivity of the site according to the estimation result; and finally, estimating a lower bound value according to the previous item connectivity of each site.

It can be understood that when the minimum cost is generated by setting the front item connectivity relationship of each warehouse, the corresponding back item connectivity relationship may have differences. For example, referring to fig. 2, the following may be the case when estimating in the first stage: warehouse k₁When the minimum cost is generated by setting the connection relation of the previous items, the station z₁Needs to be connected with a sorting center f₅Communicating; and warehouse k₂When the minimum cost is generated by setting the connection relation of the previous items, the station z₁Needs to be connected with a sorting center f₆And (4) communicating. Thus, the lower bound may be understood as an idealized minimum transportation cost, which is generally less than the true transportation cost.

In the second stage estimation: on the basis of determining the front item connectivity of the site, firstly, the minimum cost generated by feasible setting of the back item connectivity of the site can be estimated; the upper bound value can then be estimated based on the minimum cost for each site. It is understood that the upper bound is the estimated transportation cost of the network based on the idealized lower bound.

The transportation cost is divided into two stages for estimation, a lower bound value and an upper bound value are obtained, and the evaluation standard of the network rationality can be obtained. When the logistics distribution network is globally optimal, the upper bound value and the lower bound value determined based on the technical characteristics are the same, and the rationality of the network can be evaluated by determining the upper bound value and the lower bound value of the network, so that a foundation is laid.

And S120, determining the network with the minimum lower bound value in the current candidate network as a father node in a circulating mode, and determining whether to stop circulating according to the difference value between the lower bound value and the upper bound value of the father node determined in the current circulating mode.

In this embodiment, the current candidate network in the initial loop includes the initial network, and as the parent node is branched in the subsequent loop, more candidate networks can be updated. Since the logistics distribution network is determined with the aim of minimizing the transportation cost, the network with the minimum lower bound value can be used as a parent node in each circulation process, so as to generate the logistics distribution network according to the parent node, or continuously update the candidate network on the basis of the parent node.

When the rationality that the parent node meets the requirement is evaluated according to the difference value between the lower bound value and the upper bound value of the parent node determined in the current cycle, the cycle can be determined to be stopped; when the rationality that the parent node does not meet the requirement is evaluated according to the difference value between the lower bound value and the upper bound value of the parent node determined in the current cycle, the cycle can be determined to continue.

In some optional embodiments, determining whether to stop the loop according to the determined gap value between the lower bound value and the upper bound value of the parent node in the current loop includes: and determining a relative difference value between the lower bound value and the upper bound value of the father node determined in the current cycle, and stopping the cycle if the relative difference value is less than or equal to a preset threshold value.

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

Where UB may represent the upper level of a parent nodeThe bound value, LB, may represent the lower bound value of the parent node. The preset threshold may be set according to an empirical value or an experimental value. When the logistics distribution network is globally optimal, the upper bound value is the same as the lower bound value (namely GAP is 0), and when the relative difference value corresponding to the parent node is smaller than or equal to the preset threshold value, the difference distance between the parent node and the globally optimal solution is considered to be small, and the current parent node meets the requirement of rationality. In addition, the rationality of the father node is judged according to the relative difference, so that the determining method is favorably applicable to determining the logistics distribution network under the scene with high transportation cost (such as a logistics distribution scene between cities) and the scene with low transportation cost (such as a logistics distribution scene in the cities), and the application range of the determining method can be improved.

In addition, in some other implementation manners, in addition to determining whether to stop the cycle according to the relative difference value corresponding to the parent node, other cycle stop conditions may be preset. Other cycle stop conditions may include, for example: and (5) setting the preset cycle number N, finishing setting all the connection relationships of the back items, and the like. In these realizable manners, the loop may be stopped when the current number of times reaches the preset loop number, so as to avoid the situation that the time consumption is long due to excessive loop when the preset threshold is set unreasonably. And when the consequent communication relations are completely set, stopping circulation, thereby obtaining the global optimal solution of the logistics distribution network.

S130, if the circulation is not stopped, generating child nodes of the father nodes by setting a back item communication relation between the station and the sorting center on the basis of the father nodes; and updating the candidate network according to the lower bound value of the child node.

In this embodiment, when the rationality that the parent node does not satisfy the requirement is evaluated according to the gap value corresponding to the current parent node, it may be considered that the current parent node is farther from the global optimal solution. At this time, on the basis of the parent node, the communication relationship between the station to be determined and a certain station in the next communication relationship of the sorting center may be set, that is, branching is performed on the basis of the parent node, so as to expect to generate a new candidate network closer to the global optimal solution.

In some optional embodiments, generating a child node of a parent node by setting a post connectivity relationship between a station and a sorting center on the basis of the parent node includes: selecting a first site from sites which are not set with a connection relation in a father node; and determining a network provided with a back item communication relation between the first station and the sorting center on the basis of the father node as a child node of the father node.

Taking fig. 2 as an example, in the first cycle process, the parent node is the initial network, and the initial network usually does not satisfy the rationality, and at this time, the child node of the initial network needs to be generated. Generating child nodes on an initial network basis may include, for example: from site z with no set connectivity₁-z₄In which the first site is randomly selected, e.g. z₁(ii) a On the basis of the father node, z is set₁Communicating with sorting centres, e.g. setting z₁And f₅Communicate to get a child node, and set z₁And f₆And communicating to obtain another child node.

In these optional embodiments, by gradually fixing the consequent connectivity, not only the calculation amount can be reduced, but also the estimation of the upper bound value and the lower bound value of the network can be more accurate, thereby facilitating to quickly obtain the network closer to the global optimal solution to continue the circulation or output the logistics distribution network.

In this embodiment, after the child node of the parent node is generated, it may be further determined whether the child node is optimized for the parent node according to the generated lower bound value of the child node, that is, each child node is bounded.

In some optional embodiments, the updating the candidate network according to the lower bound value of the child node may include: and when the lower bound value of the child node is smaller than the upper bound value of the father node, taking the child node as a new candidate network, and deleting the father node.

Because the lower bound value of the child node is 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 of the child node is too large, for example, greater than or equal to the upper bound of the parent node, the upper bound of the child node is usually greater than the upper bound of the parent node, and at this time, the child node is further away from the global optimal solution than the parent node, and the child node may not be updated to the candidate network, that is, pruning of the child node is achieved. Conversely, 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 alternative embodiments, by pruning the part of sub-nodes with low rationality generated in the branching process, the whole branching process can be avoided, and thus the network determination speed can be increased. Meanwhile, after the child nodes closer to the global optimal solution are obtained on the basis of the father node, the father node with poor satisfaction can be deleted, so that only the current better network can be reserved as a candidate network, and the storage space consumption is reduced.

In this embodiment, after updating the candidate network, the loop of step S120 may be continued until the parent node in the loop is evaluated to meet the requirement rationality. The candidate network with the minimum lower bound value is used as a father node, branch child nodes are generated according to the feasible setting of the consequent connectivity in the father node, and the lower bound value of the child nodes is used for delimitation so as to update the candidate network, so that the full branch delimitation is avoided, the solving speed of the network can be accelerated, and the rapid determination can be carried out on the network with a large scale.

And S140, if the circulation is stopped, determining the network corresponding to the upper limit value of the parent node determined when the circulation is stopped as the logistics distribution network.

In this embodiment, when the rationality that the parent node meets the requirement is evaluated according to the difference value corresponding to the current parent node, it may be considered that the current parent node is closer to the global optimal solution. At this time, the circulation may be stopped, and the logistics distribution network may be determined according to the determined parent node when the circulation is stopped. In the network corresponding to the upper bound value of the parent node, the connection relationship of the antecedent and the connection relationship of the consequent are determined, so that the network corresponding to the upper bound value of the parent node can be determined as the logistics distribution network.

According to the method for determining the logistics distribution network, the candidate network with the minimum lower bound value is used as the father node, the branch child nodes are generated according to the feasible setting of the consequent connectivity in the father node, and the delimitation is performed based on the lower bound values of the child nodes to update the candidate network, so that the full branch delimitation is avoided, the solving speed of the network can be increased, and the quick determination can be performed on the network with a large scale.

Example two

In this embodiment, the determination step of the lower bound value is described in detail based on the above embodiments. The transportation cost can be predicted according to the communication relation constructed each time by respectively pre-constructing the communication relation between one warehouse and each first sorting center; according to the predicted transportation cost each time, the optimal communication mode of the warehouse and the first sorting center can be obtained; furthermore, the lower bound value can be determined according to the optimal communication mode of each warehouse.

Fig. 4 is a schematic diagram illustrating a method for determining a network lower bound value in a logistics distribution network according to a second embodiment of the present invention. Referring to the network shown in fig. 4, in some alternative implementations, the determining the lower bound value may include:

first, a warehouse in a network is traversed, and a network formed by the current traversed warehouse and networks except all warehouses in candidate networks is used as a first sub-network. Referring to FIG. 4, warehouse k is the currently traversed warehouse₁As an example, firstThe sub-network is composed of k₁And is formed with the network of fig. 4 except for all the repositories, i.e. the first subnetwork comprises k₁Sorting centre f₁-f₆And site z₁-z₄。

Then, with the objective of minimizing the transportation cost of the first sub-network, the previous item connectivity relationship between the current traversal warehouse and the first sorting center in the sorting center is determined. Wherein the sorting center may be divided into several levels and the sorting center in a level geographically close to the warehouse may be referred to as a first sorting center. Referring to fig. 4, a sorting center f may be arranged₁、f₂Referred to as the first sort center. The current traversed warehouse is k₁When k can be set separately₁And f₁、f₂Can determine the communication relation with f₁、f₂Is the cost of transportation of the first sub-network. Further, the communication relationship corresponding to the lowest transportation cost of the first sub-network may be determined as k₁And communicating with the front item of the first sorting center.

And finally, determining a lower bound value of the network according to the previous item communication relation of each warehouse. After the method is adopted to determine the front item connectivity of each warehouse, the transportation costs corresponding to the front item connectivity of each warehouse can be summed to obtain the lower bound value of the network.

Referring again to fig. 4, in some further implementations, determining a previous item connectivity of a current traversal warehouse with a first one of the sorting centers, with a goal of minimizing a transportation cost of the first subnetwork, includes:

firstly, the current traversal warehouse is respectively communicated with a first sorting center in the sorting centers, and the sum of the minimum transportation cost from the first sorting center which is currently communicated to each station is determined.

Taking the currently traversed warehouse as a warehouse k₁Current and k₁The first sorting center establishing the connection relationship is f₁For example, determine from f₁To z₁-z₄The sum of the transportation costs of (a), may include: traverse z₁-z₄For the current passCalendar site (in z)₁For example), communication relationships between the stations and the connectable sorting centers are set respectively (for example, z is set respectively)₁And f₅、f₆The connectivity of (c); estimate from k₁The cost of transportation to the current traversal site, and a minimum cost of transportation corresponding to the current site is determined (e.g., f is determined separately)₁To f₅To z₁Transportation cost C of_f1,z5And determining f₁To f₆To z₁Transportation cost C of_f1,z6And take the minimum value from it); after traversing, z is compared with₁-z₄Summing the corresponding minimum transportation costs to obtain a sum C of the minimum transportation costs_f1。

Then, the previous item communication relation between the current traversal warehouse and the first target center in the first sorting center is determined according to the sum of the minimum transportation cost corresponding to each first sorting center.

Based on the same method, f is determined again₂To z₁-z₄Of transportation cost of C_f2. Further, a minimum value of the total transportation cost of the currently traversed warehouse may be determined; e.g. k₁And f₁Total transportation cost C when connected_sum1＝C_k1,f1+C_f1；k₁And f₂Total transportation cost C when connected_sum2＝C_k1,f2+C_f2. Then, the communication relation corresponding to the minimum total transportation cost can be determined as the previous communication relation between the current traversal warehouse and the first target center in the first sorting center; for example, when C_sum1At a minimum, a current traversal bin k may be determined₁Establishing a first target center of the previous item communication relation, namely a sorting center f₁。

In these further implementations, determining the connectivity of the currently traversed warehouse with the first target center according to the minimum total transportation cost can be achieved by estimating the total transportation cost according to the feasible configuration of the antecedent/consequent connectivity.

The embodiment of the present invention describes the determining step of the lower bound value in detail on the basis of the above embodiments. The transportation cost can be predicted according to the communication relation constructed each time by respectively pre-constructing the communication relation between one warehouse and each first sorting center; according to the predicted transportation cost each time, the optimal communication mode of the warehouse and the first sorting center can be obtained; furthermore, the lower bound value can be determined according to the optimal communication mode of each warehouse. In addition, the embodiment of the present invention and the method for determining a logistics distribution network proposed by the above embodiment belong to the same inventive concept, and technical details that are not described in detail in the embodiment can be referred to the above embodiment, and the embodiment has the same beneficial effects as the above embodiment.

EXAMPLE III

In this embodiment, the determination step of the upper bound value is described in detail based on the above embodiments. On the basis of the determination of the previous communication relation, the communication relation between one station and each second sorting center is respectively pre-constructed, so that the transportation cost can be predicted according to the communication relation constructed each time; according to the predicted transportation cost each time, the optimal communication mode of the station and the second sorting center can be obtained; furthermore, the upper bound value can be determined according to the optimal communication mode of each station.

Fig. 5 is a schematic diagram illustrating a method for determining a network upper bound value in a logistics distribution network according to a third embodiment of the present invention. Referring to the network shown in fig. 5, in some alternative implementations, the determining the upper bound value may include:

firstly, on the basis of the previous communication relation, traversing the sites which are not provided with the communication relation in the network, and taking the network formed by the current traversed site, the sites provided with the communication relation and the network except all the sites in the network as a second sub-network.

The previous item connectivity may be determined in the manner provided in the above embodiment, and may also be determined in another manner targeting the minimum transportation cost, for example, in a manner of using a machine learning model. After determining the antecedent connectivity of the network, the determination of the upper bound value may be made on the basis thereof.

See fig. 5, warehouse k₁-k₃The connection relation of the former items with the sorting center is determined. In fig. 5, a currently traversed site without set connectivity is taken as z₁For example, the second sub-network is formed by z due to the control of the sites that set connectivity₁And a network other than all the sites in fig. 5, i.e. the second subnetwork comprises z₁Sorting centre f₁-f₆And warehouse k₁-k₃。

And then, with the transportation cost of the second sub-network as the minimum target, determining the post-item communication relation between the current traversal station and the second sorting center in the sorting center.

Wherein the sorting center may be divided into several levels and the sorting center in a level geographically close to the station may be referred to as a second sorting center. Referring to fig. 5, a sorting center f may be arranged₅、f₆Referred to as the second sort center. The currently traversed site is z₁When z can be set separately₁And f₅、f₆Can determine the communication relation with f₅、f₆Is the cost of transportation of the second sub-network. The communication relationship corresponding to the lowest transportation cost of the second sub-network may be determined as z₁And the latter item communication relation with the second sorting center.

And finally, determining the upper bound value of the network according to the back connection relation of each site. After the method is adopted to determine the consequent connectivity of each site, the transportation costs corresponding to the consequent connectivity of each site can be summed to obtain the upper bound value of the network.

Referring again to fig. 5, in some further implementations, determining a next-item connectivity relationship between the current traversal site and a second one of the sorting centers, with a goal of minimizing transportation costs of the second subnetwork, includes:

firstly, establishing a communication relation between the current traversal site and a second sorting center in the sorting centers respectively, and determining the sum of the transportation costs from each warehouse to the current traversal site corresponding to the second sorting center establishing the communication relation currently.

Taking the currently traversed site which is not set with the connectivity as z₁At present with z₁The second sorting center establishing the connection relationship is f₅For example, determine and₅corresponding slave warehouse k₁-k₃To z₁May include: respectively determine k₁-k₃To f₅To z₁Transportation cost of C_k1,f5,z1，C_k2,f5,z1And C_k3,f5,z1And the three terms are added to obtain the product f₅Corresponding slave warehouse k₁-k₃To z₁Transport costs and C_f5,z1。

And then, determining the back item communication relation between the current traversal site and the second target center in the second sorting center according to the sum of the transportation cost corresponding to each second sorting center.

Based on the same method as above, re-determining₆Corresponding slave warehouse k₁-k₃To z₁Transport costs and C_f6,z1. Further, C may be_f5,z1And C_f6,z1Determining the connection relation of the consequent corresponding to the minimum value as z of the current traversal₁Establishing a second target center of the consequent communication relation; for example, when C_f5,z1At a minimum, z may be determined from the current traversal₁A second target center for establishing a connection relation of the back items, namely a sorting center f₅。

In these further implementations, the consequent connectivity of the current traversal site can be determined by summing the transportation costs of each warehouse to the current traversal site. And based on the same method, the consequent communication relation of each site can be realized.

The embodiment of the present invention describes in detail the determination step of the upper bound value on the basis of the above-described embodiment. On the basis of the determination of the previous communication relation, the communication relation between one station and each second sorting center is respectively pre-constructed, so that the transportation cost can be predicted according to the communication relation constructed each time; according to the predicted transportation cost each time, the optimal communication mode of the station and the second sorting center can be obtained; furthermore, the upper bound value can be determined according to the optimal communication mode of each station. In addition, the embodiment of the present invention and the method for determining a logistics distribution network proposed by the above embodiment belong to the same inventive concept, and technical details that are not described in detail in the embodiment can be referred to the above embodiment, and the embodiment has the same beneficial effects as the above embodiment.

Example four

The present embodiment adds the technical features of the priority queue on the basis of the above embodiments. By virtue of the characteristic that the priority-based queue can be sorted according to the priority of the data attribute in the priority-based queue, the parent node can be quickly acquired in each cycle.

For example, fig. 6 shows a flow chart based on a priority queue in a determination method for a logistics distribution network according to a fourth embodiment of the present invention. Referring to fig. 6, the method for determining a logistics distribution network may include the following steps:

s610, taking the initial network as a candidate network, and determining a lower bound value and an upper bound value of the initial network; the connection relationship between the sorting centers in the initial network is preset.

The lower bound value is the transportation cost determined based on the previous item communication relation between the warehouse and the sorting center in the corresponding network; the upper bound value is the transportation cost determined based on the last item communication relation between the station in the corresponding network and the sorting center on the basis of the last item communication relation.

S620, circularly adding each candidate network into the priority queue; and setting the priority in the priority queue according to the lower bound value of each candidate network.

In this embodiment, data (for example, data in a matrix format) representing connectivity of each stream point in the candidate network may be added to the priority queue as a node. The queue attribute of the node may include, but is not limited to: the lower bound value of the network represented by the node, the father node of the node (namely, the data corresponding to the connection relation of each object flow point in the father node network of the node representation network), and the consequent connection state of the node (namely, the setting condition of the consequent connection relation in the node representation network). 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 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 may include: taking data representing the connection relation of all the logistics points in the initial network as a root node, and adding the root node into a priority queue; a queue attribute is set for the root node.

S630, determining a father node in the current candidate network according to the priority, and determining whether to stop circulation according to the difference value between the lower bound value and the upper bound value of the father node determined in the current circulation.

The node with the minimum lower bound value can be set with the highest priority, so that the parent nodes in each cycle can be the nodes with the highest priority, and the rapid determination of the parent nodes is facilitated. After determining the parent node, whether to stop the loop may be determined according to a difference value between a lower bound value and an upper bound value of the parent node.

S640, if the circulation is not stopped, generating child nodes of the father nodes by setting a back item communication relation between the station and the sorting center on the basis of the father nodes; and updating the candidate network according to the lower bound value of the child node.

The sites which are not provided with the connectivity can be determined according to the property of the connectivity status of the last item in the priority queue, and then the connectivity of the first site and the last item of the sorting center in the connectivity can be set to generate the child node of the parent node. After the candidate network is updated, the step S620 may be skipped, a new node is added to the priority queue according to the newly added candidate network, and the queue attribute of the new node is set; and popping up the corresponding father node in the priority queue according to the father node attribute of the newly added node so as to ensure that the updated node corresponding to the candidate network is always stored in the priority queue.

And S650, if the circulation is stopped, determining the network corresponding to the upper limit value of the parent node determined when the circulation is stopped as the logistics distribution network.

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

The embodiment of the invention adds the technical characteristics of the priority queue on the basis of the embodiment. By virtue of the characteristic that the priority-based queue can be sorted according to the priority of the data attribute in the priority-based queue, the parent node can be quickly acquired in each cycle. In addition, the embodiment of the present invention and the method for determining a logistics distribution network proposed by the above embodiment belong to the same inventive concept, and technical details that are not described in detail in the embodiment can be referred to the above embodiment, and the embodiment has the same beneficial effects as the above embodiment.

EXAMPLE five

Fig. 7 is a schematic structural diagram illustrating a determining apparatus of a logistics distribution network according to a fifth embodiment of the present invention. The logistics distribution network determining device provided by the embodiment of the invention can be applied to determining the logistics distribution network, such as determining the network for the communication relationship between the sorting centers, determining the former communication relationship between the warehouse and the sorting center, and determining the latter communication relationship between the station and the sorting center.

As shown in fig. 7, the determining apparatus of the logistics distribution network in the embodiment of the present invention includes:

an initialization module 710, configured to use the initial network as a candidate network, and determine a lower bound value and an upper bound value of the initial network; the communication relation among the sorting centers in the initial network is preset;

an evaluation module 720, configured to determine, in a loop, a network with a minimum lower bound value in the current candidate networks as a parent node, and determine whether to stop the loop according to a difference value between the lower bound value and the upper bound value of the parent node determined in the current loop;

the branch and bound module 730 is used for generating child nodes of the father node by setting the back item communication relationship between the station and the sorting center on the basis of the father node if the circulation is not stopped; updating the candidate network according to the lower bound value of the child node;

a network determining module 740, configured to determine, if the loop is stopped, a network corresponding to the upper bound value of the parent node determined when the loop is stopped as the logistics distribution network;

In some optional embodiments, the branch-and-bound module comprises:

the branch unit is used for selecting a first site from sites which are not provided with a connection relation in a father node; and determining a network provided with a back item communication relation between the first station and the sorting center on the basis of the father node as a child node of the father node.

In some optional embodiments, the branch-and-bound module comprises:

and the delimitation unit is used for taking the child node as a new candidate network and deleting the parent node when the lower bound value of the child node is smaller than the upper bound value of the parent node.

In some optional embodiments, the initialization module and the branch-and-bound module may include:

a lower bound value determination unit for determining a lower bound value according to the following determination steps:

traversing the warehouse in the network, and taking the network formed by the current traversed warehouse and the networks except all the warehouses in the candidate network as a first sub-network;

determining the previous item communication relation between the current traversal warehouse and a first sorting center in the sorting centers by taking the minimum transportation cost of the first sub-network as a target;

and determining a lower bound value of the network according to the previous item communication relation of each warehouse.

In some optional embodiments, the lower bound value determining unit may be specifically configured to:

establishing a communication relation between the current traversal warehouse and a first sorting center in the sorting centers respectively, and determining the sum of the minimum transportation cost from the first sorting center establishing the communication relation to each station;

and determining the previous item communication relation between the current traversal warehouse and the first target center in the first sorting centers according to the sum of the minimum transportation cost corresponding to each first sorting center.

In some optional embodiments, the initialization module and the evaluation module may further include:

an upper bound value determining unit for determining an upper bound value according to the following determining steps:

on the basis of the former communication relation, traversing the sites which are not provided with the communication relation in the network, and taking the network formed by the current traversed site, the sites provided with the communication relation and the networks except all the sites in the network as a second sub-network;

determining the back item communication relation between the current traversal station and a second sorting center in the sorting centers by taking the minimum transportation cost of the second sub-network as a target;

and determining the upper bound value of the network according to the back connection relation of each site.

In some optional embodiments, the upper bound value determining unit may be specifically configured to:

establishing a communication relation between the current traversal site and a second sorting center in the sorting centers respectively, and determining the sum of the transportation costs from each warehouse to the current traversal site, which corresponds to the second sorting center establishing the communication relation currently;

and determining the back item communication relation between the current traversal station and the second target center in the second sorting center according to the sum of the transportation cost corresponding to each second sorting center.

In some optional embodiments, the determining device of the logistics distribution network may further include:

the queue adding module is used for adding each candidate network into the priority queue; wherein, the priority queue sets the priority according to the lower bound value of each candidate network;

accordingly, the evaluation module may be configured to: and determining the parent node in the current candidate network according to the priority.

In some optional embodiments, the evaluation module may be specifically configured to:

and determining a relative difference value between the lower bound value and the upper bound value of the father node determined in the current cycle, and stopping the cycle if the relative difference value is less than or equal to a preset threshold value.

The determining apparatus for a logistics distribution network according to the embodiment of the present invention is the same as the determining method for a logistics distribution network according to the embodiment of the present invention, and the technical details that are not described in detail in the embodiment of the present invention can be referred to the embodiment of the present invention, and the embodiment of the present invention has the same beneficial effects as the embodiment of the present invention.

EXAMPLE six

Fig. 8 shows a schematic diagram of a hardware structure of a terminal device according to a sixth embodiment of the present invention. The terminal device in the embodiments of the present invention may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a PDA (personal digital assistant), a PAD (tablet computer), a PMP (portable multimedia player), a vehicle terminal (e.g., a car navigation terminal), and the like, and a fixed terminal such as a digital TV, a desktop computer, and the like. The terminal device shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 8, the terminal device 800 may include a processing means (e.g., a central processing unit, a graphic processor, etc.) 801 that may 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 means 808 into a Random Access Memory (RAM) 803. In the RAM803, various programs and data necessary for the operation of the terminal apparatus 800 are also stored. The processing apparatus 801, the ROM 802, and the RAM803 are connected to each other by a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.

Generally, the following devices may be connected to the I/O interface 805: input devices 806 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 807 including, for example, a Liquid Crystal Display (LCD), speakers, vibrators, and the like; storage 808 including, for example, magnetic tape, hard disk, etc.; and a communication device 809. The communication means 809 may allow the terminal apparatus 800 to perform wireless or wired communication with other apparatuses to exchange data. While fig. 8 illustrates a terminal apparatus 800 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.

In particular, according to an embodiment of the present invention, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the invention include a computer program product comprising a computer program embodied on a computer-readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication means 809, or installed from the storage means 808, or installed from the ROM 802. When executed by the processing device 801, the computer program performs the above-described functions defined in the method for determining a logistics distribution network according to the embodiment of the present invention.

The terminal provided by the embodiment of the present invention and the method for determining the logistics distribution network provided by the embodiment of the present invention belong to the same inventive concept, and technical details that are not described in detail in the embodiment of the present invention can be referred to the embodiment of the present invention, and the embodiment of the present invention has the same beneficial effects as the embodiment of the present invention.

EXAMPLE seven

An embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method for determining a logistics distribution network provided in the above-mentioned embodiment.

It should be noted that the computer readable storage medium mentioned above in the embodiments of the present invention may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a Read-Only Memory (ROM), an Erasable Programmable Read-Only Memory (EPROM) or FLASH Memory (FLASH), an optical fiber, a portable compact disc Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In embodiments of the invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In yet another embodiment of the invention, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.

In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (Hyper Text Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network.

The computer-readable storage medium may be included in the terminal device or may be separately present without being incorporated in 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 is enabled to:

taking the initial network as a candidate network, and determining a lower bound value and an upper bound value of the initial network; the communication relation among the sorting centers in the initial network is preset; determining a network with the minimum lower bound value in the current candidate networks as a father node in a circulating manner, and determining whether to stop circulating or not according to the difference value between the lower bound value and the upper bound value of the father node determined in the current circulating manner; if the circulation is not stopped, generating child nodes of the father nodes by setting a back item communication relation between the station and the sorting center on the basis of the father nodes; updating the candidate network according to the lower bound value of the child node; if the circulation is stopped, determining a network corresponding to the upper bound value of the father node determined when the circulation is stopped as a logistics distribution network; the lower bound value is the transportation cost determined based on the previous item communication relation between the warehouse and the sorting center in the corresponding network; the upper bound value is the transportation cost determined based on the last item communication relation between the station in the corresponding network and the sorting center on the basis of the last item communication relation.

Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. 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. In the case of 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 the connection may be made to an external computer (for example, through 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 invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functional pages 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 the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units described in the embodiments of the present invention may be implemented by software or hardware. Where the name of an element does not in some cases constitute a limitation on the element itself.

The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of 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 a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.

It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments illustrated herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit 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, comprising:

2. The method of claim 1, wherein the generating child nodes of the parent node by setting a post connectivity relationship between the station and the sorting center on the parent node basis comprises:

selecting a first site from sites which are not set with a connection relation in the father node;

and determining a network provided with the posterior connection relation between the first station and the sorting center on the basis of the father node as a child node of the father node.

3. The method of claim 1, wherein the updating the candidate network according to the lower bound value of the child node comprises:

and when the lower bound value of the child node is smaller than the upper bound value of the father node, taking the child node as a new candidate network, and deleting the father node.

4. The method of claim 1, wherein the determining the lower bound value comprises:

traversing the warehouse in the network, and taking a network formed by the current traversed warehouse and the networks except all the warehouses in the candidate network as a first sub-network;

determining the previous item communication relation between the current traversal warehouse and a first sorting center in the sorting centers by taking the transportation cost of the first sub-network as the minimum target;

5. The method of claim 4, wherein determining the connectivity relationship of the current traversal warehouse with the previous item of the first one of the sorting centers, with the objective of minimizing the transportation cost of the first sub-network, comprises:

determining a previous item connectivity relationship of a current traversal warehouse with a first target center of the first sort centers according to a sum of minimum transportation costs corresponding to the first sort centers.

6. The method of claim 1, wherein the determining the upper bound value comprises:

on the basis of the former communication relation, traversing the sites which are not provided with the communication relation in the network, and taking a network formed by the currently traversed sites, the sites provided with the communication relation and the networks except all the sites in the network as a second sub-network;

determining a back item communication relation between the current traversal station and a second sorting center in the sorting centers by taking the minimum transportation cost of the second sub-network as a target;

and determining an upper bound value of the network according to the next item connectivity of each site.

7. The method of claim 6, wherein the determining a late connectivity relationship between a current traversal site and a second one of the sorting centers, targeting a minimum transportation cost of the second sub-network, comprises:

establishing a communication relationship between the current traversal site and a second sorting center in the sorting centers respectively, and determining the sum of the transportation costs from each warehouse to the current traversal site, which corresponds to the second sorting center establishing the communication relationship currently;

and determining the consequent communication relationship between the current traversal site and a second target center in the second sorting centers according to the sum of the transportation costs corresponding to the second sorting centers.

8. The method of claim 1, further comprising:

adding each of the candidate networks to a priority queue; setting the priority in the priority queue according to the lower bound value of each candidate network;

correspondingly, the determining the network with the minimum lower bound value in the current candidate networks as the parent node includes: and determining the parent node in the current candidate network according to the priority.

9. The method of claim 1, wherein the determining whether to stop the loop according to the determined gap value between the lower bound value and the upper bound value of the parent node in the current loop comprises:

10. A device for determining a logistics distribution network, comprising:

11. A terminal device, characterized in that the terminal comprises:

one or more processors;

a memory for storing one or more programs;

when executed by the one or more processors, cause the one or more processors to implement the method of determining a logistics distribution network of any of claims 1-9.

12. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method for determining a logistics distribution network according to any one of claims 1-9.