WO2023098698A1 - Procédé et appareil de détermination de réseau de distribution logistique, équipement terminal et support d'enregistrement - Google Patents

Procédé et appareil de détermination de réseau de distribution logistique, équipement terminal et support d'enregistrement Download PDF

Info

Publication number
WO2023098698A1
WO2023098698A1 PCT/CN2022/135277 CN2022135277W WO2023098698A1 WO 2023098698 A1 WO2023098698 A1 WO 2023098698A1 CN 2022135277 W CN2022135277 W CN 2022135277W WO 2023098698 A1 WO2023098698 A1 WO 2023098698A1
Authority
WO
WIPO (PCT)
Prior art keywords
network
parent node
bound value
sorting
lower bound
Prior art date
Application number
PCT/CN2022/135277
Other languages
English (en)
Chinese (zh)
Inventor
吴盛楠
庄晓天
牛志强
佟路
Original Assignee
北京京东振世信息技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 北京京东振世信息技术有限公司 filed Critical 北京京东振世信息技术有限公司
Publication of WO2023098698A1 publication Critical patent/WO2023098698A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083—Shipping
    • G06Q10/0835—Relationships between shipper or supplier and carriers
    • G06Q10/08355—Routing methods

Definitions

  • 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.
  • the network composed of warehouses, sorting centers and stations can be called a logistics distribution network.
  • the logistics distribution network can be determined.
  • two kinds of solving algorithms, the precise algorithm and the heuristic algorithm can be mainly applied.
  • 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.
  • the present application provides a method for determining a logistics distribution network, including:
  • the initial network 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;
  • 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;
  • the network corresponding to the upper bound value of the parent node determined when the loop is stopped is determined as the logistics distribution network
  • the lower 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.
  • 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;
  • 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.
  • the present application provides a terminal device, including:
  • processors one or more processors
  • memory configured to store one or more programs
  • the one or more processors 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.
  • 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.
  • 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.
  • 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.
  • the method for determining the logistics distribution network includes:
  • 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.
  • 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.
  • 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.
  • the initial network may include warehouse k 1 - warehouse k 3 , sorting center f 1 - sorting center f 6 , station z 1 -site z 4 .
  • 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.
  • the connection relationship within f 1 -f 6 is determined, but the connection relationship between k 1 -k 3 and the sorting center and z 1 -z 4 and the sorting center is uncertain.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the lower bound of the overall transportation cost can be predicted separately through two-stage estimation values and upper bounds.
  • the first-stage estimation can estimate the lower bound value of the network
  • the second-stage estimation can estimate the lower bound value of the network.
  • 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.
  • the corresponding subsequent connection relationship may be different.
  • the following situation may exist in the first stage of estimation: when warehouse k 1 sets the previous connection relationship to produce the minimum cost, station z 1 needs to be connected with sorting center f 5 ; and warehouse k 2 sets the previous connection When the relationship produces the minimum cost, station z 1 needs to be connected with sorting center f 6 . Therefore, the lower bound value can be the idealized minimum transportation cost, which is usually smaller than the real transportation cost.
  • 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.
  • 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.
  • 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 .
  • 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.
  • 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.
  • 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.
  • the determination of the logistics distribution network can improve the scope of application of the determination method.
  • 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.
  • 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.
  • 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.
  • 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 may include: randomly selecting the first site from sites z 1 -z 4 that have no connectivity relationship, for example, selecting z 1 ; on the basis of the parent node, setting z 1 and the sorting center Connectivity relationship, for example, set z 1 to be connected to f 5 to get a child node, and set z 1 to be connected to f 6 to get another child node.
  • 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 .
  • the lower bound value of the child node is usually greater than or equal to the lower bound value of the parent node.
  • the upper bound value of the child node is usually greater than the upper bound value of the parent node.
  • 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.
  • the child node can be used as a new candidate network.
  • 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.
  • 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.
  • the loop can be stopped, and the logistics distribution network can be determined according to the parent node determined when the loop is stopped.
  • 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.
  • 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.
  • 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
  • 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.
  • This embodiment describes the manner of determining the lower limit value on the basis of the foregoing embodiments.
  • 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.
  • the manner of determining the lower bound value may include:
  • 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.
  • the first sub-network is composed of k 1 and the network except all warehouses in Fig. 4, that is, the first sub-network includes k 1 and the sorting center f 1 -f 6 , and station z 1 -z 4 .
  • 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.
  • the sorting centers f 1 and f 2 can be called the first sorting center.
  • the connection relationship between k 1 and f 1 and f 2 can be set respectively, and the transportation cost of the first sub-network can be determined when it is connected with f 1 and f 2 .
  • 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 1 and the first sorting center.
  • the lower bound value of the candidate network is determined.
  • the transportation costs corresponding to the preceding connection relations of each warehouse can be summed to obtain the lower bound value of the 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:
  • 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.
  • determining the sum of transportation costs from f 1 to z 1 -z 4 may include: traversing z 1 -z 4 , for the currently traversed station (take z 1 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 1 and f 5 , f 6 respectively); Estimate the transport cost from k 1 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 1 to f 5 to z 1 , and determine f 1 to f 6 to The transportation cost C f1,z6 of z 1 , and take the minimum value); after the traversal, sum the minimum transportation costs corresponding to z 1 -z 4 to obtain a minimum transportation cost sum C f1 .
  • 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 1 to establish the connection relationship of the preceding item is the sorting center f 1 .
  • 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.
  • 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.
  • 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.
  • This embodiment describes the manner of determining the upper limit value on the basis of the foregoing embodiments.
  • 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.
  • the manner of determining the upper limit value may include:
  • 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 .
  • the upper limit value can be determined on the basis of it.
  • the connection relationship between warehouses k 1 -k 3 and the sorting center has been determined.
  • the second sub-network is composed of z 1 , which is composed of the network except all stations in Fig. 5, That is, the second sub-network includes z 1 , sorting centers f 1 -f 6 , and warehouses k 1 -k 3 .
  • 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.
  • the sorting centers f 5 and f 6 can be called the second sorting center.
  • the connection relationship between z 1 and f 5 and f 6 can be set respectively, and the transportation cost of the second sub-network can be determined when connecting with f 5 and f 6 .
  • 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 1 and the second sorting center.
  • the upper bound value of the candidate network is determined.
  • the transportation costs corresponding to the subsequent connection relationship of each site can be summed to obtain the upper limit value of the 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:
  • the sum of transportation costs can include: respectively determine the transportation costs of k 1 -k 3 to f 5 to z 1 , 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 1 -k 3 to z 1 corresponding to f 5 is obtained by summing C f5,z1 .
  • the transportation cost and C f6,z1 corresponding to f 6 from warehouse k 1 -k 3 to z 1 .
  • 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 1 is the sorting center f 5 .
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the method for determining the logistics distribution network may include:
  • 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.
  • 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.
  • 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).
  • 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.
  • 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.
  • 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.
  • 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.
  • the parent node in the current cycle 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.
  • 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.
  • 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.
  • 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.
  • 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 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.
  • 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.
  • 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:
  • the lower limit value determination unit can be set to:
  • 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.
  • 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:
  • 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.
  • the upper limit value determination unit can be set to:
  • 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 .
  • the assessment module can be set to:
  • 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.
  • the embodiment has the same effect as the above-described embodiment.
  • 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.
  • 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 .
  • 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.
  • 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.
  • the processes described above with reference to the flowcharts may be implemented as computer software programs.
  • 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.
  • the computer program may be downloaded and installed from a network via communication means 809, or from storage means 808, or from ROM 802.
  • 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.
  • the embodiment of the present application is consistent with the above embodiment has the same effect.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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).
  • 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.
  • 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.
  • 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.
  • exemplary forms of hardware logic components 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.

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Quality & Reliability (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

Procédé et appareil de détermination de réseau de distribution logistique, équipement terminal et support d'enregistrement. Le procédé de détermination de réseau de distribution logistique comprend les étapes suivantes : la sélection d'un réseau initial en tant que réseau candidat, la détermination d'une valeur liée inférieure et d'une valeur liée supérieure du réseau initial ; la sélection d'un réseau candidat ayant une valeur liée inférieure minimale en tant que nœud parent dans une boucle de courant, et la détermination, en fonction d'une différence entre une valeur liée inférieure et une valeur liée supérieure du nœud parent, du fait que la boucle doit être arrêtée ; si la boucle ne doit pas être arrêtée, la génération d'un sous-nœud par réglage de la relation de connexion conséquente entre une station et un centre de tri sur la base du nœud père ; la mise à jour du réseau candidat dans la boucle de courant selon une valeur liée inférieure du sous-nœud, et pénétration dans une boucle suivante ; et si la boucle doit être arrêtée, la sélection d'un réseau correspondant à une valeur liée supérieure du nœud parent lors de l'arrêt de la boucle en tant que réseau de distribution logistique. La valeur liée inférieure est déterminée sur la base de la relation liée antécédente entre un entrepôt et un centre de tri dans un réseau correspondant, et la valeur liée supérieure est déterminée sur la base de la relation de connexion conséquente entre une station et un centre de tri dans un réseau correspondant et la relation connectée antécédente.
PCT/CN2022/135277 2021-11-30 2022-11-30 Procédé et appareil de détermination de réseau de distribution logistique, équipement terminal et support d'enregistrement WO2023098698A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111444293.9 2021-11-30
CN202111444293.9A CN114154930A (zh) 2021-11-30 2021-11-30 物流配送网络的确定方法、装置、终端设备及存储介质

Publications (1)

Publication Number Publication Date
WO2023098698A1 true WO2023098698A1 (fr) 2023-06-08

Family

ID=80454918

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/135277 WO2023098698A1 (fr) 2021-11-30 2022-11-30 Procédé et appareil de détermination de réseau de distribution logistique, équipement terminal et support d'enregistrement

Country Status (2)

Country Link
CN (1) CN114154930A (fr)
WO (1) WO2023098698A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114154930A (zh) * 2021-11-30 2022-03-08 北京京东振世信息技术有限公司 物流配送网络的确定方法、装置、终端设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130061203A1 (en) * 2011-09-06 2013-03-07 International Business Machines Corporation Modeling Task-Site Allocation Networks
US20190394737A1 (en) * 2017-03-07 2019-12-26 Huawei Technologies Co., Ltd. Parent Node Selection Method and Network Node
CN111667085A (zh) * 2019-03-08 2020-09-15 北京京东尚科信息技术有限公司 物流路由网络的确定方法、装置、介质及电子设备
CN113259144A (zh) * 2020-02-07 2021-08-13 北京京东振世信息技术有限公司 一种仓储网络规划方法和装置
CN114154930A (zh) * 2021-11-30 2022-03-08 北京京东振世信息技术有限公司 物流配送网络的确定方法、装置、终端设备及存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130061203A1 (en) * 2011-09-06 2013-03-07 International Business Machines Corporation Modeling Task-Site Allocation Networks
US20190394737A1 (en) * 2017-03-07 2019-12-26 Huawei Technologies Co., Ltd. Parent Node Selection Method and Network Node
CN111667085A (zh) * 2019-03-08 2020-09-15 北京京东尚科信息技术有限公司 物流路由网络的确定方法、装置、介质及电子设备
CN113259144A (zh) * 2020-02-07 2021-08-13 北京京东振世信息技术有限公司 一种仓储网络规划方法和装置
CN114154930A (zh) * 2021-11-30 2022-03-08 北京京东振世信息技术有限公司 物流配送网络的确定方法、装置、终端设备及存储介质

Also Published As

Publication number Publication date
CN114154930A (zh) 2022-03-08

Similar Documents

Publication Publication Date Title
WO2023092792A1 (fr) Procédé d'optimisation de modélisation basé sur un apprentissage fédéré, et dispositif électronique, support de stockage et produit-programme
US20150356703A1 (en) Arranging a transport service based on computed vectors associated with service providers
WO2023098698A1 (fr) Procédé et appareil de détermination de réseau de distribution logistique, équipement terminal et support d'enregistrement
CN110781373B (zh) 榜单更新方法、装置、可读介质和电子设备
US11651498B2 (en) Method for accelerating three-dimensional object segmentation with point cloud simplifications
CN112650841A (zh) 信息处理方法、装置和电子设备
WO2023116138A1 (fr) Procédé de modélisation pour modèle multitâche, procédé de traitement de contenu promotionnel et appareils associés
CN111044062B (zh) 路径规划、推荐方法和装置
CN114007231B (zh) 异构无人机数据卸载方法、装置、电子设备及存储介质
WO2022188534A1 (fr) Procédé et appareil de poussée d'informations
CN113534790B (zh) 路径规划方法、装置、电子设备及计算机可读存储介质
CN113255950B (zh) 一种优化物流网络的方法和装置
CN113673446A (zh) 图像识别方法、装置、电子设备和计算机可读介质
CN113837808B (zh) 一种推广信息的推送方法、装置、设备、介质及产品
WO2022063157A1 (fr) Procédé de configuration de paramètres et système associé
CN114666263A (zh) 高动态的智能路由确定方法、装置、电子设备及存储介质
CN114692898A (zh) Mec联邦学习方法、装置及计算机可读存储介质
CN111582456A (zh) 用于生成网络模型信息的方法、装置、设备和介质
CN113778078A (zh) 定位信息生成方法、装置、电子设备和计算机可读介质
CN110752958A (zh) 用户行为分析方法、装置、设备及存储介质
CN116521377B (zh) 业务计算卸载方法、系统、装置、设备及介质
CN111582482B (zh) 用于生成网络模型信息的方法、装置、设备和介质
US20230334096A1 (en) Graph data processing method and apparatus, computer device, and storage medium
CN110633707A (zh) 预测速度的方法和装置
CN116822259B (zh) 基于场景模拟的评价信息生成方法、装置和电子设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22900502

Country of ref document: EP

Kind code of ref document: A1