CN114118888A

CN114118888A - Order ex-warehouse method and device

Info

Publication number: CN114118888A
Application number: CN202110015001.3A
Authority: CN
Inventors: 柯恒
Original assignee: Beijing Jingdong Zhenshi Information Technology Co Ltd
Current assignee: Beijing Jingdong Zhenshi Information Technology Co Ltd
Priority date: 2021-01-06
Filing date: 2021-01-06
Publication date: 2022-03-01

Abstract

The invention discloses a method and a device for order delivery, and relates to the field of intelligent logistics. One embodiment of the method comprises: receiving a user order, determining item information in the order and a warehouse set corresponding to the order, wherein each warehouse in the warehouse set stores at least one item in the order; executing an order ex-warehouse strategy to determine ex-warehouse information corresponding to the order according to the article information in the order, the priority of each warehouse in the warehouse set and the order ex-warehouse configuration information, wherein the order ex-warehouse strategy consists of a plurality of sub-strategies with different priorities; and sending the ex-warehouse information for the ex-warehouse to carry out ex-warehouse operation on the order. According to the embodiment, the order delivery strategy consisting of the sub-strategies with different priorities can meet the order delivery requirements in different scenes, the failure probability of order delivery is reduced, the logistics distribution efficiency and the logistics distribution time efficiency are improved, and the distribution cost is reduced.

Description

Order ex-warehouse method and device

Technical Field

The invention relates to the field of intelligent logistics, in particular to a method and a device for order delivery.

Background

The order source finding means that the items purchased by the customer are issued to one or more warehouses for warehouse-out according to the inventory of each item in the warehouses. In the current order source finding, for self-service orders of an e-commerce platform, when a customer places an order, the customer preferably inquires inventory in a Front Distribution Center (FDC) warehouse, and if the customer can not meet the requirement, the customer inquires inventory in a Regional Distribution Center (RDC) warehouse. If yes, the order is sent to the corresponding warehouse, otherwise, the order fails to be sent, and the same article (also called SKU, short for Stock Keeping Unit, each article corresponds to a unique SKU number) is taken out from 1 warehouse at most. For non-self-operation orders, national warehouse information needs to be maintained firstly, then warehouses which can be used for warehouse-out and warehouse priorities are configured according to addresses, warehouse warehouses are selected from high to low according to the warehouse priorities until order requirements are met, and if the order requirements cannot be met finally, failure occurs.

The prior art has at least the following problems: for the platform self-operation orders, cross-area delivery is not supported, and the customer orders can be completed only when transfer is carried out among warehouses or when replenishment is obtained in a stock shortage warehouse; and also does not support the completion of the delivery of an item from multiple warehouses. For non-self-operation orders, the orders are sequentially delivered out of the warehouse according to the priority to meet the order, so that the orders are largely split into more warehouses, and the cost of the warehouses in the processes of picking, packaging and logistics distribution is increased. Meanwhile, no matter the self-service or non-self-service order source searching mode is adopted, the shortage quantity ex-warehouse is not supported, and for orders with large quantity of articles, the probability of ex-warehouse failure is increased, and loss is brought.

Disclosure of Invention

In view of this, embodiments of the present invention provide a method and an apparatus for order ex-warehouse, which can effectively reduce the failure probability of order ex-warehouse, improve the logistics distribution efficiency and timeliness, and reduce the distribution cost.

To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided an order warehouse exit method, including:

receiving a user order, determining item information in the order and a warehouse set corresponding to the order, wherein each warehouse in the warehouse set stores at least one item in the order;

executing an order warehouse-out strategy to determine warehouse-out information corresponding to the order according to the article information in the order, the priority of each warehouse in the warehouse set and the order warehouse-out configuration information; the order ex-warehouse strategy consists of a plurality of sub-strategies with different priorities;

and sending the ex-warehouse information for the ex-warehouse to carry out ex-warehouse operation on the order.

Preferably, the order ex-warehouse configuration information includes: the maximum number of warehouse-out.

Preferably, the determining, by the executed order warehouse-out policy, warehouse-out information corresponding to the order includes:

determining whether the total inventory of the order items of the warehouse set meets the order requirement, if so, executing a first order delivery strategy; if not, the order fails to be taken out of the warehouse;

wherein the first order ex-warehouse policy comprises: the system comprises a first sub-strategy with the least warehouse-out quantity and a second sub-strategy with the highest warehouse-out priority, wherein the first sub-strategy is higher in priority than the second sub-strategy.

Preferably, the order ex-warehouse configuration information includes: the shortage quantity is taken out of the warehouse;

if the total inventory of the order items in the warehouse set does not meet the order requirement, further determining whether the order supports the shortage quantity ex-warehouse according to the shortage quantity ex-warehouse identification before determining that the order ex-warehouse fails, and if so, executing a second order ex-warehouse strategy; if not, the order fails to be taken out of the warehouse;

wherein the second order ex-warehouse policy comprises: the first sub-strategy with the least warehouse-out quantity, the second sub-strategy with the highest priority of the warehouse-out quantity and the third sub-strategy with the maximum total warehouse-out commodity quantity are adopted, the priority of the third sub-strategy is higher than that of the first sub-strategy, and the priority of the first sub-strategy is higher than that of the second sub-strategy.

Preferably, the first and second order delivery strategies are implemented based on an optimization model, and an objective function of the optimization model is established according to priorities of different sub-strategies.

Preferably, the optimization model is a constrained integer programming model;

the executing the order warehouse-out strategy to determine warehouse-out information corresponding to the order comprises the following steps:

determining an objective function according to the priorities of different sub-strategies in the order ex-warehouse strategy;

and solving the integer programming model according to the constraint conditions, and calculating warehouse-out information corresponding to the order.

Preferably, the constraint condition includes: the selected ex-warehouse quantity is not more than the maximum ex-warehouse quantity;

before the integer planning model is solved, the minimum value of the corresponding number of the single-item ex-warehouse when at least one order item is taken out separately is determined, and the maximum value of all the minimum values of the number of the single-item ex-warehouse is selected as the minimum value of the number of the ex-warehouse selected when the integer planning model is solved.

Preferably, the constraint condition includes: the selected warehouse quantity is not more than the maximum ex-warehouse quantity;

before solving the integer programming model, determining the maximum value of the selected warehouse quantity through a heuristic algorithm.

Preferably, the heuristic algorithm comprises:

step 1: determining the ex-warehouse demand of each item in the order;

step 2: calculating the total number of the warehouse which is not selected in the warehouse set and can meet the warehouse-out demand of each article in the order;

and step 3: selecting a warehouse which can meet the maximum total number as a warehouse-out warehouse, and updating the warehouse-out demand of each article in the order;

and 4, step 4: if the quantity of the currently selected warehouse is larger than or equal to the maximum ex-warehouse quantity or the ex-warehouse demand of each article in the order is zero, executing the step 5, otherwise, returning to the step 2 to continue executing;

and 5: and taking the selected warehouse quantity as the maximum value of the selected warehouse quantity when the integer programming model is solved.

Preferably, when the second order warehouse-out strategy is executed, the warehouse-out warehouse which is inevitably selected is determined according to the inventory information corresponding to the shortage objects based on the principle that all the shortage objects in the order are warehouse-out, and then the integer planning model is solved to calculate the warehouse-out warehouse information corresponding to the order.

Preferably, the priority of each warehouse in the warehouse set is determined based on the order delivery address and the location information of each warehouse in the warehouse set.

In a second aspect, an embodiment of the present invention provides an order delivery apparatus, including:

the order receiving module is used for receiving a user order, determining article information in the order and a warehouse set corresponding to the order, wherein each warehouse in the warehouse set stores at least one article in the order;

the execution module is used for executing an order warehouse-out strategy to determine warehouse-out information corresponding to the order according to the article information in the order, the priority of each warehouse in the warehouse set and the order warehouse-out configuration information; the order ex-warehouse strategy consists of a plurality of sub-strategies with different priorities;

and the sending module is used for sending the warehouse-out information determined by the execution module.

Preferably, the execution module further comprises:

the first execution sub-module is used for determining whether the total inventory of the order items of the warehouse set meets the order requirement, if so, executing a first order delivery strategy; if not, the order fails to be taken out of the warehouse;

the execution module further comprises: the second execution sub-module is used for further determining whether the order supports the shortage quantity ex-warehouse according to the shortage quantity ex-warehouse identification before the first execution sub-module determines that the order is failed to ex-warehouse, and if so, executing a second order ex-warehouse strategy; if not, the first execution submodule is informed that the order fails to be delivered.

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

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the order warehouse-out method.

In a fourth aspect, an embodiment of the present invention provides a computer-readable medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the order warehousing method.

The order ex-warehouse method, the order ex-warehouse device, the electronic equipment and the computer readable medium can meet the order ex-warehouse requirements under different scenes by executing the order ex-warehouse strategy consisting of a plurality of sub-strategies with different priorities. Furthermore, the invention can support the order shortage to be delivered out of the warehouse, and can effectively reduce the failure probability of the order delivery out of the warehouse by executing the delivery strategy when the order shortage is delivered out of the warehouse; in addition, the execution efficiency of the order ex-warehouse strategy can be effectively improved, the logistics distribution efficiency and the time effectiveness are improved, and the distribution cost is reduced by introducing the integer programming model and the optimization algorithm of the model constraint conditions.

Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.

Drawings

The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:

FIG. 1 is a schematic diagram illustrating a main flow of an order delivery method according to an embodiment of the present invention;

FIG. 2 is a schematic diagram illustrating a main flow of an order delivery method according to another embodiment of the present invention;

FIG. 3 is a schematic diagram of a main flow for executing a first order ex-warehouse policy according to another embodiment of the invention;

FIG. 4 is a schematic diagram of a primary flow for determining an upper bound on the number of selected warehouses according to another embodiment of the present invention;

FIG. 5 is a schematic diagram of a primary flow for executing a second order out-of-stock policy according to another embodiment of the invention;

FIG. 6 is a schematic diagram of the main modules of an order delivery apparatus according to another embodiment of the present invention;

FIG. 7 is an exemplary system architecture diagram in which another embodiment of the present invention may be employed;

FIG. 8 is a schematic block diagram of a computer system suitable for use with a server implementing an embodiment of the invention.

Detailed Description

Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

Nowadays, the electric business is more and more developed, and the percentage of online sales to the sales of the headquarters is gradually increased. After a customer places an order on an e-commerce platform, commodities are packaged in a warehouse or a store, and then are sent to the customer through an express company, and then an organization with an express delivery function, such as the warehouse or the store, is called the warehouse collectively.

Fig. 1 is a schematic main flow chart of an order warehouse-out method according to an embodiment of the invention, as shown in fig. 1:

step S101, receiving a user order, determining item information in the order and a warehouse set corresponding to the order, wherein each warehouse in the warehouse set stores at least one item in the order.

Illustratively, the user orders may include a B2B order to service businesses and a B2C order to service individuals. When a customer places an order, an order usually includes multiple item SKUs (short for stock keeping Unit, each product corresponds to a unique SKU number), that is, the order includes multiple items.

Step S101, after receiving a user order, analyzing user order data, and determining the types of articles contained in the order and the quantity corresponding to each type of article; further, a set of warehouses having inventory of any type of item in the order, i.e., a set of warehouses that can be used for order ex-warehousing, may be determined according to the item type. Alternatively, the determination of the warehouse set may be determined based on the warehouse address and the order delivery address, in addition to taking into account the inventory. For example: orders of distribution addresses in a certain administrative area can be set, and warehouse-out operation can be carried out only by a warehouse in the administrative area; a distance threshold may also be set based on the order delivery address, and the distance between the warehouse set available for order warehousing and the order delivery address is less than the threshold.

Step S102, according to the article information in the order, the priority of each warehouse in the warehouse set and the order ex-warehouse configuration information, executing an order ex-warehouse strategy to determine ex-warehouse information corresponding to the order; the order ex-warehouse strategy consists of a plurality of sub-strategies with different priorities.

The priority of each warehouse refers to the priority of warehouse-out operation on the articles in the order, and in general, in order to save cost and improve logistics efficiency, the priority of the warehouse closer to the order distribution address is higher, that is, the priority of each warehouse in the warehouse set can be determined according to the order distribution address and the position information of each warehouse in the warehouse set.

For example, the ex-warehouse configuration information may include information such as the maximum ex-warehouse quantity and/or whether the order supports out-warehouse shortage. The maximum warehouse quantity is the maximum unpacking quantity of the order, that is, how many warehouses the items in the order can be unloaded at most, and is generally related to the delivery cost and/or delivery time limit of the order. Whether the order supports the shortage quantity ex-warehouse or not can be distinguished by using a shortage quantity identifier, for example, an order shortage quantity ex-warehouse identifier S is set, when the S value is 1, the order supports the shortage quantity ex-warehouse, and when the S value is 0, the order does not support the shortage quantity ex-warehouse. Alternatively, whether the order supports the shortage quantity ex-warehouse can be directly determined by judging whether the order shortage quantity ex-warehouse identification S exists or not.

In step S102, after the item information, the priority of each warehouse in the warehouse set, and the order ex-warehouse configuration information are acquired, a corresponding order ex-warehouse policy may be executed based on the information. The order ex-warehouse strategy refers to conditions which need to be met by optimal order ex-warehouse, and includes but is not limited to: the number of the warehouse-out is least, the priority of the warehouse-out is highest, the number of the commodity is most, and the like. For example, in the case that the order requires the least order splitting, the least warehouse quantity may be set as the highest priority condition, that is, the order warehouse-out sub-policy with the highest priority.

And step S103, sending the ex-warehouse information for the ex-warehouse to carry out ex-warehouse operation on the order.

After the warehouse-out information corresponding to the order is determined, the information is sent to the corresponding warehouse-out warehouse through a logistics information system, and each warehouse-out warehouse can determine the order articles and the quantity of the order articles which need to be warehouse-out of each warehouse according to the information, so that warehouse-out operation is carried out.

In this embodiment, a user order is received first, and article information in the order and a warehouse set corresponding to the order are determined; and then according to the article information in the order, the priority of each warehouse in the warehouse set and the order ex-warehouse configuration information, executing an order ex-warehouse strategy to determine ex-warehouse information corresponding to the order, and finally sending the ex-warehouse information for finishing ex-warehouse operation of the order. Due to the fact that the order delivery strategy is composed of the sub-strategies with different priorities, the order delivery requirements under different scenes can be met, the failure probability of order delivery can be effectively reduced, the logistics distribution efficiency and the logistics distribution time efficiency are improved, and the distribution cost is reduced.

Fig. 2 is a schematic diagram of a main flow of an order ex-warehouse method according to another embodiment of the present invention, in which the order information further includes an order shortage ex-warehouse identifier for indicating whether the order supports shortage ex-warehouse. As shown in fig. 2:

step S201, determining whether the total inventory of the order items of the warehouse set meets the order requirement; if yes, step S202 is executed, otherwise step 203 is executed.

According to the embodiment, whether the total inventory of the order items meets the order requirement is determined according to the inventory information of each warehouse in the warehouse set corresponding to the order to be delivered. If the order has items A and B, the demand amounts A1 and B1 are both 100 pieces; the total inventory amount a2 of the a item and the total inventory amount B2 of the B item of each warehouse in the warehouse set need to be calculated, and as a1 is less than or equal to a2 and B1 is less than or equal to B2 are both satisfied, the total inventory of the order items can satisfy the order requirement, and the step S202 is entered, otherwise, the step S203 is executed.

Optionally, under the condition that it is known that all orders do not support the shortage quantity ex-warehouse, if it is determined that the total inventory of the order items does not meet the requirement of the order, step S203 may not be executed, and the order ex-warehouse failure is directly determined, and the ex-warehouse process is ended.

Step S202, executing the first order warehouse-out policy, determining the order warehouse-out information, and executing step S205.

In this embodiment, the first order delivery policy includes a first sub-policy with the least quantity of delivery warehouses and a second sub-policy with the highest priority of delivery warehouses, where the priority of the first sub-policy is higher than that of the second sub-policy, that is, when the first order delivery policy is executed to determine information of the order delivery warehouses, a scheme with the least quantity of warehouses is preferentially selected, so that the quantity of detached orders is reduced, and the logistics cost is saved; and under the condition that the number of the warehouses is the same, the order is taken out of the warehouse from the warehouse with the high priority as much as possible, and the distribution efficiency and the time effectiveness are further improved.

Step S203, judging whether the order supports the shortage delivery, if so, executing step 204, and if not, failing to deliver.

In this embodiment, whether the order supports the shortage quantity ex-warehouse may be determined by the order shortage quantity ex-warehouse identifier in the foregoing embodiment. When the order does not support the shortage quantity ex-warehouse, the order ex-warehouse fails because the current inventory cannot meet the demand of the order. And when the order supports the shortage amount delivery, the step S204 is proceeded.

Step S204, executing the second order warehouse-out policy, determining the order warehouse-out information, and executing step S205.

In this embodiment, the second order warehouse-out policy includes, in addition to the first sub-policy with the smallest warehouse-out quantity and the second sub-policy with the highest priority of the warehouse-out in the first order warehouse-out policy, a third sub-policy with the largest total warehouse-out quantity, which considers that all the articles in the order are required to be warehouse-out, and sets the priority of the third sub-policy to be the highest. Namely, when the second order ex-warehouse strategy is executed, the maximum quantity of the total ex-warehouse articles is preferably ensured. For example, the demand for the item a in the order is 100, the total stock of the item a in the warehouse set is 80, and the 80 items a are distributed in different warehouses, so that when the warehouse is selected, all the 80 items a are preferably guaranteed to be delivered.

And step S205, sending the order warehouse-out information.

FIG. 3 is a diagram illustrating a main flow of executing a first order ex-warehouse policy according to another embodiment of the invention.

The first order ex-warehouse strategy can be realized by an optimal model comprising an integer programming model, and particularly, in the embodiment, the first order ex-warehouse strategy can be executed by solving the integer programming model with constraint conditions. To elaborate the construction and solution process of the integer programming model, the associated symbols and variables are defined as shown in tables 1 and 2 below:

TABLE 1

TABLE 2

Variables of	Means of
		y_i,i∈I	Warehouse i has item SKU equal to 1 when going out of warehouse, otherwise equal to 0
x_ij,i∈I,j∈J	Number of warehouse items SKU j

As shown in fig. 3, the step of executing the first order warehouse-out policy includes:

step S301, constructing an objective function of the integer programming model according to the priority of the sub-strategy, and determining the initial constraint conditions of the model.

Specifically, the sub-policies in this embodiment are consistent with the foregoing implementation, and include a first sub-policy with the smallest number of ex-warehouse and a second sub-policy with the highest ex-warehouse priority, where the first sub-policy is higher in priority than the second sub-policy. In this step S301, the objective function of the integer programming model is constructed according to the priorities of the first sub-strategy and the second sub-strategy as follows:

minP∑_i∈Iy_i+∑_i∈iP_iy_i (1-1)

as can be seen from the objective function of (1-1), since at most E bins are selected, and P is the sum of the priority values of the E bins with the highest priority value (lowest priority), Σ must be present_i∈IP_iy_iP ≦ P, i.e., regardless of warehouse quantity changes, due to Σ_i∈IP_iy_iThe adjusted value is larger than zero, so the adjustment change value is inevitably smaller than P; according to the objective function, when the number of the warehouses is changed, one warehouse is reduced, the reduction value of the first item of the objective function is P, and the value is larger than sigma_i∈IP_iy_iTherefore, in the objective function, the objective function value of the scheme with small warehouse quantity is definitely smaller than that of the scheme with large warehouse quantity, namely, the scheme with small warehouse quantity is definitely better than the scheme with large warehouse quantity; when the number of warehouses is consistent, the warehouse priority value is small (the priority is highest)) The scheme of (2) is more preferable. Therefore, the contribution of the first sub-strategy to the objective function in the objective function is greater than that of the second sub-strategy, so that the first sub-strategy is guaranteed to have higher priority than the second sub-strategy.

While the objective function is determined, constraints of the objective function may be further determined. Specifically, in this embodiment, the constraint conditions are as follows:

constraint (1-2) indicates that for each item SKU, the total number of warehouse trips equals the number of item SKUs in the order.

The constraint (1-3) is that the quantity ex-warehouse per item SKU per warehouse must not be greater than the quantity in inventory of item SKUs in the warehouse.

Constraint (1-4) means the maximum number of unzipped constraints, i.e. warehouse-out from E warehouse at most, if E ═ 1 means warehouse-out from only a single warehouse.

The constraints (1-5) indicate that if an item is out of a warehouse i, the warehouse is selected.

Constraints (1-6) define two states of the warehouse with or without selection.

Step S302, optimizing the constraint condition of selecting the number of the warehouses, and determining the lower boundary and/or the upper boundary of the warehouses.

The specific process of determining the lower boundary and the upper boundary of the number of warehouses will be described in detail in the following embodiments.

And step S303, solving the integer programming model according to the optimized constraint conditions, and determining warehouse-out information corresponding to the order.

Optionally, the constraints may not be optimized. If there is no process of optimizing the constraints in step S302, the integer programming model is solved directly according to the initial constraints in step S303.

In another embodiment of the invention, the optimization is performed for the lower bound of the constraints (1-4). In the constraint (1-4), the number of warehouses selected by the constraint is at most E, theoretically, 0 to E warehouses can be selected, and the warehouses have 2 in total^EIn the selection, the constraint is weak, so that the constraint can be selected as an optimization object, the range of selecting the number of the warehouses is further narrowed, and the lower boundary of the warehouses is determined.

Let the number of selected warehouses be z, namely

z lower boundary estimation method

Selecting one item SKU j from order item SKU list

② obtaining the demand C of j in the order according to the selected item SKU_jNumber x of j in storehouse i_ij；

Thirdly, the owned quantity of each warehouse of the item SKU j is sorted from large to small, and the value after the sorting is assumed to be a₀,a₁,…,a_n-1；

Fourthly, obtaining the minimum t corresponding to the item SKU j_jSo that

Determining t corresponding to all item SKU_jMaximum value t of_jmaxIf z is greater than or equal to t_jmax。

Alternatively, the determination of the lower z boundary may be performed by selecting only a portion of the item SKUs in the order, instead of selecting all SKUs in sequence, thereby further saving the resource overhead of calculating the lower boundary. That is, when determining the z lower boundary, the minimum value of the number of the single-item warehouse-out warehouse corresponding to the single-item warehouse-out of the at least one order item is determined first, and the maximum value of all the minimum values of the number of the single-item warehouse-out warehouse is selected as the lower boundary.

Fig. 4 is a schematic diagram of a main flow of determining an upper boundary of a selected bin number according to another embodiment of the present invention.

An initial solution is obtained according to the following heuristic algorithm, and then the upper boundary of z, namely the maximum required warehouse number of the optimal solution, is obtained according to the initial solution. The method comprises the following steps:

step S401: and determining the ex-warehouse demand of each item in the order.

Specifically, the number of pieces required by each item SKU of the current order is initially set to be

(c₀,c₁,…,c_m-1)；

Step S402: and calculating the total number of the unselected warehouses in the warehouse set, which can meet the warehouse-out demand of each item in the order.

Specifically, the number of pieces of each unselected warehouse which can meet the demand of each item SKU of the order is calculated, and the number of each item SKU of the warehouse i is (x)_i1,x_i2,…,x_i,m-1) Then each item SKUj can satisfy the number f_j＝min(c_j,c_i,j) Can satisfy the total number of

Step S403: and selecting the warehouse with the largest total number as an ex-warehouse, and updating the ex-warehouse demand of each item in the order.

Specifically, the bin with the largest total number of demands is selected and the number of demands per item SKU j in the order is updated, i.e., c_j←c_j-f_jFromAnd updates the required number of pieces per item SKU (c)₀,c₁,…,c_m-1)；

Step S404: if the number of currently selected warehouses is larger than or equal to the maximum ex-warehouse quantity or the ex-warehouse demand of each item in the order is zero, executing the step 405, otherwise, returning to the step 402 to continue executing.

Step S405: and taking the selected warehouse quantity as the maximum value of the ex-warehouse quantity selected when the integer planning model is solved.

Illustratively, the order has items A and B with demand amounts of (100 ), where the first item represents the demand amount for item A and the second item represents the demand amount for item B.

The number of warehouses corresponding to the order is 5, and the warehouses are respectively W₁～W₅The corresponding inventory amounts of article a and article B are as follows: w is a₁＝(50,50)；w₂＝(50,50)；w₃＝(110,20)；w₄＝(0,60)；w₅＝(0,20)。

According to the heuristic algorithm, the number of the required articles A and B in the initially set order is (100 ), and w₃120 can be satisfied, and after the warehouse with the largest number is selected, the remaining demand of the item A and the item B in the order is (0, 80);

from the remaining demand, in the second selection, w may be determined₄To meet the largest number of warehouses, 60 pieces may be met, which after selection, have a remaining demand of (0,20) for item a and item B in the order;

further, the remaining warehouse w₁、w₂And w₅The remaining demand can be satisfied and can be selected as an object of selection. That is, the number of warehouses selected in the obtained solution is 3 by the heuristic algorithm, and 3 can be used as the upper boundary of the number z of selected warehouses. Indeed, in the above example, the optimal solution for the integer programming model is to select two bins w₁And w₂I.e. less than the upper boundary determined by the heuristic algorithm described above.

It can be understood that, in the step of determining the lower boundary and the upper boundary for optimizing the constraint condition, any one of the constraints can be selected individually to optimize the constraint condition of the integer programming model according to the requirement, or two of the constraints can be selected simultaneously to optimize the constraint condition of the integer programming model.

FIG. 5 is a diagram illustrating a main flow of executing a second order ex-warehouse policy according to another embodiment of the present invention.

The second order ex-warehouse strategy can be realized by an optimal model including an integer programming model, and particularly, in the embodiment, the second order ex-warehouse strategy can be executed by solving the integer programming model with the constraint condition.

As shown in fig. 5, the step of executing the second order warehouse-out policy includes:

step S501, an objective function of the integer programming model is constructed according to the priority of the sub-strategies, and initial constraint conditions of the model are determined.

Specifically, the sub-policies in this embodiment include a first sub-policy with the smallest number of ex-warehouse items, a second sub-policy with the highest priority of ex-warehouse items, and a third sub-policy with the largest number of ex-warehouse items, where the priority of the third sub-policy is higher than that of the first sub-policy, and the priority of the first sub-policy is higher than that of the second sub-policy. In this step S301, the objective function of the integer programming model is constructed according to the priorities of the first sub-strategy, the second sub-strategy, and the third sub-strategy as follows:

Max(P+P_imax+1)∑_i∈I,j∈J x_ij-(P∑_i∈I y_i+∑_i∈I P_iy_i) (2-1)

in the objective function (2-1), (P ∑_i∈I y_i+∑_i∈I P_iy_i) Has the same meaning as the objective function (1-1) in the foregoing embodiment, and therefore, it can be seen that in the objective function (2-1), when the number of shipment items is constant, that is, (P + P)_imax+1)∑_i∈I,j∈Jx_ijUnder the same condition, the scheme with small warehouse number has an objective function value superior to the scheme with large warehouse; and when the number of the warehouses is consistent, the scheme with small warehouse priority values (highest priority) is more preferable.

For the articles out of the warehouseFor the case of varying quantities, (P + P) for each additional item_imax+1)∑_i∈I,j∈J x_ijIs increased by (P + P)_imax+1) and adding one item, at most one warehouse, at this time, (P Σ)_i∈I y_i+∑_i∈IP_iy_i) Is not more than (P + P)_imax) And (P + P)_imax) Is necessarily less than (P + P)_imax+ 1); therefore, a solution with a high number of items is certainly superior to a solution with a low number of warehouses. Alternatively, (P + P) as described above_imax+1)∑_i∈I,j∈J x_ijOf (P + P)_imax+1) may also be replaced by a larger number than this, such as 2P or the like.

In summary, through the setting of the objective function, it is achieved that the third sub-policy with the largest number of ex-warehouse items has a higher priority than the first sub-policy with the smallest number of ex-warehouse items, and the first sub-policy with the smallest number of ex-warehouse items has a higher priority than the second sub-policy with the highest priority.

constraint (2-2), the quantity ex warehouse per warehouse SKU is less than or equal to the quantity in order SKU since the order requirements have not been met.

The constraints (2-3) to (2-6) are in accordance with the previous meanings of (1-3) to (1-6).

And step S502, optimizing constraint conditions according to the principle that all the articles lack are delivered out of the warehouse.

Due to the fact that the SKU of the warehouse article cannot meet the order requirement, the warehouse article needs to be delivered out of the warehouse in an insufficient amount, namely, the SKU of the article causing the shortage must be delivered out of the warehouse in a full amount. Therefore, before the integer planning model is solved, the total inventory of each item SKU in the warehouse can be counted, and if the value is less than or equal to the amount required by the order, the warehouses with the inventory of the item SKU must be all selected, so that a part of warehouses which must be selected are determined in advance, and the information can be added into the solving information.

And S503, solving the integer programming model according to the optimized constraint conditions, and determining warehouse-out information corresponding to the order.

As shown in fig. 6, another embodiment of the present invention provides an order delivery apparatus 600, wherein the order delivery apparatus 600 may include:

an order receiving module 601, configured to receive an order from a user, determine item information in the order and a warehouse set corresponding to the order, where each warehouse in the warehouse set stores at least one item in the order;

an executing module 602, configured to execute an order warehouse-out policy to determine warehouse-out information corresponding to an order according to the item information in the order, the priority of each warehouse in the warehouse set, and the order warehouse-out configuration information; the order ex-warehouse strategy consists of a plurality of sub-strategies with different priorities;

a sending module 603, configured to send the warehouse-out information determined by the executing module.

Further, the executing module 602 further includes:

a first execution sub-module 6021, configured to determine whether the total inventory of the order items in the warehouse set meets the order requirement, and if so, execute a first order warehouse-out policy; if not, the order fails to be taken out of the warehouse;

Further, the order ex-warehouse configuration information comprises: the shortage quantity is taken out of the warehouse;

the executing module 602 further includes: the second execution submodule 6022 is configured to, before the first execution submodule 6021 determines that the order is failed to be delivered, further determine whether the order supports delivery according to the shortage delivery identifier, and if so, execute a second order delivery policy; if not, the first execution submodule 6021 notifies the order out failure.

Fig. 7 illustrates an exemplary system architecture 700 in which the order warehouse-out method of an embodiment of the present invention may be applied.

As shown in fig. 7, the system architecture 700 may include

terminal devices

701, 702, 703, a network 704, and a server 705. The network 704 serves to provide a medium for communication links between the

terminal devices

701, 702, 703 and the server 705. Network 704 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

The user may use the

terminal devices

701, 702, 703 to interact with the server 705 over the network 704 to send order information. The

terminal devices

701, 702, 703 may be installed with various communication client applications that can generate orders, such as a shopping application, a web browser application, an instant messaging tool, social platform software, and the like.

The

terminal devices

701, 702, 703 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 705 may be a server that provides various services, for example, a background management server that supports a shopping website browsed by a user using the

terminal devices

701, 702, and 703, and the background management server may analyze received order data and perform other processing. The server 705 is connected with a server of the logistics information system through a network or other modes, and is used for receiving related data such as article inventory information and sending order warehouse-out information for warehouse-out operation; alternatively, the server 705 may be a server directly deployed in the logistics information system.

It should be noted that the order warehousing method provided by the embodiment of the present invention is generally executed by the server 705, and the order warehousing device is generally disposed in the server 705.

It should be understood that the number of terminal devices, networks, and servers in fig. 7 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

Referring now to FIG. 8, a block diagram of a computer system 800 suitable for use as a server in implementing embodiments of the present invention is shown. The terminal device shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.

As shown in fig. 8, the computer system 800 includes a Central Processing Unit (CPU)801 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. In the RAM803, various programs and data necessary for the operation of the system 800 are also stored. The CPU 801, ROM 802, and RAM803 are connected to each other via a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.

The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.

In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. The computer program executes the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 801.

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

The flowchart and block diagrams in the figures illustrate the functionality, architecture and operation of possible implementations of methods, apparatus, electronic devices and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes an order receiving module, an execution module, and a sending module. The names of these modules do not in some cases constitute a limitation on the module itself, and for example, a sending module may also be described as a "module that sends out warehouse information".

As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to perform:

According to the technical scheme of the embodiment of the invention, the order delivery requirement under different scenes can be met by executing the order delivery strategy consisting of the plurality of sub-strategies with different priorities. Furthermore, the invention can support the order shortage to be delivered out of the warehouse, and can effectively reduce the failure probability of the order delivery out of the warehouse by executing the delivery strategy when the order shortage is delivered out of the warehouse; in addition, the execution efficiency of the order ex-warehouse strategy can be effectively improved, the logistics distribution efficiency and the time effectiveness are improved, and the distribution cost is reduced by introducing the integer programming model and the optimization algorithm of the model constraint conditions.

The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A method for order warehousing, comprising:

2. The method of claim 1, wherein the order ex-warehouse configuration information comprises: the maximum number of warehouse-out.

3. The method of claim 2, wherein the executing the order warehouse-out policy to determine warehouse-out information corresponding to the order comprises:

4. The method of claim 3, wherein the order ex-warehouse configuration information comprises: the shortage quantity is taken out of the warehouse;

5. The method of claim 4, wherein the first and second order pull strategies are implemented based on an optimization model, and wherein an objective function of the optimization model is established according to priorities of different sub-strategies.

6. The method of claim 5, wherein the optimization model is a constrained integer programming model;

7. The method of claim 6, wherein the constraints comprise: the selected ex-warehouse quantity is not more than the maximum ex-warehouse quantity;

8. The method according to claim 6 or 7, wherein the constraint condition comprises: the selected warehouse quantity is not more than the maximum ex-warehouse quantity;

9. The method of claim 8, wherein the heuristic algorithm comprises:

step 1: determining the ex-warehouse demand of each item in the order;

10. The method of claim 6, wherein:

and when the second order warehouse-out strategy is executed, determining the warehouse-out warehouse which is inevitably selected according to the inventory information corresponding to the shortage articles based on the principle that all the shortage articles in the order are warehouse-out, then solving the integral planning model, and calculating the warehouse-out warehouse information corresponding to the order.

11. The method of claim 1, wherein:

the priority of each warehouse in the warehouse set is determined according to the order distribution address and the position information of each warehouse in the warehouse set.

12. An order delivery apparatus, comprising:

13. The apparatus of claim 12, wherein the execution module further comprises:

14. The apparatus of claim 13, wherein the order ex-warehouse configuration information comprises: the shortage quantity is taken out of the warehouse;

the execution module further comprises: the second execution sub-module is used for further determining whether the order supports the shortage quantity ex-warehouse according to the shortage quantity ex-warehouse identification before the first execution sub-module determines that the order is failed to ex-warehouse, and if so, executing a second order ex-warehouse strategy; if not, informing the first execution submodule that the order fails to be delivered out of the warehouse;

15. An electronic device, comprising:

one or more processors;

a storage device for storing one or more programs,

when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-11.

16. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-11.