Order processing method, device, computing equipment and medium

The order processing method optimizes order allocation between main and supplementary picking areas using mathematical programming, enhancing production capacity and efficiency in logistics warehouses.

CN113781135BActive Publication Date: 2024-12-03BEIJING JINGDONG QIANSHITECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202010853835.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2020-08-21
Publication Date
2024-12-03
Estimated Expiration
2040-08-21

AI Technical Summary

Technical Problem

Unreasonable order allocation between the main picking area and supplementary picking area leads to low order processing efficiency in logistics warehouses.

Method used

An order processing method involving the creation of a first planning model to determine a flow allocation strategy for orders between a first and second picking area, utilizing mathematical programming to optimize order distribution and improve efficiency.

Benefits of technology

Enhances production capacity utilization and efficiency by reasonably allocating orders to multiple picking areas, improving overall order processing capabilities.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113781135B_ABST
    Figure CN113781135B_ABST
Patent Text Reader

Abstract

The present disclosure provides an order processing method, including: obtaining at least one pending order, operation data of a first picking area, and operation data of a second picking area; creating a first planning model according to at least one pending order, operation data of the first picking area, and operation data of the second picking area; determining a flow distribution strategy for at least one pending order using the first planning model; and picking goods in at least one pending order in the first picking area and the second picking area according to the flow distribution strategy. The present disclosure also provides an order processing device, a computing device, and a medium.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of warehousing logistics technology, and more specifically, to an order processing method, apparatus, computing device and medium. Background Art

[0002] With the development of the e-commerce industry, e-commerce companies have an increasing demand for logistics warehouse processing capabilities. The processing capacity of a single logistics warehouse is limited. In order to improve the processing capacity of logistics warehouses, related technologies increase order processing capabilities by adding supplementary picking areas outside the main picking area of ​​the logistics warehouse. The supplementary picking area has the same outward full-box transfer function as the main picking area, which can increase the flexibility of the original hardware equipment and improve the efficiency of outbound delivery.

[0003] In the process of realizing the concept of the present disclosure, the inventors found that there are at least the following problems in the related art: unreasonable order allocation between the main picking area and the supplementary picking area leads to low order processing efficiency. Summary of the invention

[0004] In view of this, the present disclosure provides an order processing method, apparatus, computing device and medium.

[0005] One aspect of the present disclosure provides an order processing method, including: acquiring at least one pending order, operating data of a first picking area, and operating data of a second picking area; creating a first planning model based on the at least one pending order, the operating data of the first picking area, and the operating data of the second picking area; using the first planning model, determining a flow allocation strategy for the at least one pending order; and picking items in the at least one pending order in the first picking area and the second picking area according to the flow allocation strategy.

[0006] According to an embodiment of the present disclosure, the operating data of the first picking area includes the remaining production capacity of the first picking area, the types of goods and the inventory of goods in the first picking area; the operating data of the second picking area includes the utilization rate of the second picking area, the types of goods and the inventory of goods in the second picking area, and the storage location occupancy information in the second picking area.

[0007] According to an embodiment of the present disclosure, creating a first planning model according to the at least one pending order and the operation data includes: creating a first objective function according to the following formula:

[0008]

[0009] Wherein, f1 is the first objective function, X1 is the total number of merged orders assigned to the first picking area and the second picking area for joint processing, X2 is the number of first orders assigned to the first picking area for processing, X3 is the number of replenishment boxes required for replenishment orders, X4 is the number of unfilled storage locations in the second picking area that the replenishment orders need to occupy, X5 is the number of goods in the replenishment order, X6 is the number of goods in the second order assigned to the second picking area for processing, and is the preset weight, if but if but if but if but Among them, the The capacity of the first picking area, s, is the total amount of goods in the at least one pending order. is the utilization rate of the second picking area, and z is the utilization rate threshold; and according to the first constraint condition, a first constraint function is created.

[0010] According to an embodiment of the present disclosure, the first constraint condition includes at least one of the following constraints: each of the at least one pending order can only be assigned to one of the first picking area and the second picking area; the number of goods in the orders processed by the second picking area is less than the inventory of goods in the second picking area; the number of goods in the orders processed by the second picking area is less than the inventory of goods in the first picking area; each unfilled storage location in the second picking area can store no more than 3 material boxes; one material box corresponds to one storage location; the total number of replenishment material boxes without selecting some storage locations is less than the number of empty storage locations; and the inventory of goods in the second picking area is greater than the safety stock.

[0011] According to an embodiment of the present disclosure, the flow allocation strategy is used to classify each order in the at least one pending order into the first order, the second order, the merged order or the to-be-replenished order; picking the goods in the at least one pending order in the first picking area and the second picking area according to the flow allocation strategy includes: moving the goods in the to-be-replenished order from the first picking area to the second picking area; the first picking area performs the goods picking operation of the first order, the second picking area performs the goods picking operation of the second order and the to-be-replenished order, and the first picking area and the second picking area jointly perform the goods picking operation of the merged order.

[0012] According to an embodiment of the present disclosure, the second picking area includes a fixed buffer area and a temporary buffer area; the moving of the goods in the replenishment order from the first picking area to the second picking area includes: transporting the goods to be replenished to the temporary buffer area; and regularly transporting the goods in the temporary buffer area to the fixed buffer area. The picking operation of the goods of the second order and the order to be replenished performed by the second picking area includes: picking the goods in the second order and the order to be replenished in the fixed buffer area.

[0013] According to an embodiment of the present disclosure, the method also includes: creating a second planning model based on the orders to be processed in the second picking area and the second operating data of the second picking area; dividing the orders to be processed in the second picking area into at least one order set according to the second planning model, and determining the picking points corresponding to the goods in the at least one order set; and picking the goods in the orders to be processed in the second picking area according to the at least one order set and the picking points.

[0014] According to an embodiment of the present disclosure, creating a second planning model according to the orders to be processed in the second picking area and the second operation data of the second picking area includes: creating the second objective function according to the following formula:

[0015] f2=min{Y1+Y2+Y3}

[0016] Wherein, f2 is the second objective function, Y1 is the area of ​​the image enclosed by the picking points, Y2 is the number of picking points, and Y3 is the total volume of the goods in the order set; and according to the second constraint condition, a second constraint function is created.

[0017] According to an embodiment of the present disclosure, the second constraint condition includes at least one of the following constraints: the total volume of the goods in the order set is greater than the first volume threshold; the total volume of the goods in the order set is less than the second volume threshold; the number of orders to be processed in the second picking area is less than the order number threshold; the number of goods in the orders to be processed in the second picking area is less than the goods number threshold; the number of each type of goods in the orders to be processed in the second picking area is less than the inventory of the goods in the second picking area; each unfilled storage location in the second picking area can store no more than 3 material boxes; and one material box corresponds to one storage location.

[0018] Another aspect of the present disclosure provides an order processing device, including: an acquisition module, used to acquire at least one pending order, operating data of a first picking area, and operating data of a second picking area; a creation module, used to create a first planning model based on the at least one pending order, the operating data of the first picking area, and the operating data of the second picking area; a determination module, used to determine a flow allocation strategy for the at least one pending order using the first planning model; and a picking module, used to pick items in the at least one pending order in the first picking area and the second picking area according to the flow allocation strategy.

[0019] Another aspect of the present disclosure provides a computing device, including: one or more processors; a storage device for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the method as described above.

[0020] Another aspect of the present disclosure provides a computer-readable storage medium storing computer-executable instructions, which are used to implement the above method when executed.

[0021] Another aspect of the present disclosure provides a computer program, which includes computer executable instructions, and the instructions are used to implement the method described above when executed.

[0022] According to an embodiment of the present disclosure, a flow allocation strategy for pending orders is determined through a first mathematical programming model, so that the orders are reasonably allocated to the first picking area and the second picking area according to the flow allocation strategy, thereby better utilizing the production capacity of the first picking area and the second picking area and improving production efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] The above and other objects, features and advantages of the present disclosure will become more apparent through the following description of the embodiments of the present disclosure with reference to the accompanying drawings, in which:

[0024] Figure 1 An exemplary application scenario to which the order processing method according to an embodiment of the present disclosure can be applied is schematically shown;

[0025] Figure 2 A flowchart of an order processing method according to an embodiment of the present disclosure is schematically shown;

[0026] Figure 3 A flowchart of an order processing method according to an embodiment of the present disclosure is schematically shown;

[0027] Figure 4 A block diagram schematically shows an order processing device according to an embodiment of the present disclosure; and

[0028] Figure 5 The block diagram of a computer system suitable for implementing the method described above according to an embodiment of the present disclosure is schematically shown. DETAILED DESCRIPTION

[0029] Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the present disclosure. In the following detailed description, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of the embodiments of the present disclosure. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present disclosure.

[0030] The terms used herein are only for describing specific embodiments and are not intended to limit the present disclosure. The terms "comprise", "include", etc. used herein indicate the existence of the features, steps, operations and / or components, but do not exclude the existence or addition of one or more other features, steps, operations or components.

[0031] All terms (including technical and scientific terms) used herein have the meanings commonly understood by those skilled in the art, unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification, and should not be interpreted in an idealized or overly rigid manner.

[0032] In the case of using expressions such as "at least one of A, B, and C, etc.", it should generally be interpreted in accordance with the meaning of the expression generally understood by those skilled in the art (for example, "a system having at least one of A, B, and C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.). In the case of using expressions such as "at least one of A, B, or C, etc.", it should generally be interpreted in accordance with the meaning of the expression generally understood by those skilled in the art (for example, "a system having at least one of A, B, or C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.).

[0033] The embodiment of the present disclosure provides an order processing method and a device capable of applying the method. The method comprises: obtaining at least one pending order, operation data of a first picking area, and operation data of a second picking area; creating a first planning model according to at least one pending order, operation data of the first picking area, and operation data of the second picking area; determining a flow distribution strategy for at least one pending order using the first planning model; and picking the goods in the at least one pending order in the first picking area and the second picking area according to the flow distribution strategy.

[0034] Figure 1 The exemplary application scenario 100 to which the order processing method according to the embodiment of the present disclosure can be applied is schematically shown. It should be noted that: Figure 1 What is shown are merely examples of application scenarios to which the embodiments of the present disclosure can be applied, in order to help those skilled in the art understand the technical content of the present disclosure, but it does not mean that the embodiments of the present disclosure cannot be used in other devices, systems, environments or scenarios.

[0035] like Figure 1 As shown, the application scenario 100 according to this embodiment may include a first picking area 10 and a second picking area 20 .

[0036] Among them, the first picking area 10 can be, for example, an unmanned picking area, and can be used as the main picking area for automatically processing orders in the order pool. The second picking area 20 can be, for example, a flow shelf picking area. The second picking area 20 can be set on one side of the first picking area 10 as a supplementary picking area for the first picking area 10. The second picking area 20 has the same outward whole-box transfer function as the first picking area 10, and can process orders independently. The second picking area 20 can also process merged orders together with the first picking area 10. The second picking area 20 can be configured as a fixed buffer area and a temporary buffer area. The fixed buffer area can be used to store goods that are replenished in advance, and the temporary buffer area can be used to store goods that are temporarily replenished, so as to make up for the insufficient production capacity of the first picking area 10 when large-scale promotions and daily wave peaks occur.

[0037] Figure 2 The flowchart of the order processing method according to the embodiment of the present disclosure is schematically shown.

[0038] like Figure 2 As shown, the method includes, at operation S210, obtaining at least one to-be-processed order, operating data of a first picking area, and operating data of a second picking area.

[0039] According to an embodiment of the present disclosure, each of the at least one pending order contains at least one item to be picked and shipped out of the warehouse. The operation data of the first picking zone may include, for example, the remaining capacity of the first picking zone, the types of goods in the first picking zone, and the inventory of goods.

[0040] The operation data of the second picking area may include, for example, the utilization rate of the second picking area, the types of goods and the inventory of goods in the second picking area, and the storage location occupancy information in the second picking area. The storage location occupancy information may include, for example, empty storage locations, and the types and quantities of goods in occupied storage locations.

[0041] Then, in operation S220, a first planning model is created according to at least one pending order, the operation data of the first picking area, and the operation data of the second picking area.

[0042] According to an embodiment of the present disclosure, the first planning model may include, for example, a first objective function and a first constraint function. The method for creating the first planning model is further described below.

[0043] For ease of expression, in this embodiment, the order assigned to the first picking area for processing is called the first order, the order assigned to the second picking area for processing is called the second order, and the order assigned to the first picking area and the second picking area for processing together is called the merged order.

[0044] According to an embodiment of the present disclosure, the first objective function may be created according to the following formula:

[0045]

[0046] Among them, f1 is the first objective function, X1 is the total number of merged orders assigned to the first picking area and the second picking area for joint processing, X2 is the number of first orders assigned to the first picking area for processing, X3 is the number of replenishment boxes required for replenishment orders, X4 is the number of unfilled storage locations in the second picking area that replenishment orders need to occupy, X5 is the number of goods in the replenishment order, and X6 is the number of goods in the second order assigned to the second picking area for processing. is the preset weight,

[0047] if but

[0048] if but

[0049] if but

[0050] if but

[0051] Among them, The capacity of the first picking area, s is the total amount of goods in at least one pending order, is the utilization rate of the second picking area, and z is the utilization rate threshold.

[0052] According to an embodiment of the present disclosure, a first constraint function may be created according to a first constraint condition. The first constraint condition may include, for example, at least one of the following constraint conditions:

[0053] (1) Each of the at least one pending order can only be assigned to one of the first picking zone and the second picking zone.

[0054] (2) The quantity of goods in the order processed by the second picking area is less than the inventory of goods in the second picking area.

[0055] (3) The quantity of goods in the order processed by the second picking area is less than the inventory of goods in the first picking area.

[0056] (4) Each unfilled storage location in the second picking area can store no more than 3 boxes;

[0057] (5) One material box corresponds to one storage location.

[0058] (6) The total number of replenishment bins without selecting some storage locations is less than the number of empty storage locations.

[0059] (7) The inventory of goods in the second picking area is greater than the safety stock.

[0060] In operation S230, a flow allocation strategy for at least one to-be-processed order is determined using the first planning model.

[0061] According to an embodiment of the present disclosure, by solving the first planning model, a flow allocation strategy can be obtained. The flow allocation strategy can be used to classify each order in at least one pending order as a first order, a second order, a merged order, or a replenishment order.

[0062] In operation S240, according to the flow distribution strategy, items in at least one to-be-processed order are picked in the first picking area and the second picking area.

[0063] According to an embodiment of the present disclosure, operation S240 may, for example, include moving the goods in the order to be replenished from the first picking area to the second picking area, and then the first picking area performs the goods picking operation for the first order, the second picking area performs the goods picking operation for the second order and the order to be replenished, and the first picking area and the second picking area jointly perform the goods picking operation for the merged order.

[0064] According to another embodiment of the present disclosure, a fixed buffer area and a temporary buffer area may be configured in the second picking area. Goods that need to be replenished are transported to the temporary buffer area, and then the goods in the temporary buffer area are regularly transported to the fixed buffer area. When it is necessary to perform a goods picking operation for the second order and the order to be replenished in the second picking area, the goods in the second order and the order to be replenished are picked in the fixed buffer area.

[0065] According to an embodiment of the present disclosure, a flow allocation strategy for pending orders is determined through a first mathematical programming model, so that the orders are reasonably allocated to the first picking area and the second picking area according to the flow allocation strategy, thereby better utilizing the production capacity of the first picking area and the second picking area and improving production efficiency.

[0066] Figure 3 The flowchart of an order processing method according to another embodiment of the present disclosure is schematically shown.

[0067] like Figure 3 As shown, in addition to operations S210 to S240 , the method may further include operations S310 to S330 .

[0068] In operation S310, a second planning model is created according to the orders to be processed in the second picking area and second operation data of the second picking area.

[0069] According to an embodiment of the present disclosure, the second planning model may include, for example, a second objective function and a second constraint function.

[0070] According to an embodiment of the present disclosure, the second objective function may be created according to the following formula:

[0071] f2=min{Y1+Y2+Y3}

[0072] Wherein, f2 is the second objective function, Y1 is the area of ​​the image enclosed by the picking points, Y2 is the number of picking points, and Y3 is the total volume of the goods in the order set; and

[0073] According to an embodiment of the present disclosure, a second constraint function may be created according to a second constraint condition. The second constraint condition may include, for example, at least one of the following constraint conditions:

[0074] (1) The total volume of the goods in the order set is greater than the first volume threshold.

[0075] (2) The total volume of the goods in the order set is less than the second volume threshold.

[0076] (3) The number of orders to be processed in the second picking area is less than the order number threshold.

[0077] (4) The number of items in the order to be processed in the second picking area is less than the item number threshold.

[0078] (5) The quantity of each item in the orders to be processed in the second picking area is less than the inventory of the items in the second picking area.

[0079] (6) Each unfilled storage location in the second picking area can store no more than three boxes.

[0080] (7) One material box corresponds to one storage location.

[0081] In operation S320, the orders to be processed in the second picking area are divided into at least one order set according to the second planning model, and picking points corresponding to the goods in the at least one order set are determined.

[0082] According to an embodiment of the present disclosure, the order grouping and positioning strategy can be determined by solving the second planning model. The order grouping and positioning strategy can be used to represent the method of dividing the pending orders into order sets and the locations of the picking points corresponding to the goods in the order sets.

[0083] In operation S330, items in the order to be processed in the second picking area are picked according to at least one order set and a picking point.

[0084] According to an embodiment of the present disclosure, a collection list can be generated one at a time according to the divided order sets and the positions of the picking points corresponding to each order set until the set of pending orders in the second picking area is empty. Each collection list includes an order set and a picking point set.

[0085] According to an embodiment of the present disclosure, during the order processing in the second picking area, if there is a material box to be replenished at the picking point, an urgent replenishment task is generated for the material box. When all the urgent replenishment tasks are completed, the picking task of the collection order is issued.

[0086] According to the method of the embodiment of the present disclosure, by determining the flow distribution strategy and the group order positioning strategy in two steps, the production capacity of the first picking area can be maximized and the production capacity of the second picking area can be reasonably utilized. When the production capacity of the first picking area is insufficient, the order flow of the first picking area and the second picking area can be reasonably managed. The combined production volume of the first picking area and the second picking area and the number of replenishment boxes from the first picking area to the second picking area are reduced to improve production time efficiency. And the number of storage locations in the second picking area can be reasonably occupied to avoid being full.

[0087] The following is a detailed description of the embodiments of the present invention. Figures 2-3 Those skilled in the art will appreciate that the following exemplary embodiments are only used to understand the present disclosure, and the present disclosure is not limited thereto.

[0088] In this embodiment, the first picking area is the Sirius machine area, and the second picking area is the flow shelf area.

[0089] First, obtain the relevant data of the orders to be processed, the operating data of the first picking area and the second picking area, and other data.

[0090] According to an embodiment of the present disclosure, the remaining capacity of the Sirius machine area can be calculated according to the following formula:

[0091]

[0092] Among them, the number of orders to be picked in the Sirius machine area (unit: piece) is s, the set of picking workstations is w, and the picking efficiency of the workstation (according to historical data statistics, pieces / hour) is θ i , the distance from the current time to the end of production (unit: hours) is t.

[0093] According to an embodiment of the present disclosure, if Then the remaining capacity of the Sirius Machine Area is sufficient. Otherwise, the remaining capacity is insufficient.

[0094] According to an embodiment of the present disclosure, the flow rack utilization rate can be calculated according to the following formula:

[0095]

[0096] Among them, the total number of storage digits is s, and the number of empty storage digits is w.

[0097] For example, in this embodiment, the usage rate threshold is 0.8. The utilization rate of the flow rack is too high, otherwise the utilization rate is normal.

[0098] Then, based on the data related to the pending orders, the operation data of the first picking area and the second picking area, etc., a first planning model is created. The optimization objectives of the first planning model include:

[0099] (1) Tianlang should replenish as few boxes of materials as possible in the flow shelf area.

[0100] (2) Reduce the number of merged production orders.

[0101] (3) If the machine area has sufficient production capacity, select as many orders as possible from that machine area.

[0102] (4) When the machine area has insufficient capacity, select as many orders as possible from the flow area.

[0103] (5) Remove non-fixed items from the flow area as much as possible and add as little as possible.

[0104] (6) Try to replenish the fixed items on the flow shelves to the replenishment limit.

[0105] (7) When the utilization rate of the flow shelves is too high, the number of empty storage spaces on the flow shelves should be as small as possible when replenishing goods.

[0106] In this embodiment, the parameters of the first planning model are as follows:

[0107] D: order set;

[0108] S: product set (the set of products in D);

[0109] T: turnover box collection (material boxes in the Sirius machine area);

[0110] P: the collection of unfilled storage spaces in the flow rack area;

[0111] θ s : The sku does not belong to the fixed product set in the fluent area;

[0112] The number of stored bins in partially empty storage locations;

[0113] M ds : The demand for item s in order d, d∈D;

[0114] O ts : The inventory of commodity s in turnover box t, t∈T;

[0115] M sr : The inventory of commodity s in the flow shelf area, s∈S;

[0116] M sb : The inventory of commodity s in the Sirius area;

[0117] W r : Number of empty storage spaces in the flow rack area;

[0118] Q rs : The replenishment limit for product s in the flow shelf area;

[0119] In this embodiment, the variables of the objective function of the first planning model are as follows:

[0120] γ d : Whether order d chooses to produce in the fluent zone, γ d ∈{0,1}, select 1, otherwise 0;

[0121] β d : Whether order d is selected for machine area production;

[0122] α pt : Whether the material box t selects the storage location p, p∈P, the sku (product identification) corresponding to p and t are equal, α pt ∈{0,1}, select 1, otherwise 0;

[0123] π t : Whether turnover box t is selected, π t ∈{0,1}, select 1, otherwise 0;

[0124] In this embodiment, the objective function of the first planning model may be:

[0125]

[0126] In this embodiment, the constraint function of the first planning model may include:

[0127] Constraint (1): γ d +β d ≤1,

[0128] Constraint (2): ∑γ d *M ds ≤∑π t *O ts +M sr ,

[0129] Constraint (3): ∑β d *M ds ≤∑(1-π t )*O ts +M sb ,

[0130] Constraint (4):

[0131] Constraint (5): ∑α pt ≤1,

[0132] Constraint (6): ∑π t -∑α pt ≤W r

[0133] Constraint (7): ∑π t *θ s *O ts +M sr -∑γ d *M ds ≥Q rs ,

[0134] Among them, constraint (1) means that the order can only be produced in one zone. Constraint (2) means that the order quantity of the goods produced in the flow zone is less than the inventory of the flow zone. Constraint (3) means that the order quantity of the goods produced in the machine zone is less than the inventory of the machine zone. Constraint (4) means that the number of material boxes of an unfilled flow zone storage location p cannot exceed 3. Constraint (5) means that a material box t can only choose one flow zone storage location p. Constraint (6) means that the total number of replenishment material boxes without selecting some storage locations is less than the number of empty storage locations. Constraint (7) means that the replenishment quantity of the fixed sku in the flow zone + the existing quantity - the order demand quantity > the safety stock.

[0135] By solving the first planning model, we get the following flow allocation results: Tianlang District production order set ∑β d , the production order set of the flow shelf area ∑γd , confluence order set (D-∑γ d -∑β d ), generate the material box ∑π for the urgent replenishment task t .

[0136] Next, the urgent replenishment task boxes are moved from the Tianlang area to the second picking area, and then the Tianlang area picks the production order set ∑β d The goods and the confluence order set (D-∑γ d -∑β d ) Goods picked in the Sirius area.

[0137] At the same time, the flow shelf area is based on the order set ∑γ d , confluence order set (D-∑γ d -∑β d ) and the set of replenishment bins ∑π t , select the best combination, i.e., the collection order, from the set of production orders in the flow rack area. The destination of the replenishment bin is determined according to the selection of the collection order.

[0138] More specifically, a second planning model is created. The optimization objectives of the second planning model may include: the picking box of the collection order is as full as possible; the number of orders cannot exceed the upper limit; the order cannot be split; the picking path in the flow shelf area is the shortest; the used volume is greater than w1 and less than 100%; the number of goods in the order does not exceed the upper limit of the number of goods.

[0139] In this embodiment, the parameters of the second planning model are as follows:

[0140] D: Order set (the set of orders produced by the flow rack area after flow distribution);

[0141] S: Commodity set (commodities in D);

[0142] T: A collection of bins for urgent replenishment;

[0143] P t : Picking point set (the set of storage points of inventory bins in the flow rack area);

[0144] P e : Collection of available storage locations in the flow rack area.

[0145] P e : Collection of unfilled storage locations in the flow rack area.

[0146] The number of bins stored in unfilled storage locations

[0147] V s : standard volume of commodity s, s∈S;

[0148] Xp Y p : Pick the coordinate point p, p∈P t ;

[0149] M ds : The demand for item s of order d, d∈D;

[0150] O ts : The inventory of commodity s in turnover box t, t∈T;

[0151] O ps : The inventory of product s at picking point p;

[0152] w1: volume lower limit threshold;

[0153] w2: penalty term (used to balance picking area and picking volume);

[0154] w3: the upper limit of the number of orders;

[0155] w4: upper threshold of picking quantity;

[0156] T: total volume of the material box;

[0157] In this embodiment, the variables of the objective function of the second planning model are as follows:

[0158] γ d : Whether order d is selected, γ d ∈{0,1}, select 1, otherwise 0;

[0159] α p : Whether the picking point p is selected, α p ∈{0,1}, select 1, otherwise 0;

[0160] π t : Whether turnover box t is selected, π t ∈{0,1}, select 1, otherwise 0;

[0161] α pt Whether the material box t selects the storage location p; (p is the storage location that is not full in the flow area, and the sku of p is equal to the sku of t)

[0162] In this embodiment, the objective function of the second planning model may be:

[0163]

[0164] In this embodiment, the constraint function of the second planning model may include:

[0165] Constraint (1): ∑V s *M ds *γ d >w1T

[0166] Constraint (2): ∑V s *M ds *γ d ≤T

[0167] Constraint (3): ∑γ d <w3

[0168] Constraint (4): ∑γ d *M ds <w4

[0169] Constraint (5):

[0170] Constraint (6):

[0171] Constraint (7): ∑α pt ≤1,

[0172] Constraint (8): ∑α pt -1<α p ,

[0173] Constraint (9):

[0174] Among them, constraint (1) indicates the lower limit of volume. Constraint (2) indicates the upper limit of volume. Constraint (3) indicates the upper limit of the number of orders. Constraint (4) indicates the upper limit of the total number of goods. Constraint (5) indicates that the picking quantity of product s is less than the inventory. Constraint (6) indicates that the number of bins in an unfilled flow area storage location p cannot exceed 3. Constraint (7) indicates that a bin t can only select one flow area storage location p. Constraint (8) indicates whether the picking point is picked. If there is a bin to choose, the point is chosen. Constraint (9) indicates that the number of empty storage location selections = the number of bins that are not selected to be filled.

[0175] Next, by solving the second planning model, we can obtain the orders and the location of the picking points contained in the collection order, that is, the collection order location strategy. We can loop the collection order location strategy and generate a collection order at a time until the set of pending orders in the second picking area is empty. If there is a replenishment bin at the picking point, an emergency replenishment task is generated for the bin. When all the emergency replenishment tasks are completed, the picking tasks of the collection order are issued.

[0176] Figure 4 The block diagram of an order processing device according to an embodiment of the present disclosure is schematically shown.

[0177] like Figure 4 As shown, the apparatus 400 may include an acquisition module 410 , a creation module 420 , a determination module 430 , and a selection module 440 .

[0178] The acquisition module 410 is used to acquire at least one pending order, operation data of the first picking area, and operation data of the second picking area.

[0179] The creation module 420 is used to create a first planning model according to at least one pending order, the operation data of the first picking area, and the operation data of the second picking area.

[0180] The determination module 430 is used to determine a flow allocation strategy for at least one to-be-processed order by using the first planning model.

[0181] The picking module 440 is used to pick goods in at least one to-be-processed order in the first picking area and the second picking area according to the flow distribution strategy.

[0182] According to an embodiment of the present disclosure, a flow allocation strategy for pending orders is determined through a first mathematical programming model, so that the orders are reasonably allocated to the first picking area and the second picking area according to the flow allocation strategy, thereby better utilizing the production capacity of the first picking area and the second picking area and improving production efficiency.

[0183] According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits, or at least part of the functions of any one of them can be implemented in one module. According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits can be split into multiple modules for implementation. According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits can be at least partially implemented as hardware circuits, such as field programmable gate arrays (FPGAs), programmable logic arrays (PLAs), systems on chips, systems on substrates, systems on packages, application specific integrated circuits (ASICs), or can be implemented by hardware or firmware in any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation methods of software, hardware, and firmware, or in any appropriate combination of any of them. Alternatively, according to the embodiments of the present invention, one or more of the modules, submodules, units, and subunits can be at least partially implemented as computer program modules, and when the computer program modules are run, the corresponding functions can be performed.

[0184] For example, any multiple of the acquisition module 410, the creation module 420, the determination module 430, and the picking module 440 can be combined in one module for implementation, or any one of the modules can be split into multiple modules. Alternatively, at least part of the functions of one or more of these modules can be combined with at least part of the functions of other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the acquisition module 410, the creation module 420, the determination module 430, and the picking module 440 can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application-specific integrated circuit (ASIC), or can be implemented by hardware or firmware such as any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation methods of software, hardware, and firmware, or in any appropriate combination of any of them. Alternatively, at least one of the acquisition module 410, the creation module 420, the determination module 430, and the picking module 440 can be at least partially implemented as a computer program module, and when the computer program module is run, the corresponding function can be performed.

[0185] Figure 5 The block diagram of a computer system suitable for implementing the method described above according to an embodiment of the present disclosure is schematically shown. Figure 5 The computer system shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0186] like Figure 5 As shown, the computer system 500 according to the embodiment of the present disclosure includes a processor 501, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 502 or the program loaded from the storage part 508 to the random access memory (RAM) 503. The processor 501 may include, for example, a general-purpose microprocessor (such as a CPU), an instruction set processor and / or a related chipset and / or a special-purpose microprocessor (for example, an application-specific integrated circuit (ASIC)), etc. The processor 501 may also include an onboard memory for caching purposes. The processor 501 may include a single processing unit or multiple processing units for performing different actions of the method flow according to the embodiment of the present disclosure.

[0187] In RAM 503, various programs and data required for the operation of system 500 are stored. Processor 501, ROM 502 and RAM 503 are connected to each other through bus 504. Processor 501 performs various operations of the method flow according to the embodiment of the present disclosure by executing the program in ROM 502 and / or RAM 503. It should be noted that the program can also be stored in one or more memories other than ROM 502 and RAM 503. Processor 501 can also perform various operations of the method flow according to the embodiment of the present disclosure by executing the program stored in the one or more memories.

[0188] According to an embodiment of the present disclosure, the system 500 may further include an input / output (I / O) interface 505, which is also connected to the bus 504. The system 500 may further include one or more of the following components connected to the I / O interface 505: an input section 506 including a keyboard, a mouse, etc.; an output section 507 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 508 including a hard disk, etc.; and a communication section 509 including a network interface card such as a LAN card, a modem, etc. The communication section 509 performs communication processing via a network such as the Internet. A drive 510 is also connected to the I / O interface 505 as needed. A removable medium 511, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 510 as needed, so that a computer program read therefrom is installed into the storage section 508 as needed.

[0189] According to an embodiment of the present disclosure, the method flow according to an embodiment of the present disclosure can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a computer-readable storage medium, and the computer program contains a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 509, and / or installed from the removable medium 511. When the computer program is executed by the processor 501, the above-mentioned functions defined in the system of the embodiment of the present disclosure are executed. According to an embodiment of the present disclosure, the system, equipment, device, module, unit, etc. described above can be implemented by a computer program module.

[0190] The present disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or may exist independently without being assembled into the device / apparatus / system. The above computer-readable storage medium carries one or more programs, and when the above one or more programs are executed, the method according to the embodiment of the present disclosure is implemented.

[0191] According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, for example, may include but is not limited to: 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), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, an apparatus or a device. For example, according to an embodiment of the present disclosure, a computer-readable storage medium may include the ROM 502 and / or RAM 503 described above and / or one or more memories other than ROM 502 and RAM 503.

[0192] The flow charts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0193] It will be appreciated by those skilled in the art that the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways, even if such combinations and / or combinations are not explicitly described in the present disclosure. In particular, the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways without departing from the spirit and teachings of the present disclosure. All of these combinations and / or combinations fall within the scope of the present disclosure.

[0194] The embodiments of the present disclosure are described above. However, these embodiments are only for illustrative purposes and are not intended to limit the scope of the present disclosure. Although the embodiments are described above separately, this does not mean that the measures in the various embodiments cannot be used in combination to advantage. The scope of the present disclosure is defined by the attached claims and their equivalents. Without departing from the scope of the present disclosure, those skilled in the art may make a variety of substitutions and modifications, which should all fall within the scope of the present disclosure.

Claims

1. An order processing method, comprising: Obtain at least one pending order, operation data of a first picking area, and operation data of a second picking area; creating a first planning model according to the at least one pending order, the operating data of the first picking zone, and the operating data of the second picking zone; Determine a flow allocation strategy for the at least one pending order by using the first planning model; as well as According to the flow distribution strategy, picking goods in the at least one pending order in the first picking area and the second picking area; The step of creating a first planning model according to the at least one pending order and the operation data includes: The first objective function is created according to the following formula: Among them, the is the first objective function, is the total number of merged orders assigned to the first picking area and the second picking area for joint processing, is the quantity of the first order assigned to the first picking zone for processing, The number of replenishment boxes required for the replenishment order. is the number of unfilled storage locations in the second picking area that the replenishment order needs to occupy, is the number of items in the replenishment order, is the number of items in the second order assigned to the second picking area for processing, is the preset weight, if ,if ,if ,if , wherein the The capacity of the first picking area, s, is the total amount of goods in the at least one pending order. is the utilization rate of the second picking area, and z is the utilization rate threshold; According to the first constraint condition, create a first constraint function; The first constraint condition includes at least one of the following constraints: Each of the at least one pending order can be assigned to only one of the first picking zone and the second picking zone; The quantity of goods in the order processed by the second picking area is less than the inventory of goods in the second picking area; The quantity of goods in the orders processed by the second picking area is less than the inventory of goods in the first picking area; Each unfilled storage location in the second picking area can store no more than 3 boxes; One material box corresponds to one storage location; The total number of replenishment bins without selecting a partial storage location is less than the number of empty storage locations; and The inventory of goods in the second picking area is greater than the safety stock.

2. The method according to claim 1, wherein: The operation data of the first picking area includes the remaining capacity of the first picking area, the types of goods in the first picking area, and the inventory of goods; The operation data of the second picking area includes the utilization rate of the second picking area, the types of goods and the inventory of goods in the second picking area, and the storage location occupancy information in the second picking area; The storage space occupancy information includes: empty storage spaces, and the types and quantities of goods in occupied storage spaces.

3. The method according to claim 1, wherein: The flow distribution strategy is used to classify each order in the at least one pending order as the first order, the second order, the merged order or the to-be-replenished order; The picking of the goods in the at least one pending order in the first picking area and the second picking area according to the flow distribution strategy includes: Moving the goods in the to-be-replenished order from the first picking area to the second picking area; The first picking area performs the goods picking operation for the first order, the second picking area performs the goods picking operation for the second order and the order to be replenished, and the first picking area and the second picking area jointly perform the goods picking operation for the merged order.

4. The method according to claim 3, wherein: The second picking area includes a fixed buffer area and a temporary buffer area; The step of moving the items in the replenishment order from the first picking area to the second picking area comprises: Transporting the goods that need to be replenished to the temporary buffer area; and Regularly transporting the goods in the temporary buffer area to the fixed buffer area; The goods picking operation of the second order and the to-be-replenished order performed by the second picking area includes: The items in the second order and the to-be-replenished order are picked in the fixed buffer.

5. The method according to claim 2, further comprising: creating a second planning model according to the orders to be processed in the second picking area and the second operation data of the second picking area; According to the second planning model, the orders to be processed in the second picking area are divided into at least one order set, and the picking points corresponding to the goods in the at least one order set are determined; as well as According to the at least one order set and the picking point, items in the orders to be processed in the second picking area are picked.

6. The method according to claim 5, wherein: The creating a second planning model according to the orders to be processed in the second picking area and the second operation data of the second picking area includes: The second objective function is created according to the following formula: in, is the second objective function, is the area of ​​the image enclosed by the selected points, is the number of picking points, is the total volume of the goods in the order set; and According to the second constraint condition, create a second constraint function; The second constraint condition includes at least one of the following constraints: The total volume of the goods in the order set is greater than a first volume threshold; The total volume of the goods in the order set is less than a second volume threshold; The number of orders to be processed in the second picking area is less than the order number threshold; The number of goods in the order to be processed in the second picking area is less than the threshold number of goods; The quantity of each item in the order to be processed in the second picking area is less than the inventory of the item in the second picking area; Each unfilled storage location in the second picking area can store no more than 3 containers; and One box corresponds to one storage location.

7. An order processing device, comprising: An acquisition module, configured to acquire at least one pending order, operation data of a first picking area, and operation data of a second picking area; a creation module, configured to create a first planning model according to the at least one pending order, the operation data of the first picking area, and the operation data of the second picking area; A determination module, configured to determine a flow allocation strategy for the at least one pending order by using the first planning model; as well as A picking module, configured to pick the goods in the at least one pending order in the first picking area and the second picking area according to the flow distribution strategy; The step of creating a first planning model according to the at least one pending order and the operation data includes: The first objective function is created according to the following formula: Among them, the is the first objective function, is the total number of merged orders assigned to the first picking area and the second picking area for joint processing, is the quantity of the first order assigned to the first picking zone for processing, The number of replenishment boxes required for the replenishment order. is the number of unfilled storage locations in the second picking area that the replenishment order needs to occupy, is the number of items in the replenishment order, is the number of items in the second order assigned to the second picking area for processing, is the preset weight, if ,if ,if ,if , wherein the The capacity of the first picking area, s, is the total amount of goods in the at least one pending order. is the utilization rate of the second picking area, and z is the utilization rate threshold; According to the first constraint condition, create a first constraint function; The first constraint condition includes at least one of the following constraints: Each of the at least one pending order can be assigned to only one of the first picking zone and the second picking zone; The quantity of goods in the order processed by the second picking area is less than the inventory of goods in the second picking area; The quantity of goods in the orders processed by the second picking area is less than the inventory of goods in the first picking area; Each unfilled storage location in the second picking area can store no more than 3 boxes; One material box corresponds to one storage location; The total number of replenishment bins without selecting a partial storage location is less than the number of empty storage locations; and The inventory of goods in the second picking area is greater than the safety stock.

8. A computing device comprising: one or more processors; a storage device for storing one or more programs, Wherein, when the one or more programs are executed by the one or more processors, the one or more processors are enabled to implement the method of any one of claims 1 to 6.

9. A computer-readable storage medium having executable instructions stored thereon, which, when executed by a processor, causes the processor to implement the method of any one of claims 1 to 6.