Logistics network upgrading method and apparatus

By establishing an optimization model and evaluating the logistics network upgrade plan, the problem of difficult to evaluate the impact of the number of forward warehouses on the total network cost is solved, and the effect of reducing the total network cost and improving service quality is achieved.

WO2024244518A1PCT designated stage expired Publication Date: 2024-12-05BEIJING JINGDONG QIANSHITECHNOLOGY CO LTD

Patent Information

Application Number
PCT/CN2024/074882
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-05-31
Filing Date
2024-01-31
Publication Date
2024-12-05

AI Technical Summary

Technical Problem

The existing logistics network upgrade plan is difficult to scientifically and reasonably evaluate the impact of the number of forward warehouses on the overall network cost, resulting in inaccurate cost assumptions, affecting the quality of decision-making, and the cost items related to warehousing are complex, which are often regarded as sunk costs and are not introduced. Calculation process.

Method used

By obtaining the network structure information and cost information of the logistics network, an optimization model aimed at minimizing the total network cost is established, and the constraints such as the number of upgrade warehouses, network coverage relationship, customer needs, timeliness and node traffic balance are solved. The warehouse increase plan under each warehouse increase number, and the warehouse increase plan with the lowest total cost of the network.

Benefits of technology

It realizes the optimal solution to the cost-timedness of the entire network under different network levels and fulfillment modes, reduces the total network cost, and improves the market competitiveness and service quality of logistics companies.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2024074882_05122024_PF_FP_ABST
    Figure CN2024074882_05122024_PF_FP_ABST
Patent Text Reader

Abstract

A logistics network upgrading method and apparatus. A specific implementation of the present method comprises: acquiring network structure information and cost information of a logistics network, the logistics network comprising a supplier node, a regional warehouse node, a preposition warehouse node, and a customer node; generating warehouse upgrading schemes to upgrade a preposition warehouse node into a regional warehouse node; according to the network structure information and the cost information, establishing an optimization model using a minimum total network cost as a target; solving the optimization model for each quantity of upgraded warehouses, to obtain a warehouse upgrading scheme for each quantity of upgraded warehouses, a constraint of the optimization model comprising at least one of the following: a constraint of the quantities of upgraded warehouses, a network coverage relationship constraint, a customer demand constraint, a time-limited single volume ratio constraint, and a node traffic balancing constraint; outputting a warehouse upgrading scheme having the lowest total network cost. The present implementation can predict the cost of upgrading a logistics network, and obtain a scheme for upgrading the logistics network having the lowest cost.
Need to check novelty before this filing date? Find Prior Art

Description

Logistics network upgrading method and device

[0001] This disclosure claims priority to Chinese patent application number 202310635923.3, filed on May 31, 2023, entitled “Logistics Network Upgrading Method and Device,” the entire contents of which are incorporated by reference into this disclosure. Technical Field

[0002] The embodiments of the present disclosure relate to the field of logistics technology, and more particularly to a method and apparatus for upgrading a logistics network. Background Art

[0003] As logistics companies continue to grow, their customer base and distribution characteristics are constantly changing. Coupled with the emergence of emerging business models such as Douyin and Kuaishou e-commerce, livestreaming, and community group buying, logistics companies are required to continuously adjust their supply chain network structures and plan their warehouse and network layouts for the coming years. However, the logistics business itself has limited profit margins, and network upgrades require significant investment in human and material resources. Irrational network adjustment plans will continue to impact logistics companies' profitability and significantly reduce their market competitiveness. Therefore, it is imperative to scientifically and rationally evaluate and calculate network upgrade plans, exploring the optimal solution for cost and timeliness across the entire network at different network levels and under different fulfillment models.

[0004] Current research typically limits the number of warehouse upgrades by either directly setting an upper limit or by factoring in the added costs of upgrading forward warehouses. This approach then considers the cost of upgrading warehouses, the resulting transportation cost savings, and the improved service quality, to calculate a cost-effective upgrade plan. However, in actual business evaluations, the costs associated with upgrading warehouses are often difficult to determine, and the influencing factors are complex. Therefore, the costs associated with upgrading warehouses are often treated as sunk costs and not included in the calculation process. The resulting upgrade plan is highly sensitive to cost-related data, and inappropriate cost assumptions can directly impact the strategy's effectiveness and the quality of the decision. Therefore, how to rationally assess the impact of upgrading the number of forward warehouses on the overall network cost becomes a pressing issue.

[0005] Summary of the Invention

[0006] The embodiments of the present disclosure provide a method and apparatus for upgrading a logistics network.

[0007] In a first aspect, an embodiment of the present disclosure provides a logistics network upgrading method, comprising: obtaining network structure information and cost information of a logistics network, wherein the logistics network includes supplier nodes, regional warehouse nodes, forward warehouse nodes, and customer nodes; generating various warehouse upgrading schemes for upgrading forward warehouse nodes to regional warehouse nodes; establishing an optimization model with the goal of minimizing the total network cost based on the network structure information and the cost information; solving the optimization model under each warehouse upgrading quantity to obtain the warehouse upgrading scheme under each warehouse upgrading quantity, wherein the constraints of the optimization model include at least one of the following: upgrade warehouse quantity constraint, network coverage relationship constraint, customer demand constraint, time-sensitive order quantity ratio constraint, and node traffic balance constraint; and outputting the warehouse upgrading scheme with the lowest total network cost.

[0008] In some embodiments, the method further includes: calculating the average cost of the upgrade plan under each upgrade quantity; and outputting the upgrade quantity with the lowest average cost.

[0009] In some embodiments, the total network cost includes the total transportation cost; and the optimization model established based on the network structure information and the cost information with the goal of minimizing the total network cost includes: obtaining a first unit transportation cost set from the supplier node to each regional warehouse node, a second unit transportation cost set from each regional warehouse node to each forward warehouse node, and a third unit transportation cost set from each forward warehouse node to each customer node; taking the forward warehouse node to be upgraded, the coverage relationship between each node, and the number of waybills between each node as decision variables; calculating the total transportation cost as the target of the optimization model based on the first unit transportation cost set, the second unit transportation cost set, the third unit transportation cost set and the decision variables.

[0010] In some embodiments, the total network cost includes the total warehouse rental cost; and the optimization model established based on the network structure information and the cost information with the goal of minimizing the total network cost includes: obtaining the first rent corresponding to the unit waybill of each regional warehouse node and the second rent corresponding to the unit waybill of each forward warehouse node; taking the forward warehouse nodes to be upgraded, the coverage relationship between each node, and the number of waybills between each node as decision variables; calculating the total warehouse rental cost as the target of the optimization model based on the first rent, the second rent and the decision variables.

[0011] In some embodiments, the total network cost includes the total transportation cost and the total warehouse rental cost; and the optimization model established based on the network structure information and the cost information with the goal of minimizing the total network cost also includes: obtaining a first unit transportation cost set from the supplier node to each regional warehouse node, a second unit transportation cost set from each regional warehouse node to each forward warehouse node, and a third unit transportation cost set from each forward warehouse node to each customer node; obtaining the first rent corresponding to the unit waybill of each regional warehouse node and the second rent corresponding to the unit waybill of each forward warehouse node; taking the forward warehouse node to be upgraded, the coverage relationship between each node, and the number of waybills between each node as decision variables; calculating the total warehouse rental cost based on the first rent, the second rent and the decision variables; calculating the total transportation cost based on the first unit transportation cost set, the second unit transportation cost set, the third unit transportation cost set and the decision variables; calculating the total network cost based on the total transportation cost and the total warehouse rental cost as the goal of the optimization model.

[0012] In some embodiments, the method further includes: calculating the detour coefficient and the number of transfers for each route segment based on historical data; and adjusting the total transportation cost based on the detour coefficient and the number of transfers for each route segment.

[0013] In some embodiments, the number of waybills between each node in the decision variable includes the number of waybills from each supplier node to each regional warehouse node, the number of waybills from each regional warehouse node to each forward warehouse node, the number of waybills of different time periods from each regional warehouse node to each customer node, and the number of waybills of different time periods from each forward warehouse node to each customer node.

[0014] In some embodiments, the method further includes: adjusting the total transportation cost according to waybill coefficients of different time limits.

[0015] In some embodiments, the total transportation cost includes the internal transportation cost between the regional warehouse node and the forward warehouse node and the fulfillment transportation cost between the forward warehouse node and the customer node; and the method also includes: calculating the proportion of the internal transportation cost of each warehouse upgrade plan to the total transportation cost; and outputting the warehouse upgrade plan with the lowest proportion.

[0016] In the second aspect, an embodiment of the present disclosure provides a logistics network upgrading device, comprising: an acquisition unit, configured to acquire network structure information and cost information of a logistics network, wherein the logistics network includes supplier nodes, regional warehouse nodes, forward warehouse nodes, and customer nodes; a generation unit, configured to generate various warehouse upgrading schemes for upgrading forward warehouse nodes to regional warehouse nodes; an establishment unit, configured to establish an optimization model with the goal of minimizing the total network cost based on the network structure information and the cost information; a solution unit, configured to solve the optimization model under each warehouse upgrading quantity to obtain a warehouse upgrading scheme under each warehouse upgrading quantity, wherein the constraints of the optimization model include at least one of the following: upgrade warehouse quantity constraint, network coverage relationship constraint, customer demand constraint, time-sensitive order quantity ratio constraint, and node traffic balance constraint; an output unit, configured to output the warehouse upgrading scheme with the lowest total network cost.

[0017] In some embodiments, the output unit is further configured to: calculate the average cost of the upgrade plan under each upgrade quantity; and output the upgrade quantity with the lowest average cost.

[0018] In some embodiments, the total network cost includes the total transportation cost; and the establishment unit is further configured to: obtain a first unit transportation cost set from the supplier node to each regional warehouse node, a second unit transportation cost set from each regional warehouse node to each forward warehouse node, and a third unit transportation cost set from each forward warehouse node to each customer node; use the forward warehouse node to be upgraded, the coverage relationship between each node, and the number of waybills between each node as decision variables; calculate the total transportation cost as the target of the optimization model based on the first unit transportation cost set, the second unit transportation cost set, the third unit transportation cost set and the decision variables.

[0019] In some embodiments, the total network cost includes the total warehouse rental cost; and the establishment unit is further configured to: obtain the first rent corresponding to the unit waybill of each regional warehouse node and the second rent corresponding to the unit waybill of each forward warehouse node; use the forward warehouse nodes to be upgraded, the coverage relationship between each node, and the number of waybills between each node as decision variables; calculate the total warehouse rental cost as the target of the optimization model based on the first rent, the second rent and the decision variables.

[0020] In some embodiments, the total network cost includes the total transportation cost and the total warehouse rental cost; and the establishment unit is further configured to: obtain a first unit transportation cost set from the supplier node to each regional warehouse node, a second unit transportation cost set from each regional warehouse node to each forward warehouse node, and a third unit transportation cost set from each forward warehouse node to each customer node; obtain the first rent corresponding to the unit waybill of each regional warehouse node and the second rent corresponding to the unit waybill of each forward warehouse node; use the forward warehouse node to be upgraded, the coverage relationship between each node, and the number of waybills between each node as decision variables; calculate the total warehouse rental cost based on the first rent, the second rent and the decision variables; calculate the total transportation cost based on the first unit transportation cost set, the second unit transportation cost set, the third unit transportation cost set and the decision variables; calculate the total network cost based on the total transportation cost and the total warehouse rental cost as the target of the optimization model.

[0021] In some embodiments, the solution unit is further configured to: calculate the detour coefficient and the number of transfers for each route segment based on historical data; and adjust the total transportation cost based on the detour coefficient and the number of transfers for each route segment.

[0022] In some embodiments, the number of waybills between each node in the decision variable includes the number of waybills from each supplier node to each regional warehouse node, the number of waybills from each regional warehouse node to each forward warehouse node, the number of waybills of different time periods from each regional warehouse node to each customer node, and the number of waybills of different time periods from each forward warehouse node to each customer node.

[0023] In some embodiments, the solving unit is further configured to adjust the total transportation cost according to waybill coefficients of different time limits.

[0024] In some embodiments, the total transportation cost includes the internal transportation cost between the regional warehouse node and the forward warehouse node and the fulfillment transportation cost between the forward warehouse node and the customer node; and the output unit is further configured to: calculate the proportion of the internal transportation cost of each warehouse upgrade plan to the total transportation cost; and output the warehouse upgrade plan with the lowest proportion.

[0025] In a third aspect, an embodiment of the present disclosure provides an electronic device for upgrading a logistics network, comprising: one or more processors; a storage device on which one or more computer programs are stored, and when the one or more computer programs are executed by the one or more processors, the one or more processors implement the method as described in any one of the first aspects.

[0026] In a fourth aspect, an embodiment of the present disclosure provides a computer-readable medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the method as described in any one of the first aspects is implemented.

[0027] It should be understood that the contents described in this section are not intended to identify the key or important features of the embodiments of the present disclosure, nor are they intended to limit the scope of the present disclosure. Other features of the present disclosure will become readily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] Other features, objects and advantages of the present disclosure will become more apparent from a reading of the detailed description of non-limiting embodiments made with reference to the following drawings:

[0029] FIG1 is a diagram of an exemplary system architecture in which an embodiment of the present disclosure may be applied;

[0030] FIG2 is a flow chart of an embodiment of a method for upgrading a logistics network according to the present disclosure;

[0031] FIG3 is a schematic diagram of an application scenario of the method for upgrading a logistics network according to the present disclosure;

[0032] 4a-4c are network structure diagrams of a logistics network according to the present disclosure;

[0033] FIG5 is a schematic structural diagram of an embodiment of an apparatus for upgrading a logistics network according to the present disclosure;

[0034] FIG6 is a schematic diagram of a computer system of an electronic device suitable for implementing an embodiment of the present disclosure. DETAILED DESCRIPTION

[0035] The present disclosure will be further described in detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are intended only to illustrate the relevant invention and are not intended to limit the invention. It should also be noted that, for ease of description, only portions relevant to the relevant invention are shown in the accompanying drawings.

[0036] It should be noted that, in the absence of conflict, the embodiments and features of the embodiments in the present disclosure may be combined with each other. The present disclosure will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0037] Figure 1 illustrates the network structure of a logistics network. As shown in Figure 1, the network consists of four different nodes: supplier nodes, regional warehouse nodes, forward warehouse nodes, and customer nodes. Suppliers deliver goods to regional warehouses based on customer requirements. Logistics companies distribute goods from regional warehouses to various forward warehouses, which then fulfill orders for different customers. Regional warehouses typically store a wide variety of SKUs, occupy large warehouse areas, and have a smaller overall quantity. Forward warehouses typically store popular items. By shortening the physical distance between the storage location and customers, they reduce fulfillment time and improve service quality.

[0038] As a company's business grows, customer demand for products beyond best-sellers gradually increases. At this point, some forward warehouses may struggle to meet demand for popular items near customer nodes, requiring regional warehouses to fulfill these product demands. However, since regional warehouses are farther from customers than forward warehouses, logistics service quality and fulfillment timelines are difficult to guarantee. In this case, consider upgrading some forward warehouses to regional warehouses and upgrading the overall warehouse network structure. This process primarily involves deciding which forward warehouses to upgrade and how to adjust the coverage relationship between regional warehouses and forward warehouses after the upgrade. Key factors to consider include the total cost of the upgraded network and the overall fulfillment timeline requirements.

[0039] 2, a process 200 of an embodiment of a logistics network upgrade method according to the present disclosure is shown. The logistics network upgrade method includes the following steps:

[0040] Step 201: Obtain network structure information and cost information of the logistics network.

[0041] In this embodiment, the execution entity of the logistics network upgrade method (e.g., a server of the logistics network) can obtain network structure information and cost information of the logistics network through a wired connection or a wireless connection. The logistics network includes supplier nodes, regional warehouse nodes, forward warehouse nodes, and customer nodes. Network structure information may include the number of nodes at each layer, the inbound and outbound costs of warehouse nodes, the number of demand orders at demand nodes, the location of nodes, the length of lines between nodes, etc. Cost information may include unit rental costs, unit transportation costs, etc., and cost information can be calculated using historical data.

[0042] Step 202: Generate various warehouse upgrading plans for upgrading the forward warehouse node to a regional warehouse node.

[0043] In this example, consider a four-tier supply chain network for a single supplier, which can be abstracted as the dot-line diagram in Figure 4a. Each dot in the diagram represents an entity in the network, such as a warehouse or customer, and each line represents a possible route. A complete warehouse upgrade plan should determine which forward warehouses should be upgraded to regional warehouses, the new coverage relationship between regional warehouses and forward warehouses after the upgrade, and the coverage relationship between the remaining forward warehouses and customers after the upgrade.

[0044] In order to simplify the problem and based on business constraints, this paper considers the warehouse network upgrade problem under a simplified four-layer network structure of a single supplier, wherein the network upgrade will not change the coverage relationship between the forward warehouse and the customer, and a single customer can only be fulfilled by 1) a single regional warehouse; or 2) a single forward warehouse and the upstream regional warehouse corresponding to the forward warehouse. The network is shown in Figures 4b-4c. The ultimate optimization goal of the model is to determine the forward warehouse upgrade plan that minimizes the overall cost of the network, and the coverage relationship between regional warehouses and forward warehouses.

[0045] Generate all the possibilities of upgrading the number of warehouses, that is, upgrading from upgrading a single warehouse to upgrading all forward warehouses. Figure 4c is a network structure diagram for upgrading a forward warehouse to a regional warehouse. There are 4 forward warehouses in the figure, and one of them can be upgraded, so there are 4 ways to upgrade the warehouse. You can also upgrade 2 forward warehouses, and choose any 2 combinations, corresponding to There are also plans to increase the position. There are plans to upgrade warehouses and plans to upgrade all forward warehouses.

[0046] After the forward warehouse is upgraded to a regional warehouse, the coverage relationship also changes. Suppliers can still deliver goods directly to the regional warehouse, and the regional warehouse can deliver goods directly to customers (i.e., fulfillment). The regional warehouse can also deliver goods to other forward warehouses (i.e., internal distribution).

[0047] The calculations in this disclosure only consider a single supplier. The network considers an abstract commodity aggregated from all product categories. The weight, volume, and other data for this commodity are the averages of the aggregated SKUs within that category. Therefore, the upgrade solutions for different product categories should be different.

[0048] Step 203: Establish an optimization model with the goal of minimizing the total network cost based on the network structure information and cost information.

[0049] In this embodiment, a warehouse network upgrade model that considers the impact of the supplier's warehouse delivery quantity is established as follows:

[0050] gather

[0051] parameter

[0052] Decision variables

[0053] Model:

[0054] Among them, ∑ i∈I ∑ j∈J y ij *d ij It represents the transportation cost from the supplier to the regional warehouse in the original network,

[0055] ∑ j∈J ∑ k∈K y jk *d jk *(1-x k ) represents the cost of delivering from the regional warehouse to the forward warehouse. (After the forward warehouse k is upgraded, x k =1, this item is 0, which means that the original regional warehouse will not distribute goods to the forward warehouse that has been upgraded to become a regional warehouse (because both are regional warehouses).

[0056] ∑ l∈L ∑ p∈P ∑ j∈J y jlp *d jlp *z jl Indicates the transportation cost from the regional warehouse to the customer,

[0057] ∑ k∈K ∑ p∈P ∑ l∈L y klp *d klp Indicates the transportation cost from the forward warehouse to the customer,

[0058] ∑ i∈I ∑ k∈K y ik d ik x k represents the transportation cost of the supplier to the upgraded regional warehouse. After the current warehouse k is upgraded, x k =1, this cost exists.

[0059] ∑ k′∈K ∑ k∈K y kk′ d kk′ x k It represents the transportation cost from the upgraded forward warehouse (regional warehouse after upgrade) to the remaining forward warehouses.

[0060] ∑ j∈J ∑ i∈I y ij *d j Indicates the original regional warehouse rental cost,

[0061] ∑ k∈K ∑ j∈J y jk *d k* (1-x k ) represents the forward warehouse rental cost corresponding to the portion of goods distributed from the original regional warehouse to the non-upgraded forward warehouse.

[0062] ∑ k∈K ∑ k′∈K y kk′ *d k *x k It represents the forward warehouse rental cost corresponding to the portion of goods distributed from the upgraded forward warehouse (new regional warehouse) to the non-upgraded forward warehouse.

[0063] ∑ l∈L ∑ p∈P ∑ k∈K y ik *d k *x k Indicates the rental cost of the upgraded forward warehouse (new regional warehouse).

[0064] Step 204: Solve the optimization model under each warehouse upgrade quantity to obtain a warehouse upgrade plan under each warehouse upgrade quantity.

[0065] In this embodiment, the optimization model's constraints include at least one of the following: the number of upgrade warehouses, network coverage, customer demand, time-sensitive order volume, and node traffic balance. Solving the optimization model to satisfy the constraints and the objective function yields an upgrade plan that satisfies the objective function for each upgrade quantity. This upgrade plan includes the decision variables listed in the table above.

[0066] The model's objective function consists of two main components: one is the network's costs, primarily the supplier's delivery costs, the internal distribution costs of regional warehouses distributing goods to forward warehouses, and the costs of fulfilling contracts from regional warehouses and forward warehouses to customers; the other is the network's warehouse rental costs, which are primarily affected by the traffic flow of each warehouse. The constraints of the optimization model may include at least one of the following: Constraint 1 of the model primarily includes the total number of regional warehouses after the upgrade. In this calculation method, the number of upgraded warehouses is solved in parallel from 1 to the total number of forward warehouses, N, corresponding to N optimization problems. Constraint 2 restricts a forward warehouse from being upgraded to covering other forward warehouses and being delivered by suppliers. Constraint 3 is based on business requirements. Customer nodes can only be covered by a certain forward warehouse and the regional warehouse allocated to the forward warehouse. Constraint 4 ensures that all customer node requirements are met. Constraint 5 is all time-related constraints, which are divided into three cases. First, after the forward warehouse that originally covered the customer node is upgraded to a regional warehouse, the waybill from the regional warehouse to the customer node in the original network will be split according to the original time ratio from the forward warehouse to the customer node. After the upgrade, the customer node will only be covered by the upgraded forward warehouse. Second, for the customer node, the forward warehouse has not changed before and after the upgrade. At this time, for the customer node, There are no changes to the network structure before and after the upgrade, so the ratio of orders with different delivery times can be based on the network conditions before the upgrade. Third, if the corresponding forward warehouse has not been upgraded, but the regional warehouse covering the forward warehouse is a newly upgraded regional warehouse, since the original network lacks relevant data from the new regional warehouse to the customer node, the delivery time ratio of this section of the route is uniformly set to 72 hours. Considering the worst case scenario, to ensure that the overall delivery time ratio meets the requirements after the upgrade, in this case, all orders from the original regional warehouse to the customer node in the original network are converted to 72 hours and fulfilled by the new regional warehouse. Constraint 6 ensures that the total number of orders fulfilled by regional warehouses remains unchanged before and after the network upgrade, and constraint 7 ensures that the ratio of delivery time ratios fulfilled by forward warehouses remains unchanged before and after the upgrade. Constraint 8 ensures that there is only one regional warehouse upstream of each forward warehouse, and constraint 9 ensures that there is only one regional warehouse upstream of each customer node. Constraint 10 ensures traffic balance among warehouse nodes. Constraint 11 ensures the relationship between route order volume and route connectivity.

[0067] The impact of warehouse upgrade quantity on supplier delivery cost is mainly reflected in the parameter d in the objective function. ij and d ik In the calculation of the supplier's delivery cost, the more warehouses are upgraded, the lower the vehicle loading rate is. ij and d ik By solving this model, we can obtain the optimal warehouse upgrade plan that minimizes network cost when the number of warehouse upgrades is α, and the new coverage relationship between regional warehouses and forward warehouses under this warehouse upgrade plan.

[0068] Step 205: Output the warehouse upgrade plan with the lowest total network cost.

[0069] In this embodiment, the cost of the storage upgrade plan obtained under each storage upgrade quantity is also different. The optimal storage upgrade plans under each storage upgrade quantity are compared, and the plan with the lowest cost is output, which is the plan with the lowest global cost.

[0070] This paper, based on specific business needs, aims to minimize the total cost of the upgraded network and requires that the ratio of orders with optimal fulfillment time to total orders meet a lower limit. It proposes a warehouse network upgrade calculation method that considers the impact of the number of supplier warehouse deliveries. This method traverses the possible upgrade numbers of different forward warehouses, establishes an operations research model, and optimizes the optimal upgrade and coverage solutions for each number of upgraded warehouses. It also considers the impact of the increased number of regional warehouses caused by the upgrade on supplier delivery costs, ultimately achieving the globally optimal warehouse network upgrade solution.

[0071] In some optional implementations of this embodiment, the method further includes: calculating the average cost of the upgrade plan under each upgrade quantity; and outputting the upgrade quantity with the lowest average cost.

[0072] In order to speed up the calculation, only the average cost of a predetermined number of upgrade plans can be calculated. For example, if there are 32 upgrade plans, only the average cost of the 10 upgrade plans with the lowest cost can be calculated.

[0073] The following shows the actual calculation results of a warehouse upgrade plan for a certain region. The region originally had one regional warehouse and eight forward warehouses, so the number of candidate upgrade warehouses ranged from 1 to 8. The final model solution showed that upgrading two warehouses, meaning a total of three regional warehouses and six forward warehouses in the network, would achieve the lowest cost. Based on the top 10 optimal solutions, upgrading three warehouses, meaning a total of four regional warehouses and five forward warehouses in the network, had the best average cost.

[0074] Therefore, when it is not possible to increase the position at the lowest cost, you can choose the increase quantity with the lowest average cost. You can choose any increase plan that is convenient for layout under this increase quantity.

[0075] In some optional implementations of this embodiment, the total transportation cost includes the internal transportation cost between the regional warehouse node and the forward warehouse node and the fulfillment transportation cost between the forward warehouse node and the customer node; and the method also includes: calculating the proportion of the internal transportation cost of each warehouse upgrade plan to the total transportation cost; and outputting the warehouse upgrade plan with the lowest proportion.

[0076] The warehouse upgrade reduces the network's overall transportation costs, specifically the proportion of internal delivery costs to total transportation costs. This is because the upgrade increases the number of regional warehouses, shortening the average distance from forward warehouses and the average distance from regional warehouses to customer nodes for fulfillment, significantly reducing overall transportation costs. Furthermore, due to the shortened average distance, the proportion of orders with a 24-hour delivery timeliness rating can increase from approximately 63% to approximately 71% after the upgrade, improving the network's overall service level.

[0077] In some optional implementations of this embodiment, the total network cost includes the total transportation cost; and the optimization model established based on the network structure information and the cost information with the goal of minimizing the total network cost includes: obtaining a first unit transportation cost set from the supplier node to each regional warehouse node, a second unit transportation cost set from each regional warehouse node to each forward warehouse node, and a third unit transportation cost set from each forward warehouse node to each customer node; taking the forward warehouse node to be upgraded, the coverage relationship between each node, and the number of waybills between each node as decision variables; calculating the total transportation cost as the target of the optimization model based on the first unit transportation cost set, the second unit transportation cost set, the third unit transportation cost set and the decision variables.

[0078] As shown in the table above, the first unit transportation cost is d ij , the second unit transportation cost is d jk , the third unit transportation cost is d klp and d jlp These transportation costs can be calculated using historical data.

[0079] The forward warehouse node to be upgraded is x k , the coverage relationship between each node is z ij 、z jk 、z jl , the number of waybills between each node is y ij 、y jk 、y jlp 、y klp .

[0080] The objective function is: min∑ i∈I ∑ j∈J y ij *d ij +∑ j∈J ∑ k∈K y jk *d jk* (1-x k ) +∑ l∈L ∑ p∈P ∑ j∈J y jlp *djlp *z jl +∑ k∈K ∑ p∈P ∑ l∈L y klp *d klp +∑ i∈I ∑ k∈K y ik d ik x k +∑ k′∈K ∑ k∈K y kk′ d kk′ x k

[0081] In some optional implementations of this embodiment, the total network cost includes the total warehouse rental cost; and the optimization model established based on the network structure information and the cost information with the goal of minimizing the total network cost includes: obtaining the first rent corresponding to the unit waybill of each regional warehouse node and the second rent corresponding to the unit waybill of each forward warehouse node; taking the forward warehouse nodes to be upgraded, the coverage relationship between each node, and the number of waybills between each node as decision variables; calculating the total warehouse rental cost as the target of the optimization model based on the first rent, the second rent and the decision variables.

[0082] Another cost data is the warehouse rental-related cost, which is related to the actual flow of the warehouse. According to the number of waybills, if the average number of pieces per order is calculated to be 2, the average daily number of pieces shipped out of each warehouse can be calculated. The warehouse inventory level can be calculated as the outbound quantity * (safety stock days + replenishment days / 2). Combined with the actual volume of the goods, the actual volume of the required warehouse can be obtained. The floor efficiency data of warehouses in different regions is converted into the area data of the required warehouse, and finally the required warehouse area is obtained, which is finally converted into the actual warehouse rental cost based on the unit rent.

[0083] The first rent d in the table above can be calculated using the above method j and the second rent d k .

[0084] The objective function is: min∑ j∈J ∑ i∈I y ij *d j +∑ k∈K ∑ j∈J y jk *dk * (1-x k ) +∑ k∈K ∑ k′∈K y kk′ *d k *x k +∑ l∈L ∑p∈P ∑ k∈K y ik *d k *x k

[0085] In some optional implementations of this embodiment, the total network cost includes the total transportation cost and the total warehouse rental cost; and the optimization model established based on the network structure information and the cost information with the goal of minimizing the total network cost includes: obtaining a first unit transportation cost set from the supplier node to each regional warehouse node, a second unit transportation cost set from each regional warehouse node to each forward warehouse node, and a third unit transportation cost set from each forward warehouse node to each customer node; obtaining the first rent corresponding to the unit waybill of each regional warehouse node and the second rent corresponding to the unit waybill of each forward warehouse node; taking the forward warehouse node to be upgraded, the coverage relationship between each node, and the number of waybills between each node as decision variables; calculating the total warehouse rental cost based on the first rent, the second rent and the decision variables; calculating the total transportation cost based on the first unit transportation cost set, the second unit transportation cost set, the third unit transportation cost set and the decision variables; calculating the total network cost based on the total transportation cost and the total warehouse rental cost as the goal of the optimization model.

[0086] The objective function is the sum of the two aforementioned objective functions. Increasing the number of upgraded warehouses shortens the average internal delivery distance between regional warehouses and forward warehouses, as well as the average delivery distance between regional warehouses and customer nodes when the current warehouses cannot meet demand, thereby reducing transportation costs and improving delivery times. However, this increase in the number of upgraded warehouses also increases rental costs for upgraded warehouses and the average delivery distance for suppliers, making delivery more difficult. As more regional warehouses are upgraded, supplier deliveries become more dispersed, and vehicle loading rates gradually decrease.

[0087] In some optional implementations of this embodiment, the method further includes: calculating the detour coefficient and number of transfers for each section of the route based on historical data; and adjusting the total transportation cost based on the detour coefficient and number of transfers for each section of the route. The cost items considered mainly include two items, one of which is the cost related to transportation. Considering process sorting and vehicle detours, the calculation method of this cost is as follows: adjusted transportation cost = average transportation cost per unit * detour coefficient + sorting cost * number of transfers, where the detour coefficient and number of transfers for each section of the route are calculated based on historical data. For routes that have not been opened, the average is taken according to similar routes. The number of transfers for delivery and internal distribution is both 0, and the detour coefficient is both 1; for the fulfillment link, the number of transfers reflects the actual cost of sorting in the link, and the detour coefficient is used to compensate for the difference between the theoretical average transportation cost per unit and the actual cost based on actual data.

[0088] In some optional implementations of this embodiment, the number of waybills between nodes in the decision variable includes the number of waybills from each supplier node to each regional warehouse node, the number of waybills from each regional warehouse node to each forward warehouse node, the number of waybills with different time limits from each regional warehouse node to each customer node, and the number of waybills with different time limits from each forward warehouse node to each customer node. Time limit refers to the maximum delivery time, such as 24 hours or 48 hours.

[0089] In some optional implementations of this embodiment, the method further includes adjusting the total transportation cost based on a coefficient for different delivery times. For the fulfillment phase, the difference in cost associated with different delivery time orders is calculated by multiplying the adjusted transportation cost by a fixed coefficient, e.g., a coefficient of 1.3 for a 24-hour delivery time order and a coefficient of 1.1 for a 48-hour delivery time order. This allows for a correction of transportation costs, such that shorter delivery times result in higher transportation costs.

[0090] The logistics network upgrade method and device provided by the embodiments of the present disclosure regard the additional costs brought about by upgrading warehouses as sunk costs and do not introduce them into the calculation of the total cost of the model network. Instead, the impact of upgrading the number of forward warehouses on suppliers is considered. Specifically, by considering different numbers of regional warehouses, the loading rate of supplier delivery vehicles decreases as the number of regional warehouses increases, thereby reflecting the impact of different solutions on the overall cost of the supply chain network. Due to the increase in regional warehouses, the supplier's delivery needs are more dispersed, the delivery difficulty increases, and the scale effect decreases. The actual data analysis on the business side shows the decrease in the actual vehicle loading rate brought about by the increase in the number of warehouses. On the other hand, the cost increased due to the reduction in loading rate can also be regarded as economic compensation for the potential cost increase of suppliers after adding regional warehouses, so as to improve suppliers' acceptance of network upgrade solutions.

[0091] Continuing with Figure 3, Figure 3 is a schematic diagram of an application scenario for the logistics network upgrade method according to this embodiment. In the application scenario of Figure 3, data input is first performed. This process reads information about each node in the current network, such as the number of nodes at each layer, the inbound and outbound costs of warehouse nodes, the number of demand orders at demand nodes, and other information related to routes, such as route length and unit transportation cost. Secondly, all possible upgrade quantities are generated, corresponding to upgrading a single warehouse to upgrading all forward warehouses. An optimization model is established to solve the optimal solution for each upgrade quantity. The model aims to minimize the total network cost and considers constraints such as the number of network upgrade warehouses, network coverage constraints, customer demand constraints, time-sensitive order volume ratio constraints, and node traffic balance constraints. The reason for adopting a traversal solution is that adding the upgrade quantity as a variable in the model would make the model more complex and slow down the solution. At the same time, the solutions for different upgrade quantities are independent of each other and can be run in parallel. For each upgrade quantity possibility, the model solves quickly. Finally, the optimal costs for each upgrade quantity are compared, and the solution with the lowest cost is output, which is the solution with the lowest global cost.

[0092] Further referring to FIG5 , as an implementation of the methods shown in the above figures, the present disclosure provides an embodiment of a logistics network upgrading device. The device embodiment corresponds to the method embodiment shown in FIG2 , and the device can be specifically applied to various electronic devices.

[0093] As shown in FIG5 , the logistics network upgrading apparatus 500 of this embodiment includes: an acquisition unit 501, a generation unit 502, an establishment unit 503, a solution unit 504, and an output unit 505. The acquisition unit 501 is configured to acquire network structure information and cost information of the logistics network, wherein the logistics network includes supplier nodes, regional warehouse nodes, forward warehouse nodes, and customer nodes; the generation unit 502 is configured to generate various upgrade plans for forward warehouse nodes to regional warehouse nodes; the establishment unit 503 is configured to establish an optimization model with the goal of minimizing the total network cost based on the network structure information and the cost information; the solution unit 504 is configured to solve the optimization model under various upgrade quantities to obtain upgrade plans under various upgrade quantities, wherein the constraints of the optimization model include at least one of the following: upgrade quantity constraint, network coverage constraint, customer demand constraint, time-sensitive order ratio constraint, and node traffic balance constraint; and the output unit 505 is configured to output the upgrade plan with the lowest total network cost.

[0094] In some optional implementations of this embodiment, the output unit 505 is further configured to: calculate the average cost of the upgrade plan under each upgrade quantity; and output the upgrade quantity with the lowest average cost.

[0095] In some optional implementations of this embodiment, the total network cost includes the total transportation cost; and the establishment unit 503 is further configured to: obtain a first unit transportation cost set from the supplier node to each regional warehouse node, a second unit transportation cost set from each regional warehouse node to each forward warehouse node, and a third unit transportation cost set from each forward warehouse node to each customer node; use the forward warehouse node to be upgraded, the coverage relationship between each node, and the number of waybills between each node as decision variables; calculate the total transportation cost as the target of the optimization model based on the first unit transportation cost set, the second unit transportation cost set, the third unit transportation cost set and the decision variables.

[0096] In some optional implementations of this embodiment, the total network cost includes the total warehouse rental cost; and the establishment unit 503 is further configured to: obtain the first rent corresponding to the unit waybill of each regional warehouse node and the second rent corresponding to the unit waybill of each forward warehouse node; use the forward warehouse nodes to be upgraded, the coverage relationship between each node, and the number of waybills between each node as decision variables; calculate the total warehouse rental cost as the target of the optimization model based on the first rent, the second rent and the decision variables.

[0097] In some optional implementations of this embodiment, the total network cost includes the total transportation cost and the total warehouse rental cost; and the establishment unit 503 is further configured to: obtain a first unit transportation cost set from the supplier node to each regional warehouse node, a second unit transportation cost set from each regional warehouse node to each forward warehouse node, and a third unit transportation cost set from each forward warehouse node to each customer node; obtain the first rent corresponding to the unit waybill of each regional warehouse node and the second rent corresponding to the unit waybill of each forward warehouse node; use the forward warehouse node to be upgraded, the coverage relationship between each node, and the number of waybills between each node as decision variables; calculate the total warehouse rental cost based on the first rent, the second rent and the decision variables; calculate the total transportation cost based on the first unit transportation cost set, the second unit transportation cost set, the third unit transportation cost set and the decision variables; calculate the total network cost based on the total transportation cost and the total warehouse rental cost as the target of the optimization model.

[0098] In some optional implementations of this embodiment, the solving unit 504 is further configured to: calculate the detour coefficient and the number of transfers for each route segment based on historical data; and adjust the total transportation cost based on the detour coefficient and the number of transfers for each route segment.

[0099] In some optional implementations of this embodiment, the number of waybills between each node in the decision variable includes the number of waybills from each supplier node to each regional warehouse node, the number of waybills from each regional warehouse node to each forward warehouse node, the number of waybills of different time periods from each regional warehouse node to each customer node, and the number of waybills of different time periods from each forward warehouse node to each customer node.

[0100] In some optional implementations of this embodiment, the solving unit 504 is further configured to adjust the total transportation cost according to waybill coefficients of different time limits.

[0101] In some optional implementations of this embodiment, the total transportation cost includes the internal distribution transportation cost between the regional warehouse node and the forward warehouse node and the fulfillment transportation cost between the forward warehouse node and the customer node; and the output unit 505 is further configured to: calculate the proportion of the internal distribution transportation cost of each warehouse upgrade plan to the total transportation cost; and output the warehouse upgrade plan with the lowest proportion.

[0102] It should be noted that the collection, collection, updating, analysis, processing, use, transmission, and storage of user personal information involved in the technical solutions disclosed herein all comply with relevant laws and regulations, are used for legitimate purposes, and do not violate public order and good morals. Necessary measures are taken with respect to user personal information to prevent unauthorized access to user personal information data and to safeguard the security of user personal information, network security, and national security.

[0103] According to an embodiment of the present disclosure, the present disclosure further provides an electronic device and a readable storage medium.

[0104] An electronic device comprises: one or more processors; a storage device storing one or more computer programs, wherein when the one or more computer programs are executed by the one or more processors, the one or more processors implement the method described in process 200.

[0105] A computer-readable medium stores a computer program thereon, wherein the computer program implements the method described in process 200 when executed by a processor.

[0106] FIG6 shows a schematic block diagram of an example electronic device 600 that can be used to implement an embodiment of the present disclosure. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital assistants, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.

[0107] As shown in Figure 6, device 600 includes a computing unit 601, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 602 or a computer program loaded from a storage unit 608 into a random access memory (RAM) 603. Various programs and data required for the operation of device 600 can also be stored in RAM 603. Computing unit 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to bus 604.

[0108] Various components in device 600 are connected to I / O interface 605, including an input unit 606, such as a keyboard, mouse, etc.; an output unit 607, such as various types of displays, speakers, etc.; a storage unit 608, such as a magnetic disk, optical disk, etc.; and a communication unit 609, such as a network card, modem, wireless communication transceiver, etc. The communication unit 609 allows device 600 to exchange information / data with other devices via a computer network such as the Internet and / or various telecommunication networks.

[0109] The computing unit 601 can be any general-purpose and / or specialized processing component with processing and computing capabilities. Some examples of the computing unit 601 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various specialized artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 601 performs the various methods and processes described above, such as the logistics network upgrade method. For example, in some embodiments, the logistics network upgrade method can be implemented as a computer software program tangibly embodied in a machine-readable medium, such as the storage unit 608. In some embodiments, part or all of the computer program can be loaded and / or installed onto the device 600 via the ROM 602 and / or the communication unit 609. When the computer program is loaded into the RAM 603 and executed by the computing unit 601, one or more steps of the logistics network upgrade method described above can be performed. Alternatively, in other embodiments, the computing unit 601 can be configured to perform the logistics network upgrade method by any other suitable means (e.g., via firmware).

[0110] Various embodiments of the systems and techniques described herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), system-on-chip systems (SOCs), programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments can include being implemented in one or more computer programs that are executable and / or interpreted on a programmable system that includes at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0111] The program code for implementing the method of the present disclosure can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device so that when the program code is executed by the processor or controller, the functions / operations specified in the flow chart and / or block diagram are implemented. The program code can be executed entirely on the machine, partially on the machine, as a stand-alone software package, partially on the machine and partially on a remote machine, or entirely on a remote machine or server.

[0112] In the context of the present disclosure, a machine-readable medium can be a tangible medium that can contain or store a program for use by or in conjunction with an instruction execution system, device or equipment. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium can include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0113] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0114] The systems and techniques described herein can be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network (LAN), a wide area network (WAN), and the Internet.

[0115] A computer system may include a client and a server. The client and server are generally remote from each other and typically interact via a communication network. The client-server relationship arises through computer programs running on the respective computers and having a client-server relationship with each other. The server may be a server in a distributed system or a server integrated with blockchain. The server may also be a cloud server, or an intelligent cloud computing server or intelligent cloud host with artificial intelligence technology. The server may be a server in a distributed system or a server integrated with blockchain. The server may also be a cloud server, or an intelligent cloud computing server or intelligent cloud host with artificial intelligence technology.

[0116] It should be understood that the various forms of the processes shown above can be used to reorder, add, or delete steps. For example, the steps described in this disclosure can be performed in parallel, sequentially, or in a different order, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved. This is not a limitation herein.

[0117] The above specific embodiments do not constitute a limitation on the scope of protection of this disclosure. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions may be made based on design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this disclosure shall be included within the scope of protection of this disclosure.

Claims

1. A logistics network upgrade method, include: Obtaining network structure information and cost information of a logistics network, wherein the logistics network includes supplier nodes, regional warehouse nodes, forward warehouse nodes, and customer nodes; Generate various warehouse upgrading plans for upgrading forward warehouse nodes to regional warehouse nodes; Establishing an optimization model with the goal of minimizing the total network cost according to the network structure information and the cost information; Solving the optimization model under each warehouse upgrade quantity to obtain a warehouse upgrade plan under each warehouse upgrade quantity, wherein the constraints of the optimization model include at least one of the following: upgrade warehouse quantity constraint, network coverage relationship constraint, customer demand constraint, time-sensitive order quantity ratio constraint, and node traffic balance constraint; and Output the warehouse expansion plan with the lowest total network cost.

2. The method according to claim 1, in, The method further comprises: Calculate the average cost of the upgrade plan for each upgrade amount; and Output the number of positions that have the lowest average cost.

3. The method according to claim 1, in, The total network cost includes the total transportation cost; as well as The establishing of an optimization model with the goal of minimizing the total network cost according to the network structure information and the cost information includes: Obtain the first unit transportation cost set from the supplier node to each regional warehouse node, the second unit transportation cost set from each regional warehouse node to each forward warehouse node, and the third unit transportation cost set from each forward warehouse node to each customer node; The forward warehouse nodes to be upgraded, the coverage relationship between the nodes, and the number of waybills between the nodes are used as decision variables; and According to the first unit transportation cost set, the second unit transportation cost set, the The three-unit transportation cost set and the decision variables are used to calculate the total transportation cost as the objective of the optimization model.

4. The method according to claim 1, in, The total network cost includes the total warehouse rental cost; as well as The establishing of an optimization model with the goal of minimizing the total network cost according to the network structure information and the cost information includes: Obtain the first rent corresponding to the unit waybill of each regional warehouse node and the second rent corresponding to the unit waybill of each forward warehouse node; The forward warehouse nodes to be upgraded, the coverage relationship between the nodes, and the number of waybills between the nodes are used as decision variables; and The total warehouse rental cost is calculated according to the first rent, the second rent and the decision variables as the target of the optimization model.

5. The method according to claim 1, in, The total network cost includes total transportation cost and total warehouse rental cost; as well as The establishing of an optimization model with the goal of minimizing the total network cost according to the network structure information and the cost information includes: Obtain the first unit transportation cost set from the supplier node to each regional warehouse node, the second unit transportation cost set from each regional warehouse node to each forward warehouse node, and the third unit transportation cost set from each forward warehouse node to each customer node; Obtain the first rent corresponding to the unit waybill of each regional warehouse node and the second rent corresponding to the unit waybill of each forward warehouse node; The forward warehouse nodes to be upgraded, the coverage relationship between the nodes, and the number of waybills between the nodes are used as decision variables; Calculate the total warehouse rental cost according to the first rent, the second rent and the decision variables; According to the first unit transportation cost set, the second unit transportation cost set, the Calculate the total transportation cost from the three-unit transportation cost set and the decision variables; and The total network cost is calculated based on the total transportation cost and the total warehouse rental cost as the target of the optimization model.

6. The method according to claim 3 or 5, in, The method further comprises: Calculate detour factors and number of transfers for each route segment based on historical data; and The total transportation cost is adjusted according to the detour factor and the number of transfers for each route segment.

7. The method according to claim 3 or 5, in, The number of waybills between each node in the decision variables includes the number of waybills from each supplier node to each regional warehouse node, the number of waybills from each regional warehouse node to each forward warehouse node, the number of waybills of different time periods from each regional warehouse node to each customer node, and the number of waybills of different time periods from each forward warehouse node to each customer node.

8. The method according to claim 7, in, The method further comprises: The total transportation cost is adjusted according to the waybill coefficients with different time limits.

9. The method according to claim 3 or 5, in, The total transportation cost includes the internal transportation cost between the regional warehouse node and the forward warehouse node and the fulfillment transportation cost between the forward warehouse node and the customer node; as well as The method further comprises: Calculate the proportion of internal transportation cost to total transportation cost for each warehouse upgrade plan; as well as Output the warehouse expansion plan with the lowest ratio.

10. A logistics network upgrading device, include: An acquisition unit is configured to acquire network structure information and cost information of a logistics network, wherein the logistics network includes supplier nodes, regional warehouse nodes, forward warehouse nodes, and customer nodes; A generating unit, configured to generate various warehouse upgrading schemes for upgrading a forward warehouse node to a regional warehouse node; An establishing unit configured to establish an optimization model with the goal of minimizing the total network cost according to the network structure information and the cost information; A solving unit is configured to solve the optimization model under each warehouse upgrade quantity to obtain a warehouse upgrade plan under each warehouse upgrade quantity, wherein the constraints of the optimization model include at least one of the following: upgrade warehouse quantity constraint, network coverage relationship constraint, customer demand constraint, time-sensitive order quantity ratio constraint, and node traffic balance constraint; and The output unit is configured to output the warehouse expansion plan with the lowest total cost of the network.

11. A computer readable medium having a computer program stored thereon, in, When the computer program is executed by a processor, the method according to any one of claims 1 to 9 is implemented.

Citation Information

Patent Citations

  • E-commerce logistics transfer optimization method and system under background of network freight platform

    CN112990590A

  • Warehousing network planning method and device

    CN113259144A

  • Logistics network planning method and device

    CN113673932A

  • Warehousing and distribution network optimization method and device, storage medium and program product

    CN114676875A

  • Supply chain network optimization method and device, computer equipment and storage medium

    CN115456492A

Cited By

  • Warehousing resource quantity scale optimization method and device

    CN120806257A

  • Plate production order management system based on edge sealing and drilling

    CN121707683A