WO2022057248A1 - 订单处理方法、装置、设备、系统及存储介质 - Google Patents

订单处理方法、装置、设备、系统及存储介质 Download PDF

Info

Publication number
WO2022057248A1
WO2022057248A1 PCT/CN2021/087268 CN2021087268W WO2022057248A1 WO 2022057248 A1 WO2022057248 A1 WO 2022057248A1 CN 2021087268 W CN2021087268 W CN 2021087268W WO 2022057248 A1 WO2022057248 A1 WO 2022057248A1
Authority
WO
WIPO (PCT)
Prior art keywords
order
target
orders
original
group
Prior art date
Application number
PCT/CN2021/087268
Other languages
English (en)
French (fr)
Inventor
喻润方
艾鑫
Original Assignee
深圳市海柔创新科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳市海柔创新科技有限公司 filed Critical 深圳市海柔创新科技有限公司
Publication of WO2022057248A1 publication Critical patent/WO2022057248A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • G06Q10/0875—Itemisation or classification of parts, supplies or services, e.g. bill of materials
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G1/00—Storing articles, individually or in orderly arrangement, in warehouses or magazines
    • B65G1/02—Storage devices
    • B65G1/04—Storage devices mechanical
    • B65G1/137—Storage devices mechanical with arrangements or automatic control means for selecting which articles are to be removed
    • B65G1/1373—Storage devices mechanical with arrangements or automatic control means for selecting which articles are to be removed for fulfilling orders in warehouses
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
    • B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
    • B25J11/00—Manipulators not otherwise provided for
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B25—HAND TOOLS; PORTABLE POWER-DRIVEN TOOLS; MANIPULATORS
    • B25J—MANIPULATORS; CHAMBERS PROVIDED WITH MANIPULATION DEVICES
    • B25J9/00—Programme-controlled manipulators
    • B25J9/16—Programme controls
    • B25J9/1656—Programme controls characterised by programming, planning systems for manipulators
    • B25J9/1664—Programme controls characterised by programming, planning systems for manipulators characterised by motion, path, trajectory planning
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G1/00—Storing articles, individually or in orderly arrangement, in warehouses or magazines
    • B65G1/02—Storage devices
    • B65G1/04—Storage devices mechanical
    • B65G1/0492—Storage devices mechanical with cars adapted to travel in storage aisles
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
    • B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
    • B65G2209/00—Indexing codes relating to order picking devices in General
    • B65G2209/06—Use of order trucks

Definitions

  • the present disclosure relates to the field of intelligent warehousing, and in particular, to an order processing method, device, device, system and storage medium.
  • the user can send an order to the system, the order contains the information of the goods, and the system can send the order to the operating table.
  • the operating table is provided with multiple slots, and each slot can be used to place a The goods corresponding to the order, so that robots and pickers can process goods based on slots.
  • the slot is vacated, and the system can send another order to this slot. This cycle continues until all orders have been processed.
  • Embodiments of the present disclosure provide an order processing method, apparatus, device, system, and storage medium, which are used to solve the technical problem of low efficiency of warehouse delivery.
  • an order processing method including:
  • the original orders obtained by decomposing and the original orders to be processed are grouped and processed, and one or more target orders are regenerated.
  • the target order that has not been sorted is a target order that has not been sent to the operating table, or a target order that has been sent to the operating table but has not yet occupied a slot of the operating table.
  • the quantity of the original orders to be processed is one or more; decompose at least some of the found target orders into original orders, including:
  • the target order is the target order to be rolled back;
  • the target order to be rolled back is decomposed into original orders.
  • constraints of the group order include: the priority of each original order is the same, and/or the type is the same.
  • the method further includes:
  • the type of the original order is determined according to the quantity of the goods corresponding to the original order.
  • the original order obtained by decomposing and the original order to be processed are grouped, and one or more target orders are regenerated, including:
  • group order processing is performed on the group of original orders to generate one or more target orders.
  • the target order restriction conditions include: the total quantity of goods corresponding to any target order is not greater than a preset quantity threshold, and/or the total space occupied by the goods is not greater than a preset space threshold.
  • group order processing is performed on the group of original orders to generate one or more target orders, including:
  • For each group of original orders on the basis of satisfying the target order constraints, determine the final generated one by evaluating the total quantity of target orders obtained after the group order is processed, and/or the sum of the quantity of goods of the target order obtained. or multiple target orders.
  • the method further includes:
  • the total quantity of the target order obtained after processing the group order, and/or the obtained quantity of goods of the target order The sum, determine one or more final target orders, and determine one or more final target orders, including:
  • the ordering scheme includes one or more order grouping schemes obtained by processing the original orders of the group target order;
  • the method further includes:
  • the original order to be processed will be grouped to generate one or more target orders.
  • the method further includes:
  • one target order is selected from the target orders that have not been sorted and allocated to the free slot.
  • an order processing apparatus including:
  • a search module configured to search for a target order that has not been sorted, wherein the target order is obtained by processing multiple original orders
  • a decomposition module used to decompose at least some of the found target orders into original orders
  • the order grouping module is used to perform order grouping processing on the decomposed original orders and the original orders to be processed, and regenerate one or more target orders.
  • an embodiment of the present disclosure provides a control device, including:
  • a memory communicatively coupled to the at least one processor
  • the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to cause the control device to perform the method according to any one of the first aspects.
  • an embodiment of the present disclosure provides a storage system, including the control device, the operating table, and the robot described in the third aspect;
  • the operation console is used to obtain the target order sent by the control device and display it to the picking personnel;
  • the robot is used to obtain the picking task sent by the control device according to the target order, and take out the goods corresponding to the target order from the warehouse according to the picking task, so that the picking personnel can pick up the corresponding goods. put the goods into the slots of the operating table.
  • an embodiment of the present disclosure provides a computer-readable storage medium, where computer-executable instructions are stored in the computer-readable storage medium, and when a processor executes the computer-executable instructions, any one of the first aspect is implemented the method described.
  • an embodiment of the present disclosure provides a computer program product, including a computer program, which implements the method according to any one of the first aspects when the computer program is executed.
  • the order processing method, device, device, system, and storage medium provided by the embodiments of the present disclosure can obtain original orders to be processed, and search for target orders that have not been sorted, wherein the target orders are obtained by grouping multiple original orders. order processing, decompose at least some of the target orders found into original orders, process the original orders obtained by decomposing and the original orders to be processed, and regenerate one or more target orders, which can realize dynamic rollback Form order, so that the newly arrived original order can be processed with the target order that has not yet been sorted, which effectively improves the efficiency of delivery.
  • FIG. 1 is a schematic diagram of an application scenario provided by an embodiment of the present disclosure
  • FIG. 2 is a schematic flowchart of an order processing method provided by an embodiment of the present disclosure
  • FIG. 3 is a schematic flowchart of another order processing method provided by an embodiment of the present disclosure.
  • FIG. 4 is a schematic diagram of the principle of a group order processing provided by an embodiment of the present disclosure.
  • FIG. 5 is a schematic flowchart of another order processing method provided by an embodiment of the present disclosure.
  • FIG. 6 is a schematic structural diagram of an order processing apparatus according to an embodiment of the present disclosure.
  • FIG. 7 is a schematic structural diagram of a control device according to an embodiment of the present disclosure.
  • FIG. 1 is a schematic diagram of an application scenario provided by an embodiment of the present disclosure.
  • an operating table 1 and a robot 2 can be set in the storage system.
  • the number of the operating table 1 and the robot 2 can be one or more.
  • Each operating table 1 may include a plurality of slots 10 for placing goods 5 .
  • the robot 2 may be provided with a backpack or the like, and can carry the cargo 5 to move.
  • Both the robot 2 and the console 1 can communicate with a control device 3, and the control device 3 can be a server, a terminal device, or the like.
  • the control device 3 can allocate the order to the slot 10 of the console 1, and notify the robot 2 to transport the goods 5 required by the order from the warehouse shelf to the vicinity of the console 1. 4.
  • the dotted lines in the figure indicate that the goods 5 are moved from the robot 2 into the corresponding slots 10 .
  • the goods 5 can be sent for secondary sorting or packing.
  • the control device 3 can allocate another order to this slot 10 . This cycle continues until all orders are placed and picking is complete.
  • the number of slots 10 in the console 1 is limited. In the case that each order issued by the user occupies one slot 10 , the number of orders that can be processed simultaneously by the console 1 is not greater than the number of slots 10 in the console 1 . Then, the types of goods 5 that the robot 2 can carry is limited. When there are enough robots 2, some robots 2 will be idle, so that the robot 2 cannot be fully utilized, and ultimately the overall delivery efficiency of the system is low.
  • multiple obtained original orders can be grouped to obtain one or more target orders, and the target orders can be sent to the console 1 for processing.
  • One target order can be processed, so that multiple original orders can be processed in batches to improve the efficiency of delivery.
  • the target orders that have not been processed by the operation console 1 can be searched, and at least some of the found target orders can be broken up, processed with the newly acquired original orders, and regenerated.
  • One or more target orders, so that the newly obtained batch of original orders can be combined with the previous target orders to further improve the efficiency of delivery.
  • FIG. 2 is a schematic flowchart of an order processing method provided by an embodiment of the present disclosure.
  • the execution subject of the method in this embodiment may be a control device.
  • the order processing method in this embodiment may include:
  • Step 201 Obtain the original order to be processed.
  • the original order to be processed may be sent by the user, or may be automatically generated by the control device, for example, the original order for delivery is generated at regular intervals.
  • the number of the original orders to be processed may be one or more.
  • Step 202 searching for target orders that have not been sorted, wherein the target orders are obtained by processing multiple original orders.
  • the target order in this step may be generated before step 201 .
  • the target order is an order obtained after the original order is assembled and processed.
  • order grouping may refer to combining multiple original orders according to a certain strategy to obtain one or more target orders.
  • each target order includes multiple original orders, but in some extreme cases, it is not excluded that some target orders include only one original order.
  • the one or more target orders may be sent to the operation table for processing, wherein each slot of the operation table may be allocated one target order.
  • target orders that have not been sorted can be searched.
  • the unsorted target order may be a target order that has not yet occupied a slot of the operating table.
  • control device only sends the target order to the operation table when there is a free slot on the operating table. After the target order occupies the free slot, the robot and the picking personnel will not be able to identify the target order. Process and cooperate to place the goods required by the target order in the slots.
  • the target order that has not been sorted may be the target order that has not been sent to the operation station.
  • the logic of the scheme is simple and error-prone. For the convenience of description, this processing manner is used as an example in each embodiment of the present disclosure for description.
  • the control device can send the target order to the console. If there is currently no free slot on the console, the target order is stored in the console. Cache is performed, and when there are free slots, the target order is allocated to the free slots.
  • the unsorted target order may be the target order that has been sent to the operating table but has not yet occupied the slot of the operating table, and the operating table may feed back to the control device whether the target order currently occupies the slot.
  • the solution enables the operating console to obtain target orders to be processed in time and arrange to process the target orders when there are free slots, thereby improving the efficiency of allocating target orders to slots when the slots are free.
  • Step 203 Decompose at least some of the found target orders into original orders.
  • target orders that meet certain conditions among the found target orders may be selected and decomposed into original orders. Said conditions are not limiting.
  • the selected target order may be a target order in which the original order can be combined with the original order to be processed, so that the original order obtained after being decomposed can be combined with the original order to be processed.
  • the split operation may not be performed.
  • step 204 the decomposed original orders and the original orders to be processed are processed into order groups, and one or more target orders are regenerated.
  • the decomposed original orders and the original orders to be processed are regarded as the original orders of a new whole batch of orders to be grouped. These original orders can be grouped according to the strategy of generating target orders before, and the target orders can be regenerated. Replaces the previously decomposed target order.
  • the number of regenerated target orders can be the same as the number of split target orders, or it can be different.
  • the operation table includes 9 slots, and each slot can be used to process 1 target order. Then, 9 target orders can be selected and sent to the operation console.
  • a new batch of original orders may be received from the user.
  • there are 20 new original orders, and there are 15-9 6 target orders that have not been sorted yet.
  • 10 original orders are obtained by decomposition, and then the 10 original orders obtained by decomposition are combined with the newly arrived 20 original orders for order processing.
  • the number of new target orders may be more than or equal to 2, but generally not less than the number of split target orders.
  • one target order may be selected from target orders that have not been sorted and allocated to the free slot. After the target order is allocated to the free slot, the slot is occupied, the slot enters the non-idle state, and the robot and the picking staff place the goods required by the target order in the free slot to complete the target order. sorting.
  • the unsorted target orders become 8.
  • the aforementioned steps can be repeated according to the current 8 unsorted target orders and a new batch of original orders, so as to efficiently and orderly process the orders.
  • the goods When the goods required by the target order are collected in the slot, the goods can be taken out and sent to secondary sorting.
  • the secondary sorting can pick out the goods required for each original order from the collected goods, and then can be sent to To pack out the library.
  • the order processing method provided in this embodiment can obtain original orders to be processed and search for target orders that have not been sorted, wherein the target orders are obtained by processing multiple original orders, and at least part of the found
  • the target order is decomposed into original orders, the decomposed original orders and the original orders to be processed are grouped, and one or more target orders are regenerated, which can realize dynamic rollback of group orders, so that the new original orders can Group order processing with target orders that have not yet been sorted can effectively improve the efficiency of warehouse delivery.
  • FIG. 3 is a schematic flowchart of another order processing method provided by an embodiment of the present disclosure. This embodiment implements the group order processing based on the technical solutions provided by the foregoing embodiments and through some restrictions. As shown in Figure 3, the method includes:
  • Step 301 Obtain the original order to be processed.
  • Step 302 search for target orders that have not been sorted, wherein the target orders are obtained by processing multiple original orders.
  • Step 303 Among the found target orders, if the original order corresponding to any target order and at least one original order to be processed satisfy the order restriction condition, then determine that the target order is the target order to be rolled back.
  • any number of original orders can be combined only if they meet the group order restrictions. Multiple original orders that do not meet the group order restrictions cannot appear in the same target order.
  • the order restriction conditions may include: the priority of each original order is the same, and/or the type is the same. For example, if 3 original orders have the same priority, then these 3 original orders meet the order restriction conditions; if one of the 3 original orders has high priority and the other 2 have low priority, then The 1 original order with high priority and the other 2 do not meet the group order restrictions and cannot be combined together, but the 2 low priority original orders meet the group order restrictions and can be combined.
  • the priority of the original order may be determined according to the delivery deadline of the original order; and/or the type of the original order may be determined according to the quantity of goods corresponding to the original order.
  • the original orders with the same or similar delivery deadlines can have the same priority.
  • the types of original orders can include multi-product orders and single-product orders, where a multi-product order means that the order requires more than one item, and a single-item order means that the order requires only one item. Combining single-product orders and multi-product orders separately can effectively improve the efficiency of secondary sorting.
  • the priority and type of the original order can be determined in other ways.
  • the priority can be set by the user, or determined according to the importance of the goods in the order; another example, the type can include fragile goods orders and non-fragile goods orders in addition to multi-item orders and single-item orders, etc. .
  • the group order restrictions are not limited to priority and type, and other restrictions can also be extended according to actual needs. For example, orders may have different outbound points, and the group order restrictions can be set to include the same outbound point to further improve. Outbound efficiency.
  • the above group order restrictions can be considered. Therefore, multiple original orders in each target order should meet the group order restrictions.
  • the group order restriction condition when judging whether the original order corresponding to any target order and the at least one original order to be processed satisfy the group order restriction condition, it can only be judged whether one original order in the target order is related to a certain one to be processed. Or several original orders satisfy the group order restriction condition, if so, it can be determined that all the original orders in the target order and the one or several original orders satisfy the group order restriction condition. If the order restriction condition is satisfied, the target order is determined to be the target order to be rolled back.
  • the first target order is the target order to be rolled back. If any of the original orders and c in the second target order meet the group order restrictions, the second target order is also the target order to be rolled back.
  • Step 304 Decompose the target order to be rolled back into original orders.
  • steps 303 to 304 at least part of the found target orders can be decomposed into original orders.
  • Step 305 perform grouping processing on the original order obtained by decomposition and the original order to be processed, and regenerate one or more target orders.
  • FIG. 4 is a schematic diagram of the principle of a group order processing provided by an embodiment of the present disclosure.
  • Target order 1 includes 3 original orders
  • both target orders 2 and 3 include 2 original orders.
  • the small squares in the target order represent the original orders included in the target order.
  • Orders, the original orders of the same shaded pattern belong to the original orders that meet the group order restrictions, and all the original orders in a target order should meet the group order restrictions.
  • target order 1 and target order 2 can be decomposed into the 5 original orders before the group order, and the decomposed 5 original orders and the new 5 original orders can be re-grouped to obtain target order 4, target order Order 5 and target order 6, together with the previous target order 3, are regarded as the currently unsorted target orders. If there are free slots on the operating table, select the target order from them and send them to the operating table for processing.
  • performing grouping processing on the decomposed original orders and the original orders to be processed, and regenerating one or more target orders which may include: dividing the original orders obtained by decomposition and the original orders to be processed. For multiple groups, each original order of each group satisfies the group order restriction conditions; for each group of original orders, on the basis of satisfying the target order restriction conditions, the group order processing is performed on the original orders of the group to generate one or more targets Order.
  • the decomposed original orders and the original orders to be processed may be put into the original order pool, and then the original orders in the original order pool are divided into multiple groups. For each group, all original orders within the group meet the group order constraints.
  • the target order restriction conditions may include: the total quantity of goods corresponding to any target order is not greater than a preset quantity threshold, and/or the total space occupied by the goods is not greater than a preset space threshold.
  • the preset quantity threshold may be the quantity of goods that can be accommodated in one slot of the console
  • the preset space threshold may be the accommodation space of one slot, so as to ensure that the generated target order can adapt to the slot and ensure the order are processed normally.
  • the order processing method provided by the embodiment of the present disclosure can, in the found target orders, determine whether the original order corresponding to the target order and at least one original order to be processed satisfy the order restriction condition, and then determine whether the target order needs to be decomposed into The original order and participating in the subsequent order group processing can decompose and process the target order that can be grouped with the original order to be processed, without the need to decompose all the target orders, which effectively improves the efficiency of order processing.
  • the embodiments of the present disclosure further provide an optional group order policy.
  • group order processing is performed on the group of original orders to generate one or more target orders, which may include: for each group of original orders, after meeting the target order
  • one or more final target orders are determined by evaluating the total quantity of target orders obtained after processing the group order, and/or the sum of the quantity of goods of the target order obtained.
  • the goal of assembling the original orders can be: the fewer target orders are formed, the better, because each target order occupies a slot, and the fewer target orders are formed, the fewer slots are needed, It means that the operation table can handle more demands at the same time; the less the sum of the total number of types of goods required for the formed target order, the better, because the smaller the sum of the number of types of goods, the more types of goods the robot needs to move. Less, can reduce the re-take rate of goods types.
  • the obtained sum of the types and quantities of goods of the target order may be a result obtained by directly adding the types and quantities of goods of each target order.
  • the goods can be represented by SKU (Stock Keeping Unit, stock keeping unit), SKU is the unit of inventory in and out measurement, and the type of goods can refer to the type of SKU, and different SKUs correspond to different types.
  • the quantity of goods of the target order can be determined;
  • the number of the types of goods is directly added to obtain the sum of the number of types of goods.
  • target order No. 1 contains 2 original orders, one of which includes goods A and B, and the other original order includes goods B and C. Therefore, target order No. 1 contains types of goods including A, B, and C. , then, the quantity of goods of target order No. 1 is 3.
  • the goods types of all original orders include A, B, C, and D, and the total number of goods types is 4. Therefore, the sum of the quantity of goods of the target order is not necessarily equal to the quantity of goods of all original orders before the order.
  • the robot handles the goods according to the target order. Even if the same type of goods exists between different target orders, it is considered that the total number of goods types is increased.
  • the sum of the types of goods in the target order can be made as small as possible, and the goods of the same type are often stored together in the warehouse. Therefore, the smaller the sum of the types and quantities of goods, the overall time it takes for the robot to pick up the goods. less.
  • the final generated one or more target orders may include: for each group of original orders, on the basis of satisfying the target order constraints, determine all possible order group schemes, wherein the group order scheme includes One or more target orders obtained after the original order is grouped; for any grouping scheme, the calculated score corresponding to the total quantity of target orders, and/or, the calculated sum of the goods types and quantities of the target order Corresponding score; according to the calculated score, determine the final selection plan.
  • the group of original orders can find out all possible order grouping schemes, and then, by scoring, from all possible ordering schemes choose the optimal solution.
  • the optimal solution can be selected only according to the score corresponding to the total quantity, or only according to the score corresponding to the sum of the types and quantities of goods.
  • the score corresponding to the total quantity and the score corresponding to the sum of the number of types of goods can also be weighted and summed to obtain the total score, and the highest total score is selected as the final selected order plan, which can accurately select multiple orders from multiple orders.
  • the optimal solution is selected from the scheme to ensure the delivery effect.
  • group order processing can also be implemented through other group order policies.
  • the target order to which each original order belongs may be determined in a sequential distribution manner.
  • the first original order is first attributed to the first target order, and then it is judged whether the second original order and the first original order contain the same kind of goods, and if so, the second original order is attributed to the first target order.
  • the first target order otherwise, a new target order is added, and the second original order is attributed to the new target order. And so on until all orders are processed.
  • target order restrictions and the like can also be considered.
  • the above provides the order formation strategy when the original order is newly obtained.
  • the original order obtained for the first time that is, when there is no target order before
  • the original order obtained for the first time can also be processed in a similar way. Group order operation.
  • FIG. 5 is a schematic flowchart of still another order processing method provided by an embodiment of the present disclosure. Based on the technical solutions provided by the above-mentioned embodiments, this embodiment provides a process for starting processing from the first batch of original orders obtained. As shown in Figure 5, the order processing method may include:
  • Step 501 Obtain a batch of original orders sent by the user.
  • Step 502 Divide all the obtained original orders into multiple groups according to the group order restriction conditions.
  • Step 503 Perform group order processing on each group of original orders to obtain one or more target orders.
  • the group order must meet the target order restriction conditions, for example, the quantity of goods in the formed target order must be less than a certain threshold, etc.
  • the goal of assembling the order can be: the total quantity of the target order obtained after assembling the order is as small as possible, and the sum of the quantity of goods of the target order obtained is as small as possible.
  • Step 504 Select a target order based on the number of free slots on the console and send it to the console.
  • the selected strategy is not limited.
  • the one with higher priority can be sent to the console first.
  • Step 505 assign a corresponding picking task to the robot.
  • the picking task may include the information of the goods included in the target order sent to the operation console, such as the identification of the goods, the storage location, and the like.
  • the robot After the robot obtains the task of picking up the goods, it can take out the goods from the warehouse shelves and send them to the corresponding operation table, and the picking personnel will complete the picking.
  • Step 506 When a new batch of original orders is obtained, group the batch of original orders according to the group order restriction conditions, and for each group of original orders, find out whether there are target orders that have not been sent to the operation desk, and whether there is an order that can be grouped together.
  • the original order if it does not exist, the group of original orders will be organized by itself, and one or more target orders will be obtained; if it exists, the corresponding target order will be decomposed into the original orders before the group order, and then the group of original orders will be processed. Group order processing, get one or more target orders. Then, return to step 504 again.
  • the original orders when the first batch of original orders is obtained, the original orders can be grouped to obtain one or more target orders, and each time a new batch of original orders is obtained subsequently, If there is a target order that meets the requirements, the target order can be decomposed, and the decomposed original order and a new batch of original orders can be grouped for order processing. If there is no target order that meets the requirements, a new batch of original orders You can process the order by yourself. In any case, you can use a similar method to process the order, so that in the process of continuously obtaining the original order, the principle of the generated target order is always the same, and the process of goods delivery can be smooth. , in an orderly manner.
  • FIG. 6 is a schematic structural diagram of an order processing apparatus according to an embodiment of the present disclosure. As shown in Figure 6, the apparatus may include:
  • a search module 602 configured to search for target orders that have not been sorted, wherein the target orders are obtained by processing multiple original orders;
  • a decomposition module 603, configured to decompose at least some of the found target orders into original orders
  • the order forming module 604 is configured to process the original order obtained by decomposition and the original order to be processed, and regenerate one or more target orders.
  • the unsorted target order is a target order that has not been sent to the operating table, or a target order that has been sent to the operating table but has not yet occupied a slot of the operating table.
  • the number of the original orders to be processed is one or more; the search module 602 is specifically used for:
  • the target order is determined to be the target order to be rolled back;
  • the target order to be rolled back is decomposed into original orders.
  • the order restriction condition includes: the priority of each original order is the same, and/or the type is the same.
  • the search module 602 is further configured to:
  • the type of the original order is determined according to the quantity of the goods corresponding to the original order.
  • the grouping module 604 is specifically used for:
  • group order processing is performed on the group of original orders to generate one or more target orders.
  • the target order restriction conditions include: the total quantity of goods corresponding to any target order is not greater than a preset quantity threshold, and/or the total space occupied by the goods is not greater than a preset space threshold.
  • the group order module 604 performs group order processing on the original orders of the group, and when generating one or more target orders, it is specifically used for:
  • one or more target orders finally generated are determined by evaluating the total quantity of target orders obtained after the order grouping is processed, and/or the sum of the quantity of goods of the obtained target order.
  • the grouping module 604 is further configured to:
  • the order grouping module 604 evaluates the total quantity of the target order obtained after the order grouping process is processed, and/or, on the basis of satisfying the target order restriction conditions, and/or, the obtained goods category of the target order The sum of the quantities is used to determine one or more target orders that are finally generated. When determining one or more target orders that are finally generated, it is specifically used for:
  • the order assembling scheme includes one or more target orders obtained after the grouping of the original orders of the group;
  • the grouping module 604 is further configured to:
  • the original order to be processed will be grouped to generate one or more target orders.
  • the grouping module 604 is further configured to:
  • one target order is selected from the unsorted target orders and allocated to the free slot.
  • the apparatus provided in this embodiment can be used to implement the technical solutions of the method embodiments shown in FIG. 1 to FIG. 5 , and the implementation principles and technical effects thereof are similar, and details are not described herein again in this embodiment.
  • FIG. 7 is a schematic structural diagram of a control device according to an embodiment of the present disclosure. As shown in FIG. 7 , the control device in this embodiment may include:
  • At least one processor 701 At least one processor 701; and
  • a memory 702 in communication with the at least one processor
  • the memory 702 stores instructions that can be executed by the at least one processor 701, and the instructions are executed by the at least one processor 701, so that the control device executes the method described in any of the foregoing embodiments. method.
  • the memory 702 may be independent or integrated with the processor 701 .
  • An embodiment of the present disclosure further provides a storage system, including the control device described in any of the foregoing embodiments, an operation table, and a robot.
  • the operation console is used to obtain the target order sent by the control device and display it to the picking personnel. For example, it can be displayed that the order in slot 1 includes: 5 pieces of A goods and 10 pieces of B goods.
  • the robot is used to obtain the picking task sent by the control device according to the target order, and take out the goods corresponding to the target order from the warehouse according to the picking task, so that the picking personnel can pick up the corresponding goods. put the goods into the slots of the operating table.
  • Embodiments of the present disclosure further provide a computer-readable storage medium, where computer-executable instructions are stored in the computer-readable storage medium, and when a processor executes the computer-executable instructions, the method described in any of the foregoing embodiments is implemented. .
  • An embodiment of the present disclosure provides a computer program product, including a computer program, which, when executed, implements the method described in any of the foregoing embodiments.
  • the disclosed apparatus and method may be implemented in other manners.
  • the device embodiments described above are only illustrative.
  • the division of the modules is only a logical function division. In actual implementation, there may be other division methods.
  • multiple modules may be combined or integrated. to another system, or some features can be ignored, or not implemented.
  • the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or modules, and may be in electrical, mechanical or other forms.
  • modules described as separate components may or may not be physically separated, and the components shown as modules may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to implement the solution of this embodiment.
  • each functional module in each embodiment of the present disclosure may be integrated in one processing unit, or each module may exist physically alone, or two or more modules may be integrated in one unit.
  • the units formed by the above modules can be implemented in the form of hardware, or can be implemented in the form of hardware plus software functional units.
  • the above-mentioned integrated modules implemented in the form of software functional modules may be stored in a computer-readable storage medium.
  • the above-mentioned software function modules are stored in a storage medium, and include several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor to execute some steps of the methods described in the various embodiments of the present disclosure.
  • processor may be a central processing unit (Central Processing Unit, referred to as CPU), or other general-purpose processors, digital signal processors (Digital Signal Processor, referred to as DSP), application specific integrated circuit (Application Specific Integrated Circuit, Referred to as ASIC) and so on.
  • CPU Central Processing Unit
  • DSP Digital Signal Processor
  • ASIC Application Specific Integrated Circuit
  • a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the steps of the method disclosed in conjunction with the invention can be directly embodied as executed by a hardware processor, or executed by a combination of hardware and software modules in the processor.
  • the memory may include high-speed RAM memory, and may also include non-volatile storage NVM, such as at least one magnetic disk memory, and may also be a U disk, a removable hard disk, a read-only memory, a magnetic disk or an optical disk, and the like.
  • NVM non-volatile storage
  • the bus can be an Industry Standard Architecture (ISA for short) bus, a Peripheral Component Interconnect (PCI for short) bus, or an Extended Industry Standard Architecture (EISA for short) bus, or the like.
  • ISA Industry Standard Architecture
  • PCI Peripheral Component Interconnect
  • EISA Extended Industry Standard Architecture
  • the bus can be divided into address bus, data bus, control bus and so on.
  • the buses in the drawings of the present disclosure are not limited to only one bus or one type of bus.
  • the above-mentioned storage medium may be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read only memory (EEPROM), erasable Except programmable read only memory (EPROM), programmable read only memory (PROM), read only memory (ROM), magnetic memory, flash memory, magnetic disk or optical disk.
  • SRAM static random access memory
  • EEPROM electrically erasable programmable read only memory
  • EPROM erasable except programmable read only memory
  • PROM programmable read only memory
  • ROM read only memory
  • magnetic memory flash memory
  • flash memory magnetic disk or optical disk.
  • a storage medium can be any available medium that can be accessed by a general purpose or special purpose computer.
  • An exemplary storage medium is coupled to the processor, such that the processor can read information from, and write information to, the storage medium.
  • the storage medium can also be an integral part of the processor.
  • the processor and the storage medium may be located in Application Specific Integrated Circuits (ASIC for short).
  • ASIC Application Specific Integrated Circuits
  • the processor and the storage medium may also exist in the electronic device or the host device as discrete components.

Landscapes

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

Abstract

本公开实施例提供一种订单处理方法、装置、设备、系统及存储介质，其中方法包括：获取待处理的原始订单；查找还未分拣的目标订单，其中，所述目标订单通过对多个原始订单进行组单处理得到；将查找到的至少部分目标订单分解为原始订单；将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单。本公开实施例提供的订单处理方法、装置、设备、系统及存储介质，能够实现动态回滚组单，使得新到来的原始订单可以与当前还未分拣的目标订单进行组单处理，有效提高了出库效率。

Description

订单处理方法、装置、设备、系统及存储介质
本公开要求于2020年9月17日提交中国专利局、申请号为202010976537.7、申请名称为“订单处理方法、装置、设备、系统及存储介质”的中国专利申请的优先权，其全部内容通过引用结合在本公开中。
技术领域
本公开涉及智能仓储领域，尤其涉及一种订单处理方法、装置、设备、系统及存储介质。
背景技术
随着智能仓储技术的不断发展，社会对仓储的需求也在不断增加。如何保证货物快速出库成为热点问题。
在目前的智能仓储系统中，用户可以向系统发送订单，订单中包含货物的信息，系统可以将订单下发给操作台，操作台设置有多个槽位，每个槽位可以用于放置一个订单对应的货物，从而机器人和拣货人员可以基于槽位实现货物的处理。当某个槽位对应的订单拣货完成后，该槽位空出，系统可以再发一个订单到这个槽位。如此循环，直到所有订单都被处理完。
由于操作台的槽位数量有限，因此每个操作台同时处理的订单数量有限，导致出库效率较低。
发明内容
本公开实施例提供一种订单处理方法、装置、设备、系统及存储介质，用于解决出库效率较低的技术问题。
第一方面，本公开实施例提供一种订单处理方法，包括：
获取待处理的原始订单；
查找还未分拣的目标订单，其中，所述目标订单通过对多个原始订单进行组单处理得到；
将查找到的至少部分目标订单分解为原始订单；
将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单。
在一种可能的设计中，所述还未分拣的目标订单为还未发送到操作台的目标订单，或者，已发送到操作台但还未占用操作台的槽位的目标订单。
在一种可能的设计中，所述待处理的原始订单的数量为一个或多个；将查找到的至少部分目标订单分解为原始订单，包括：
在查找到的目标订单中，若任一目标订单对应的原始订单与待处理的至少一个原 始订单满足组单限制条件，则确定所述目标订单为待回滚的目标订单；
将所述待回滚的目标订单分解为原始订单。
在一种可能的设计中，所述组单限制条件包括：各个原始订单的优先级相同，和/或，类型相同。
在一种可能的设计中，所述方法还包括：
根据原始订单的出库截止时间，确定所述原始订单的优先级；和/或，
根据原始订单对应的货物的数量，确定所述原始订单的类型。
在一种可能的设计中，将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单，包括：
将分解得到的原始订单以及所述待处理的原始订单划分为多组，每组的各个原始订单满足组单限制条件；
对于每组原始订单，在满足目标订单限制条件的基础上，将所述组的原始订单进行组单处理，生成一个或多个目标订单。
在一种可能的设计中，所述目标订单限制条件包括：任一目标订单对应的货物总数量不大于预设数量阈值，和/或，货物总占用空间不大于预设空间阈值。
在一种可能的设计中，对于每组原始订单，在满足目标订单限制条件的基础上，将所述组的原始订单进行组单处理，生成一个或多个目标订单，包括：
对于每组原始订单，在满足目标订单限制条件的基础上，通过评价组单处理后得到的目标订单的总数量，和/或，得到的目标订单的货物种类数量之和，确定最终生成的一个或多个目标订单。
在一种可能的设计中，所述方法还包括：
针对组单处理后得到的目标订单中的每一目标订单，根据所述目标订单包含的原始订单对应的货物种类，确定所述目标订单的货物种类数量；
将得到的各个目标订单的货物种类数量直接相加，得到所述货物种类数量之和。
在一种可能的设计中，对于每组原始订单，在满足目标订单限制条件的基础上，通过评价组单处理后得到的目标订单的总数量，和/或，得到的目标订单的货物种类数量之和，确定最终生成的一个或多个目标订单，确定最终生成的一个或多个目标订单，包括：
对于每组原始订单，在满足目标订单限制条件的基础上，确定所有可能的组单方案，其中，所述组单方案包括对所述组的原始订单进行组单处理后得到的一个或多个目标订单；
对于任一组单方案，计算得到的目标订单的总数量对应的评分，和/或，计算得到的目标订单的货物种类数量之和对应的评分；
根据计算得到的评分，确定最终选择的组单方案。
在一种可能的设计中，所述方法还包括：
若不存在还未分拣的目标订单，或者，还未分拣的目标订单中不存在待回滚的目标订单，则将待处理的原始订单进行组单处理，生成一个或多个目标订单。
在一种可能的设计中，所述方法还包括：
在操作台存在至少一空闲槽位时，对于每一空闲槽位，从还未分拣的目标订单中 选择一个目标订单分配给所述空闲槽位。
第二方面，本公开实施例提供一种订单处理装置，包括：
获取模块，用于获取待处理的原始订单；
查找模块，用于查找还未分拣的目标订单，其中，所述目标订单通过对多个原始订单进行组单处理得到；
分解模块，用于将查找到的至少部分目标订单分解为原始订单；
组单模块，用于将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单。
第三方面，本公开实施例提供一种控制设备，包括：
至少一个处理器；以及
与所述至少一个处理器通信连接的存储器；
其中，所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述控制设备执行如第一方面任一项所述的方法。
第四方面，本公开实施例提供一种仓储系统，包括第三方面所述的控制设备、操作台以及机器人；
所述操作台用于获取所述控制设备发送的目标订单并显示给拣货人员；
所述机器人用于获取所述控制设备根据所述目标订单发送的取货任务，并根据所述取货任务从仓库中取出所述目标订单对应的货物，供所述拣货人员将所述对应的货物放入所述操作台的槽位中。
第五方面，本公开实施例提供一种计算机可读存储介质，所述计算机可读存储介质中存储有计算机执行指令，当处理器执行所述计算机执行指令时，实现如第一方面任一项所述的方法。
第六方面，本公开实施例提供一种计算机程序产品，包括计算机程序，所述计算机程序被执行时实现如第一方面任一项所述的方法。
本公开实施例提供的订单处理方法、装置、设备、系统及存储介质，可以获取待处理的原始订单，查找还未分拣的目标订单，其中，所述目标订单通过对多个原始订单进行组单处理得到，将查找到的至少部分目标订单分解为原始订单，将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单，能够实现动态回滚组单，使得新到来的原始订单可以与当前还未分拣的目标订单进行组单处理，有效提高了出库效率。
附图说明
为了更清楚地说明本公开实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作一简单地介绍，显而易见地，下面描述中的附图是本公开的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动性的前提下，还可以根据这些附图获得其它的附图。
图1为本公开实施例提供的一种应用场景示意图；
图2为本公开实施例提供的一种订单处理方法的流程示意图；
图3为本公开实施例提供的另一种订单处理方法的流程示意图；
图4为本公开实施例提供的一种组单处理的原理示意图；
图5为本公开实施例提供的又一种订单处理方法的流程示意图；
图6为本公开实施例提供的一种订单处理装置的结构示意图；
图7为本公开实施例提供的一种控制设备的结构示意图。
具体实施方式
为使本公开实施例的目的、技术方案和优点更加清楚，下面将结合本公开实施例中的附图，对本公开实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例是本公开一部分实施例，而不是全部的实施例。基于本公开中的实施例，本领域普通技术人员在没有作出创造性劳动前提下所获得的所有其它实施例，都属于本公开保护的范围。
图1为本公开实施例提供的一种应用场景示意图。如图1所示，为了提升出库效率，可以在仓储系统中设置操作台1和机器人2。操作台1和机器人2的数量均可以为一个或多个。每个操作台1可以包括多个槽位10，槽位10用于放置货物5。机器人2可以设置有背篓等，能够携带货物5移动。
机器人2、操作台1均可以与控制设备3进行通信，所述控制设备3可以为服务器、终端设备等。控制设备3在获取到用户下发的订单后，可以为操作台1的槽位10分配订单，并通知机器人2将订单需要的货物5从仓库货架上搬运至操作台1附近，由拣货人员4将机器人2搬运来的货物5放置到操作台1的槽位10中。图中的虚线表示货物5从机器人2身上被移动到相应的槽位10中。当槽位10内的货物5集齐后，可以将货物5送去二次分拣或打包。当某个槽位10空出后，控制设备3可以再分配一个订单到这个槽位10。如此循环，直到所有订单都发出且拣货完成。
因为操作台1的槽位10数量有限。在用户下发的每个订单占用一个槽位10的情况下，操作台1能够同时处理的订单数量不大于操作台1中槽位10的数量。那么，机器人2能搬的货物5的种类就有限，当机器人2足够多的时候，必定有些机器人2会空闲，这样就没能充分利用机器人2，最终导致系统的总体出库效率较低。
为了解决这一问题，本公开实施例可以将获取到的多个原始订单进行组单，得到一个或多个目标订单，将目标订单发给操作台1进行处理，操作台1的每个槽位10可以处理一个目标订单，从而可以批量对多个原始订单进行处理，提升出库效率。
进一步地，在新获取到一批原始订单后，可以查找操作台1还未处理的目标订单，并将查找到的至少部分目标订单打散，与新获取的原始订单进行组单处理，重新生成一个或多个目标订单，从而使得新获取到的一批原始订单可以与之前的目标订单进行组单处理，进一步提升出库效率。
下面结合附图，对本公开的一些实施方式作详细说明。在各实施例之间不冲突的情况下，下述的实施例及实施例中的特征可以相互组合。
图2为本公开实施例提供的一种订单处理方法的流程示意图。本实施例中方法的执行主体可以为控制设备。如图2所示，本实施例中的订单处理方法，可以包括：
步骤201、获取待处理的原始订单。
其中，所述待处理的原始订单可以是由用户发送的，也可以是控制设备自动生成 的，例如，每隔一段时间生成用于出库的原始订单。所述待处理的原始订单的数量可以为一个或多个。
步骤202、查找还未分拣的目标订单，其中，所述目标订单通过对多个原始订单进行组单处理得到。
其中，本步骤所述目标订单可以在步骤201之前生成。所述目标订单是对原始订单进行组单处理后得到的订单。本公开实施例中，组单可以是指，把多个原始订单按照一定的策略进行组合，得到一个或多个目标订单。一般情况下，每个目标订单包括多个原始订单，但是在一些极端情况下，不排除存在某些目标订单仅包括一个原始订单的情况。
在得到一个或多个目标订单后，可以将一个或多个目标订单发送给操作台进行处理，其中，操作台的每个槽位可以分配一个目标订单。当在步骤201中获取到新的一批待处理的原始订单时，可以查找还未分拣的目标订单。所述还未分拣的目标订单可以是还未占用操作台的槽位的目标订单。
在一种可选的实现方式中，当操作台有空闲槽位时，控制设备才向所述操作台发送目标订单，目标订单占用空闲的槽位后，机器人和拣货人员对所述目标订单进行处理，合作将目标订单需要的货物放置在所述槽位中。这种情况下，所述还未分拣的目标订单可以为还未发送到操作台的目标订单。该方案逻辑简单，不易出错。为了便于描述，本公开各实施例中以这种处理方式为例进行说明。
在其它可选的实现方式中，当生成目标订单后，控制设备即可向操作台发送所述目标订单，若所述操作台当前不存在空闲槽位，则所述目标订单在所述操作台中进行缓存，当有空闲槽位时再将所述目标订单分配给空闲槽位。这种情况下，所述还未分拣的目标订单可以为已发送到操作台但还未占用操作台的槽位的目标订单，操作台可以向控制设备反馈目标订单当前是否已经占用槽位。该方案能够使操作台及时获取到待处理的目标订单并在有空闲槽位时安排处理所述目标订单，提高槽位空闲时为槽位分配目标订单的效率。
步骤203、将查找到的至少部分目标订单分解为原始订单。
可选的，可以将查找到的目标订单中符合一定条件的目标订单挑选出来，分解为原始订单。所述条件不作限制。
可选的，挑选出的目标订单可以是，其中包含的原始订单能够与待处理的原始订单组合到一起的目标订单，从而使得被分解后得到的原始订单能够与待处理的原始订单进行组合。对于没有包含任何能够与待处理的原始订单组合到一起的原始订单的目标订单，可以不进行分解操作。
步骤204、将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单。
具体的，分解得到的原始订单和待处理的原始订单，作为新的一整批待组单的原始订单，可以按照之前生成目标订单的策略对这些原始订单进行组单处理，重新生成目标订单，代替之前被分解的目标订单。重新生成的目标订单的数量与被分解的目标订单的数量可以相同，也可以不同。
举例来说，假设初期获取了100个原始订单，对这些原始订单进行组单处理，得 到了15个目标订单，操作台包括9个槽位，每个槽位可以用于处理1个目标订单，那么可以从中选择9个目标订单发送给操作台。
在操作台处理的过程中，可能会收到用户发送的新的一批原始订单，假设有20个新的原始订单，而当前还未分拣的目标订单有15-9＝6个，这6个目标订单中，可能只有2个能够与新来的一批原始订单进行组单处理，则可以将这2个目标订单分解为原始订单。假设分解得到10个原始订单，再将分解得到的10个原始订单与新到的20个原始订单进行组单处理。得到新的目标订单，新的目标订单的数量可能多于或等于2个，但是一般不会少于被分解的目标订单的数量。
假设得到新的目标订单的数量为5个，这5个新得到的目标订单与之前未分拣、但是没有被分解的4个目标订单，共计9个目标订单，可以作为当前未分拣的目标订单。
可选的，在所述操作台存在至少一空闲槽位时，对于每一空闲槽位，可以从还未分拣的目标订单中选择一个目标订单分配给所述空闲槽位。目标订单分配给空闲槽位后，占用所述槽位，所述槽位进入非空闲状态，机器人和拣货人员将目标订单需要的货物放置在所述空闲槽位内，以完成对目标订单的分拣。
当发送一个目标订单给操作台进行处理后，未分拣的目标订单变为8个。当再有新的一批原始订单到来时，可以根据当前的8个未分拣的目标订单和新的一批原始订单，重复执行前述步骤，从而高效、有序地对订单进行处理。
当目标订单需要的货物在槽位中被集齐后，可以将货物取出送去二次分拣，二次分拣能够从集齐的货物中拣出每个原始订单需要的货物，然后可以送去打包出库。
本实施例提供的订单处理方法，可以获取待处理的原始订单，查找还未分拣的目标订单，其中，所述目标订单通过对多个原始订单进行组单处理得到，将查找到的至少部分目标订单分解为原始订单，将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单，能够实现动态回滚组单，使得新到来的原始订单可以与当前还未分拣的目标订单进行组单处理，有效提高了出库效率。
图3为本公开实施例提供的另一种订单处理方法的流程示意图。本实施例是在前述实施例提供的技术方案的基础上，通过一些限制条件来实现组单处理。如图3所示，所述方法包括：
步骤301、获取待处理的原始订单。
步骤302、查找还未分拣的目标订单，其中，所述目标订单通过对多个原始订单进行组单处理得到。
本实施例中，步骤301至步骤302的具体实现方式可以参见前述实施例，此处不再赘述。
步骤303、在查找到的目标订单中，若任一目标订单对应的原始订单与待处理的至少一个原始订单满足组单限制条件，则确定所述目标订单为待回滚的目标订单。
具体的，可以设定任意多个原始订单只有在满足组单限制条件才能进行组合。不满足组单限制条件的多个原始订单，不能出现在同一个目标订单中。
所述组单限制条件可以包括：各个原始订单的优先级相同，和/或，类型相同。例如，若3个原始订单的优先级均相同，那么这3个原始订单满足组单限制条件；若3 个原始订单中，其中1个的优先级为高，另外2个优先级为低，那么优先级高的1个原始订单与其它2个不满足组单限制条件，不能一起组合，但是2个优先级低的原始订单满足组单限制条件，可以进行组合。
可选的，可以根据原始订单的出库截止时间，确定所述原始订单的优先级；和/或，根据原始订单对应的货物的数量，确定所述原始订单的类型。
其中，出库截止时间相同或相近的原始订单，对应的优先级可以相同。出库截止时间越早，对应的优先级可以越高，从而使得快到出库截止时间的原始订单能够优先被处理，避免出现挂单。
原始订单的类型可以包括多品订单和单品订单，其中多品订单是指订单需要的货物多于一件，单品订单是指订单需要的货物只有一件。将单品订单和多品订单分开组合，能够有效提高二次分拣的效率。
进一步地，还可以只对多品订单进行组单处理。对于单品订单，当机器人将货物取来时，拣货人员可以直接将单品订单需要的货物取走并送去打包，因此单品订单可以不占用槽位，无需进行组单处理，提高单品订单的处理效率。
除此之外，还可以通过其它方式确定原始订单的优先级和类型。例如，优先级可以由用户设定，或者根据订单中货物的重要程度确定；又例如，类型除了包括多品订单和单品订单之外，还可以包括易碎货物订单和非易碎货物订单等。所述组单限制条件也不仅限于优先级和类型，还可以根据实际需要扩展其它限制条件，例如，订单可能存在不同的出库点，可以设置组单限制条件包括出库点相同，以进一步提高出库效率。
在每次组成目标订单时，都可以考虑上述组单限制条件，因此，每个目标订单中的多个原始订单之间应该是符合组单限制条件的。在本步骤中，在判断任一目标订单对应的原始订单是否与待处理的至少一个原始订单满足组单限制条件时，可以仅判断所述目标订单中的一个原始订单是否与待处理的某一个或几个原始订单满足组单限制条件，若是，则可以确定所述目标订单中的所有原始订单与这一个或几个原始订单都满足组单限制条件。若满足组单限制条件，则确定所述目标订单为待回滚的目标订单。
举例来说，当前未分拣的目标订单有2个，新获取到的待处理的原始订单有3个，分别为a、b、c，其中a、b满足组单限制条件，c与a或b都不满足组单限制条件。
若第1个目标订单中的任一原始订单与a、b满足组单限制条件，则第1个目标订单为待回滚的目标订单。若第2个目标订单中的任一原始订单与c满足组单限制条件，则第2个目标订单也为待回滚的目标订单。
步骤304、将所述待回滚的目标订单分解为原始订单。
本实施例中，通过步骤303至步骤304，可以实现将查找到的至少部分目标订单分解为原始订单。
步骤305、将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单。
其中，在组单处理时，满足组单限制条件的原始订单才能放到一起进行组合。
图4为本公开实施例提供的一种组单处理的原理示意图。如图4所示，还未分拣的目标订单有3个，目标订单1包括3个原始订单，目标订单2和3均包含2个原始 订单，目标订单中的小方块代表目标订单包含的原始订单，同一阴影图案的原始订单属于满足组单限制条件的原始订单，一个目标订单中的全部原始订单应该都满足组单限制条件。
假设新获取到一批原始订单，共计5个，其中1个可以与目标订单1中的原始订单进行组单，1个可以与目标订单2中的原始订单进行组单，另外3个无法与当前的任一目标订单中的原始订单进行组单。
那么，可以将目标订单1和目标订单2分解为组单前的5个原始订单，并将分解后的5个原始订单与新来的5个原始订单重新进行组单，得到目标订单4、目标订单5以及目标订单6，再与之前的目标订单3一起，作为当前未分拣的目标订单，若操作台存在空闲槽位，则从中选择目标订单发往操作台进行处理。
如果没有上述的动态回滚组单机制，那么当新获取到5个原始订单时，只能将这5个原始订单进行组单处理，得到3个目标订单，这样未分拣的目标订到数量就达到6个。而采用本公开实施例提供的方案，可以将新获取到的原始订单与之前已经组单的原始订单重新进行组单处理，得到4个目标订单，有效减少了对槽位的占用，提高了出库效率。
可选的，将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单，可以包括：将分解得到的原始订单以及所述待处理的原始订单划分为多组，每组的各个原始订单满足组单限制条件；对于每组原始订单，在满足目标订单限制条件的基础上，将所述组的原始订单进行组单处理，生成一个或多个目标订单。
具体的，分解得到的原始订单以及所述待处理的原始订单可以放入原始订单池中，然后，将原始订单池中的原始订单划分为多组。对于每一组来说，该组内的所有原始订单满足组单限制条件。
然后，针对每一组，可以将该组内的所有原始订单进行组合，在组合时，需要满足目标订单限制条件，组合后形成一个或多个目标订单。
可选的，所述目标订单限制条件可以包括：任一目标订单对应的货物总数量不大于预设数量阈值，和/或，货物总占用空间不大于预设空间阈值。其中，所述预设数量阈值可以为操作台的一个槽位可容纳的货物数量，所述预设空间阈值可以为一个槽位的容纳空间，从而保证生成的目标订单能够适应槽位，保证订单被正常处理。
本公开实施例提供的订单处理方法，可以在查找到的目标订单中，判断目标订单对应的原始订单与待处理的至少一个原始订单是否满足组单限制条件，进而确定是否需要将目标订单分解为原始订单并参与后续的组单处理，能够将可与待处理的原始订单进行组单的目标订单进行分解和处理，无需分解全部目标订单，有效提高了订单处理的效率。
此外，在获取到新的一批待处理的原始订单时，若不存在还未分拣的目标订单，或者，还未分拣的目标订单中不存在待回滚的目标订单，则可以将待处理的原始订单进行组单处理，生成一个或多个目标订单，从而在新获取的一批原始订单不能与之前的原始订单进行组单的情况下，让新获取的原始订单自行组单，保证新获取的原始订单被及时处理。
在上述各实施例提供的技术方案的基础上，本公开实施例还提供一种可选的组单策略。其中，对于每组原始订单，在满足目标订单限制条件的基础上，将所述组的原始订单进行组单处理，生成一个或多个目标订单，可以包括：对于每组原始订单，在满足目标订单限制条件的基础上，通过评价组单处理后得到的目标订单的总数量，和/或，得到的目标订单的货物种类数量之和，确定最终生成的一个或多个目标订单。
具体的，对原始订单进行组单的目标可以是：组成的目标订单越少越好，因为每个目标订单占据一个槽位，组成的目标订单越少，那么所需要的槽位就越少，意味着同一时刻操作台可以处理更多的需求；组成的目标订单总共需要的货物种类数量之和越少越好，因为货物种类数量之和越少，意味着机器人需要搬来的货物种类就越少，可以减少货物种类的重取率。
本公开实施例中，得到的目标订单的货物种类数量之和，可以是各个目标订单的货物种类数量直接相加得到的结果。其中，货物可以通过SKU(Stock Keeping Unit，库存保有单位)来表示，SKU是库存进出计量的单位，货物种类可以是指SKU种类，不同的SKU对应不同的种类。
具体的，可以针对组单处理后得到的目标订单中的每一目标订单，根据所述目标订单包含的原始订单对应的货物种类，确定所述目标订单的货物种类数量；将得到的各个目标订单的货物种类数量直接相加，得到所述货物种类数量之和。
举例来说，1号目标订单包含2个原始订单，其中一个原始订单包含货物A和B，另一个原始订单包括货物B和C，因此，1号目标订单包含的货物种类包括A、B、C，那么，1号目标订单的货物种类数量为3。
2号目标订单的货物种类数量也是3，包含货物A、C、D。那么1号目标订单和2号目标订单的货物种类数量之和为3+3＝6。而在组单之前，所有原始订单的货物种类包括A、B、C、D，总的货物种类数量为4。所以目标订单的货物种类数量之和，不一定等于组单之前所有原始订单的货物种类数量。
在实际应用中，机器人按照目标订单进行货物的搬运，即使不同的目标订单之间存在一样的货物种类，也认为增加了总的货物种类数量。通过这样的评价方式，可以使目标订单的货物种类数量之和尽量的小，而同种类的货物在仓库中往往一起存放，因此，货物种类数量之和越小，机器人取货需要花费的整体时间就越少。
可选的，对于每组原始订单，在满足目标订单限制条件的基础上，通过评价组单处理后得到的目标订单的总数量，和/或，得到的目标订单的货物种类数量之和，确定最终生成的一个或多个目标订单，可以包括：对于每组原始订单，在满足目标订单限制条件的基础上，确定所有可能的组单方案，其中，所述组单方案包括对所述组的原始订单进行组单处理后得到的一个或多个目标订单；对于任一组单方案，计算得到的目标订单的总数量对应的评分，和/或，计算得到的目标订单的货物种类数量之和对应的评分；根据计算得到的评分，确定最终选择的组单方案。
具体的，对于任意一组原始订单，可以将该组原始订单，在满足目标订单限制条件的基础上，找出所有可能的组单方案，然后，通过评分的方式来从所有可能的组单方案中选择最优解。
其中，在每一个组单方案中，目标订单的总数量越少，对应的评分越高，目标订 单的货物种类数量之和越少，对应的评分越高。可以仅根据总数量对应的评分，或者，仅根据货物种类数量之和对应的评分来选择最优解。或者，也可以将总数量对应的评分和货物种类数量之和对应的评分进行加权求和，得到总评分，并选择总评分最高的作为最终选择的组单方案，能够准确地从多个组单方案中选出最优解，保证出库效果。
此外，还可以通过其它的组单策略来实现组单处理。例如，可以按照顺序分配的方式，确定每个原始订单归属的目标订单。
具体的，先将第一个原始订单归属于第一个目标订单，然后，判断第二个原始订单与第一个原始订单是否包含相同的货物种类，若是，则将第二个原始订单归属于第一个目标订单，反之则新增一目标订单，将第二个原始订单归属于新增的目标订单。以此类推，直至全部订单处理完成。当然，在处理过程中，也可以考虑目标订单限制条件等。
以上提供了新获取到原始订单时的组单策略，可选的是，在初次获取到原始订单时，即之前不存在目标订单时，也可以按照类似的方法来对初次获取到的原始订单进行组单操作。
图5为本公开实施例提供的又一种订单处理方法的流程示意图。本实施例是在上述各实施例提供的技术方案的基础上，提供了一种从第一批获取到的原始订单开始处理的流程。如图5所示，所述订单处理方法可以包括：
步骤501、获取用户发送的一批原始订单。
步骤502、将获取到的所有原始订单按照组单限制条件分为多组。
例如，只有优先级相同和/或类型相同的原始订单才能被分到一组。
步骤503、对每一组原始订单进行组单处理，得到一个或多个目标订单。
其中，组单要满足目标订单限制条件，例如组成的目标订单的货物数量必须小于某个阈值等。在给定的目标订单限制条件下，组单的目标可以是：组单后得到的目标订单的总数量越少越好，以及得到的目标订单的货物种类数量之和越少越好。
步骤504、基于操作台的空闲槽位数量挑选目标订单发到操作台。
其中，挑选的策略不作限制。可选的，可以将优先级较高的先发送给操作台。
步骤505、为机器人分配对应的取货任务。
其中，取货任务可以包括发送给操作台的目标订单所包含的货物的信息，如货物标识、存放位置等。机器人在获取到取货任务后，可以把货物从仓库货架上取出并送到对应的操作台，由拣货人员完成拣货。
步骤506、当获取到新的一批原始订单时，将这批原始订单按照组单限制条件分组，对于每组原始订单，查找还未发到操作台的目标订单中，是否存在能一起组单的原始订单：若不存在，则该组原始订单自行组单，得到一个或多个目标订单；若存在，则将对应的目标订单分解为组单前的原始订单，再与该组原始订单进行组单处理，得到一个或多个目标订单。然后，重新回到步骤504。
本实施例中各个步骤的具体实现原理可以参见前述实施例，此处不再赘述。
本实施例提供的订单处理方法，可以在获取到第一批原始订单时，对原始订单进行组单处理，得到一个或多个目标订单，在后续每次获取到新的一批原始订单时，若存在满足要求的目标订单，则可以将目标订单分解，并将分解后的原始订单和新的一 批原始订单进行组单处理，若不存在满足要求的目标订单，则新的一批原始订单自己进行组单处理，无论哪种情况下的组单处理，都可以使用类似的方法，从而在不断获取原始订单的过程中，生成的目标订单的原则始终是一致的，货物出库过程可以平稳、有序地进行。
图6为本公开实施例提供的一种订单处理装置的结构示意图。如图6所示，所述装置可以包括：
获取模块601，用于获取待处理的原始订单；
查找模块602，用于查找还未分拣的目标订单，其中，所述目标订单通过对多个原始订单进行组单处理得到；
分解模块603，用于将查找到的至少部分目标订单分解为原始订单；
组单模块604，用于将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单。
在一个可选的实施方式中，所述还未分拣的目标订单为还未发送到操作台的目标订单，或者，已发送到操作台但还未占用操作台的槽位的目标订单。
在一个可选的实施方式中，所述待处理的原始订单的数量为一个或多个；所述查找模块602具体用于：
在查找到的目标订单中，若任一目标订单对应的原始订单与待处理的至少一个原始订单满足组单限制条件，则确定所述目标订单为待回滚的目标订单；
将所述待回滚的目标订单分解为原始订单。
在一个可选的实施方式中，所述组单限制条件包括：各个原始订单的优先级相同，和/或，类型相同。
在一个可选的实施方式中，所述查找模块602还用于：
根据原始订单的出库截止时间，确定所述原始订单的优先级；和/或，
根据原始订单对应的货物的数量，确定所述原始订单的类型。
在一个可选的实施方式中，所述组单模块604具体用于：
将分解得到的原始订单以及所述待处理的原始订单划分为多组，每组的各个原始订单满足组单限制条件；
对于每组原始订单，在满足目标订单限制条件的基础上，将所述组的原始订单进行组单处理，生成一个或多个目标订单。
在一个可选的实施方式中，所述目标订单限制条件包括：任一目标订单对应的货物总数量不大于预设数量阈值，和/或，货物总占用空间不大于预设空间阈值。
在一个可选的实施方式中，所述组单模块604在满足目标订单限制条件的基础上，将所述组的原始订单进行组单处理，生成一个或多个目标订单时，具体用于：
在满足目标订单限制条件的基础上，通过评价组单处理后得到的目标订单的总数量，和/或，得到的目标订单的货物种类数量之和，确定最终生成的一个或多个目标订单。
在一个可选的实施方式中，所述组单模块604还用于：
针对组单处理后得到的目标订单中的每一目标订单，根据所述目标订单包含的原始订单对应的货物种类，确定所述目标订单的货物种类数量；
将得到的各个目标订单的货物种类数量直接相加，得到所述货物种类数量之和。
在一个可选的实施方式中，所述组单模块604在满足目标订单限制条件的基础上，通过评价组单处理后得到的目标订单的总数量，和/或，得到的目标订单的货物种类数量之和，确定最终生成的一个或多个目标订单，确定最终生成的一个或多个目标订单时，具体用于：
在满足目标订单限制条件的基础上，确定所有可能的组单方案，其中，所述组单方案包括对所述组的原始订单进行组单处理后得到的一个或多个目标订单；
对于任一组单方案，计算得到的目标订单的总数量对应的评分，和/或，计算得到的目标订单的货物种类数量之和对应的评分；
根据计算得到的评分，确定最终选择的组单方案。
在一个可选的实施方式中，所述组单模块604还用于：
若不存在还未分拣的目标订单，或者，还未分拣的目标订单中不存在待回滚的目标订单，则将待处理的原始订单进行组单处理，生成一个或多个目标订单。
在一个可选的实施方式中，所述组单模块604还用于：
在操作台存在至少一空闲槽位时，对于每一空闲槽位，从还未分拣的目标订单中选择一个目标订单分配给所述空闲槽位。
本实施例提供的装置，可用于执行图1至图5所示方法实施例的技术方案，其实现原理和技术效果类似，本实施例此处不再赘述。
图7为本公开实施例提供的一种控制设备的结构示意图。如图7所示，本实施例的控制设备可以包括：
至少一个处理器701；以及
与所述至少一个处理器通信连接的存储器702；
其中，所述存储器702存储有可被所述至少一个处理器701执行的指令，所述指令被所述至少一个处理器701执行，以使所述控制设备执行如上述任一实施例所述的方法。
可选地，存储器702既可以是独立的，也可以跟处理器701集成在一起。
本实施例提供的控制设备的实现原理和技术效果可以参见前述各实施例，此处不再赘述。
本公开实施例还提供一种仓储系统，包括前述任一实施例所述的控制设备以及操作台、机器人。
其中，所述操作台用于获取所述控制设备发送的目标订单并显示给拣货人员，例如，可以显示：槽位1的订单包括：5件A货物，10件B货物。
所述机器人用于获取所述控制设备根据所述目标订单发送的取货任务，并根据所述取货任务从仓库中取出所述目标订单对应的货物，供所述拣货人员将所述对应的货物放入所述操作台的槽位中。
本公开实施例提供的仓储系统中，控制设备、操作台和机器人的具体工作原理、过程及有益效果可以参见前述实施例，此处不再赘述。
本公开实施例还提供一种计算机可读存储介质，所述计算机可读存储介质中存储有计算机执行指令，当处理器执行所述计算机执行指令时，实现如前述任一实施例所 述的方法。
本公开实施例提供一种计算机程序产品，包括计算机程序，所述计算机程序被执行时实现如前述任一实施例所述的方法。
在本公开所提供的几个实施例中，应该理解到，所揭露的设备和方法，可以通过其它的方式实现。例如，以上所描述的设备实施例仅仅是示意性的，例如，所述模块的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个模块可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或模块的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的模块可以是或者也可以不是物理上分开的，作为模块显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案。
另外，在本公开各个实施例中的各功能模块可以集成在一个处理单元中，也可以是各个模块单独物理存在，也可以两个或两个以上模块集成在一个单元中。上述模块成的单元既可以采用硬件的形式实现，也可以采用硬件加软件功能单元的形式实现。
上述以软件功能模块的形式实现的集成的模块，可以存储在一个计算机可读取存储介质中。上述软件功能模块存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)或处理器执行本公开各个实施例所述方法的部分步骤。
应理解，上述处理器可以是中央处理单元(Central Processing Unit，简称CPU)，还可以是其它通用处理器、数字信号处理器(Digital Signal Processor，简称DSP)、专用集成电路(Application Specific Integrated Circuit，简称ASIC)等。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。结合发明所公开的方法的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件模块组合执行完成。
存储器可能包含高速RAM存储器，也可能还包括非易失性存储NVM，例如至少一个磁盘存储器，还可以为U盘、移动硬盘、只读存储器、磁盘或光盘等。
总线可以是工业标准体系结构(Industry Standard Architecture，简称ISA)总线、外部设备互连(Peripheral ComponentInterconnect，简称PCI)总线或扩展工业标准体系结构(Extended Industry Standard Architecture，简称EISA)总线等。总线可以分为地址总线、数据总线、控制总线等。为便于表示，本公开附图中的总线并不限定仅有一根总线或一种类型的总线。
上述存储介质可以是由任何类型的易失性或非易失性存储设备或者它们的组合实现，如静态随机存取存储器(SRAM)，电可擦除可编程只读存储器(EEPROM)，可擦除可编程只读存储器(EPROM)，可编程只读存储器(PROM)，只读存储器(ROM)，磁存储器，快闪存储器，磁盘或光盘。存储介质可以是通用或专用计算机能够存取的任何可用介质。
一种示例性的存储介质耦合至处理器，从而使处理器能够从该存储介质读取信息， 且可向该存储介质写入信息。当然，存储介质也可以是处理器的组成部分。处理器和存储介质可以位于专用集成电路(Application Specific Integrated Circuits，简称ASIC)中。当然，处理器和存储介质也可以作为分立组件存在于电子设备或主控设备中。
本领域普通技术人员可以理解：实现上述各方法实施例的全部或部分步骤可以通过程序指令相关的硬件来完成。前述的程序可以存储于一计算机可读取存储介质中。该程序在执行时，执行包括上述各方法实施例的步骤；而前述的存储介质包括：ROM、RAM、磁碟或者光盘等各种可以存储程序代码的介质。
最后应说明的是：以上各实施例仅用以说明本公开的技术方案，而非对其限制；尽管参照前述各实施例对本公开进行了详细的说明，本领域的普通技术人员应当理解：其依然可以对前述各实施例所记载的技术方案进行修改，或者对其中部分或者全部技术特征进行等同替换；而这些修改或者替换，并不使相应技术方案的本质脱离本公开各实施例技术方案的范围。

Claims (17)

  1. 一种订单处理方法，其特征在于，包括：
    获取待处理的原始订单；
    查找还未分拣的目标订单，其中，所述目标订单通过对多个原始订单进行组单处理得到；
    将查找到的至少部分目标订单分解为原始订单；
    将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单。
  2. 根据权利要求1所述的方法，其特征在于，所述还未分拣的目标订单为还未发送到操作台的目标订单，或者，已发送到操作台但还未占用操作台的槽位的目标订单。
  3. 根据权利要求1或2所述的方法，其特征在于，所述待处理的原始订单的数量为一个或多个；将查找到的至少部分目标订单分解为原始订单，包括：
    在查找到的目标订单中，若任一目标订单对应的原始订单与待处理的至少一个原始订单满足组单限制条件，则确定所述目标订单为待回滚的目标订单；
    将所述待回滚的目标订单分解为原始订单。
  4. 根据权利要求3所述的方法，其特征在于，所述组单限制条件包括：各个原始订单的优先级相同，和/或，类型相同。
  5. 根据权利要求4所述的方法，其特征在于，还包括：
    根据原始订单的出库截止时间，确定所述原始订单的优先级；和/或，
    根据原始订单对应的货物的数量，确定所述原始订单的类型。
  6. 根据权利要求1-5任一项所述的方法，其特征在于，将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单，包括：
    将分解得到的原始订单以及所述待处理的原始订单划分为多组，每组的各个原始订单满足组单限制条件；
    对于每组原始订单，在满足目标订单限制条件的基础上，将所述组的原始订单进行组单处理，生成一个或多个目标订单。
  7. 根据权利要求6所述的方法，其特征在于，所述目标订单限制条件包括：任一目标订单对应的货物总数量不大于预设数量阈值，和/或，货物总占用空间不大于预设空间阈值。
  8. 根据权利要求6或7所述的方法，其特征在于，对于每组原始订单，在满足目标订单限制条件的基础上，将所述组的原始订单进行组单处理，生成一个或多个目标订单，包括：
    对于每组原始订单，在满足目标订单限制条件的基础上，通过评价组单处理后得到的目标订单的总数量，和/或，得到的目标订单的货物种类数量之和，确定最终生成的一个或多个目标订单。
  9. 根据权利要求8所述的方法，其特征在于，还包括：
    针对组单处理后得到的目标订单中的每一目标订单，根据所述目标订单包含的原始订单对应的货物种类，确定所述目标订单的货物种类数量；
    将得到的各个目标订单的货物种类数量直接相加，得到所述货物种类数量之和。
  10. 根据权利要求8或9所述的方法，其特征在于，对于每组原始订单，在满足目标订单限制条件的基础上，通过评价组单处理后得到的目标订单的总数量，和/或，得到的目标订单的货物种类数量之和，确定最终生成的一个或多个目标订单，确定最终生成的一个或多个目标订单，包括：
    对于每组原始订单，在满足目标订单限制条件的基础上，确定所有可能的组单方案，其中，所述组单方案包括对所述组的原始订单进行组单处理后得到的一个或多个目标订单；
    对于任一组单方案，计算得到的目标订单的总数量对应的评分，和/或，计算得到的目标订单的货物种类数量之和对应的评分；
    根据计算得到的评分，确定最终选择的组单方案。
  11. 根据权利要求3-5任一项所述的方法，其特征在于，还包括：
    若不存在还未分拣的目标订单，或者，还未分拣的目标订单中不存在待回滚的目标订单，则将待处理的原始订单进行组单处理，生成一个或多个目标订单。
  12. 根据权利要求1-11任一项所述的方法，其特征在于，还包括：
    在操作台存在至少一空闲槽位时，对于每一空闲槽位，从还未分拣的目标订单中选择一个目标订单分配给所述空闲槽位。
  13. 一种订单处理装置，其特征在于，包括：
    获取模块，用于获取待处理的原始订单；
    查找模块，用于查找还未分拣的目标订单，其中，所述目标订单通过对多个原始订单进行组单处理得到；
    分解模块，用于将查找到的至少部分目标订单分解为原始订单；
    组单模块，用于将分解得到的原始订单以及所述待处理的原始订单进行组单处理，重新生成一个或多个目标订单。
  14. 一种控制设备，其特征在于，包括：
    至少一个处理器；以及
    与所述至少一个处理器通信连接的存储器；
    其中，所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述控制设备执行如权利要求1-12任一项所述的方法。
  15. 一种仓储系统，其特征在于，包括：权利要求14所述的控制设备、操作台以及机器人；
    所述操作台用于获取所述控制设备发送的目标订单并显示给拣货人员；
    所述机器人用于获取所述控制设备根据所述目标订单发送的取货任务，并根据所述取货任务从仓库中取出所述目标订单对应的货物，供所述拣货人员将所述对应的货物放入所述操作台的槽位中。
  16. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质中存储有计算机执行指令，当处理器执行所述计算机执行指令时，实现如权利要求1-12任一项所述的方法。
  17. 一种计算机程序产品，其特征在于，包括计算机程序，所述计算机程序被执 行时实现如权利要求1-12任一项所述的方法。
PCT/CN2021/087268 2020-09-17 2021-04-14 订单处理方法、装置、设备、系统及存储介质 WO2022057248A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010976537.7 2020-09-17
CN202010976537.7A CN111932186B (zh) 2020-09-17 2020-09-17 订单处理方法、装置、设备、系统及存储介质

Publications (1)

Publication Number Publication Date
WO2022057248A1 true WO2022057248A1 (zh) 2022-03-24

Family

ID=73333877

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/087268 WO2022057248A1 (zh) 2020-09-17 2021-04-14 订单处理方法、装置、设备、系统及存储介质

Country Status (7)

Country Link
US (2) US11276036B1 (zh)
EP (1) EP3944166A1 (zh)
JP (2) JP6986173B1 (zh)
KR (2) KR102353518B1 (zh)
CN (1) CN111932186B (zh)
TW (2) TWI741957B (zh)
WO (1) WO2022057248A1 (zh)

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111932186B (zh) 2020-09-17 2021-01-15 深圳市海柔创新科技有限公司 订单处理方法、装置、设备、系统及存储介质
CN112418759A (zh) * 2020-11-18 2021-02-26 北京极智嘉科技有限公司 一种订单处理方法、装置、电子设备及存储介质
CN112150257B (zh) * 2020-11-26 2021-03-26 炬星科技（深圳）有限公司 订单处理方法、云端系统、电子设备及存储介质
CN112938284B (zh) * 2021-02-09 2022-12-13 深圳市库宝软件有限公司 一种仓储机器人控制方法、装置、电子设备及仓储系统
CN112907170B (zh) * 2021-02-09 2023-11-17 深圳市库宝软件有限公司 订单处理方法、装置、设备、仓储系统及存储介质
CN113379348A (zh) * 2021-06-10 2021-09-10 北京京东振世信息技术有限公司 仓库任务合并方法、装置、电子设备和可读存储介质
CN114004567A (zh) * 2021-11-02 2022-02-01 深圳市海柔创新科技有限公司 订单处理方法、装置、调度设备、仓储系统及存储介质
KR102493217B1 (ko) * 2022-03-24 2023-01-31 쿠팡 주식회사 집품 정보 제공 방법 및 이를 이용한 전자 장치
CN114852566B (zh) * 2022-04-11 2024-05-14 深圳市库宝软件有限公司 订单处理方法、装置、设备、仓储系统及存储介质
CN114933116B (zh) * 2022-05-13 2023-07-04 深圳市库宝软件有限公司 挂单处理方法、装置、设备及存储介质
CN115057144B (zh) * 2022-06-30 2023-06-30 深圳市库宝软件有限公司 增减开启槽位的方法、装置、操作台及仓储系统
CN117273558A (zh) * 2022-10-19 2023-12-22 安徽中技国医医疗科技有限公司 一种基于云仓的医用物资管理方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140021253A1 (en) * 2012-07-23 2014-01-23 Omnicare, Inc. Universal label and verification systems and methods for filling customer orders of medical items
CN110070312A (zh) * 2018-01-24 2019-07-30 北京京东尚科信息技术有限公司 订单处理方法和装置
CN110659785A (zh) * 2018-06-28 2020-01-07 北京三快在线科技有限公司 订单推送方法、装置及服务器
CN111429049A (zh) * 2019-01-10 2020-07-17 北京京东尚科信息技术有限公司 物品订单的配送方法、系统、电子设备及可读存储介质
CN111932186A (zh) * 2020-09-17 2020-11-13 深圳市海柔创新科技有限公司 订单处理方法、装置、设备、系统及存储介质

Family Cites Families (31)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2001039506A (ja) * 1999-08-02 2001-02-13 Sumitomo Heavy Ind Ltd 自動倉庫
US7747543B1 (en) * 2001-09-27 2010-06-29 Amazon Technologies, Inc Dynamically determining actual delivery information for orders based on actual order fulfillment plans
US7295990B1 (en) * 2001-09-27 2007-11-13 Amazon.Com, Inc. Generating current order fulfillment plans based on expected future orders
US20030172007A1 (en) * 2002-03-06 2003-09-11 Helmolt Hans-Ulrich Von Supply chain fulfillment coordination
US20030171962A1 (en) * 2002-03-06 2003-09-11 Jochen Hirth Supply chain fulfillment coordination
US7716125B2 (en) * 2005-08-10 2010-05-11 Axcessnet Innovations Llc Networked loan market and lending management system
GB0901351D0 (en) * 2009-01-28 2009-03-11 Univ Dundee System and method for arranging items for display
US20110029401A1 (en) * 2009-07-28 2011-02-03 Frances Champe Granger Method Of Providing Online House Or Office Décor Related Service
CN103942665A (zh) * 2014-03-18 2014-07-23 青岛海信智能商用系统有限公司 一种多品种多订单快速拣选方法及系统
CN104504548A (zh) * 2014-12-16 2015-04-08 北京京东尚科信息技术有限公司 订单拆分方法和装置
US20160371777A1 (en) * 2015-06-17 2016-12-22 Fixnetix Limited Systems and methods for providing real-time pre-trade risk assessment
JP2017056528A (ja) * 2015-09-17 2017-03-23 株式会社安川電機 移送システムおよび移送方法
CN106611397A (zh) * 2015-10-26 2017-05-03 阿里巴巴集团控股有限公司 物流数据处理方法及装置
US20170124511A1 (en) * 2015-11-04 2017-05-04 Newstore Inc. Automatic Integrated Routing and Fulfillment System and Method with Product Exchange
US20180094936A1 (en) * 2016-10-05 2018-04-05 Wal-Mart Stores, Inc. Systems and methods for determining or improving product placement and/or store layout by estimating customer paths using limited information
US20180137215A1 (en) * 2016-11-16 2018-05-17 Samsung Electronics Co., Ltd. Electronic apparatus for and method of arranging object in space
CN108242001A (zh) * 2016-12-23 2018-07-03 李子旭 一种基于库存不确定商品的订单生成系统和方法
CN108256664A (zh) * 2016-12-29 2018-07-06 中移（杭州）信息技术有限公司 一种路径的确定方法和装置
SG10201702017VA (en) * 2017-03-13 2018-10-30 Mastercard Asia Pacific Pte Ltd System For Purchasing Goods
US11312576B2 (en) * 2017-06-01 2022-04-26 Beijing Geekplus Technology Co., Ltd. Goods picking system and method
CN107392552B (zh) * 2017-08-18 2020-11-06 特兰旗（厦门）科技有限公司 物流共享方法及系统
KR101991175B1 (ko) * 2017-09-08 2019-09-30 주식회사 엘지씨엔에스 디지털 피킹 시스템 및 그 제어방법
CN109961244A (zh) * 2017-12-22 2019-07-02 菜鸟智能物流控股有限公司 物品拣选方法及相关设备
CN110033337B (zh) * 2018-01-11 2024-05-21 北京京东尚科信息技术有限公司 订单生产的方法和装置
EP3816919A4 (en) * 2018-05-21 2022-03-02 Beijing Geekplus Technology Co., Ltd. METHOD AND DEVICE FOR ORDER PROCESSING, SERVER AND STORAGE MEDIUM
CN109118137B (zh) 2018-08-01 2020-01-14 北京极智嘉科技有限公司 一种订单处理方法、装置、服务器及存储介质
CN108891838B (zh) * 2018-05-21 2019-08-13 北京极智嘉科技有限公司 订单处理方法、装置、电子设备以及计算机可读存储介质
CN109117999B (zh) * 2018-08-06 2021-07-02 北京极智嘉科技股份有限公司 播种位分配方法、装置、服务器和介质
CN109102205B (zh) * 2018-08-30 2019-12-31 北京极智嘉科技有限公司 订单任务的拣选系统、处理方法、装置、服务器和介质
CN113998363A (zh) * 2019-07-31 2022-02-01 深圳市海柔创新科技有限公司 一种智能分拣货物的系统、方法、仓储机器人及处理终端
CN110675101A (zh) * 2019-08-15 2020-01-10 浙江国自机器人技术有限公司 订单分拣方法、装置、计算机设备和存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140021253A1 (en) * 2012-07-23 2014-01-23 Omnicare, Inc. Universal label and verification systems and methods for filling customer orders of medical items
CN110070312A (zh) * 2018-01-24 2019-07-30 北京京东尚科信息技术有限公司 订单处理方法和装置
CN110659785A (zh) * 2018-06-28 2020-01-07 北京三快在线科技有限公司 订单推送方法、装置及服务器
CN111429049A (zh) * 2019-01-10 2020-07-17 北京京东尚科信息技术有限公司 物品订单的配送方法、系统、电子设备及可读存储介质
CN111932186A (zh) * 2020-09-17 2020-11-13 深圳市海柔创新科技有限公司 订单处理方法、装置、设备、系统及存储介质

Also Published As

Publication number Publication date
CN111932186A (zh) 2020-11-13
US20220147928A1 (en) 2022-05-12
US20220083970A1 (en) 2022-03-17
TW202213206A (zh) 2022-04-01
TWI741957B (zh) 2021-10-01
KR102630723B1 (ko) 2024-01-30
KR102353518B1 (ko) 2022-01-19
JP7481316B2 (ja) 2024-05-10
EP3944166A1 (en) 2022-01-26
CN111932186B (zh) 2021-01-15
US11966877B2 (en) 2024-04-23
JP2022050300A (ja) 2022-03-30
US11276036B1 (en) 2022-03-15
KR20220037415A (ko) 2022-03-24
JP2022050386A (ja) 2022-03-30
JP6986173B1 (ja) 2021-12-22
TW202213207A (zh) 2022-04-01

Similar Documents

Publication Publication Date Title
WO2022057248A1 (zh) 订单处理方法、装置、设备、系统及存储介质
WO2022063039A1 (zh) 订单处理方法、装置、设备、系统及存储介质
CN108960708B (zh) 货物上架方法、装置、系统、货物上架终端及存储介质
CN107103446B (zh) 库存调度方法以及装置
US20210056482A1 (en) Inventory scheduling method and device and non-transitory computer readable storage medium
US11681982B2 (en) Automated guided vehicle control and organizing inventory items using stock keeping unit clusters
CN108615130B (zh) 出库定位方法及装置
CN108792387B (zh) 货架命中方法、装置、服务器和介质
CN109658027A (zh) 一种订单任务的处理方法、装置、服务器和介质
WO2022206290A1 (zh) 订单处理方法、装置、设备、系统、介质及产品
CN115578039B (zh) 一种仓库货位分配方法、电子设备及计算机存储介质
WO2023066278A1 (zh) 物料入库方法、物料出库方法、装置、调度设备及系统
CN113200275A (zh) 货箱整理方法、装置、设备、仓储系统及存储介质
US20240140713A1 (en) Information processing device, information processing method, computer program product, and information processing system
CN111738651A (zh) 调度任务的处理方法、装置及设备
CN114819475A (zh) 订单处理方法、装置、服务器和存储介质
CN110288287B (zh) 一种仓储货物的分理方法及系统
CN113780943A (zh) 物品存储布局方法、装置、设备及存储介质
CN112053106A (zh) 一种管理物品出库的方法及装置
WO2024104426A1 (zh) 货物拣选方法、装置、电子设备及可读存储介质
CN115526491B (zh) 物资需求计划的数据处理方法、设备及存储介质
CN112184106A (zh) 一种针对大批量订单的商品拣货方法、装置及系统
Yuan et al. Order picking efficiency: A scattered storage and clustered allocation strategy in automated drug dispensing systems
Chou et al. Replenishment Policy and SKU Classification to Pod Assignment Design for Robotic Mobile Fulfillment System Performances
CN118154101A (zh) 用于自动化物流设备的智慧仓库管理方法及系统

Legal Events

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

Ref document number: 21868086

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21868086

Country of ref document: EP

Kind code of ref document: A1