WO2022063039A1

WO2022063039A1 - Order processing method and apparatus, and device, system and storage medium

Info

Publication number: WO2022063039A1
Application number: PCT/CN2021/118865
Authority: WO
Inventors: 喻润方; 艾鑫
Original assignee: 深圳市海柔创新科技有限公司
Priority date: 2020-09-24
Filing date: 2021-09-16
Publication date: 2022-03-31
Also published as: CN112085453A

Abstract

Provided are an order processing method and apparatus, and a device, a system and a storage medium. The method comprises: acquiring orders to be processed, and determining the priority of each of the orders to be processed; for a plurality of orders of the same priority, assigning the plurality of orders to a plurality of operation tables; and sending the orders, which have been assigned to operation tables, to the corresponding operation tables for processing. By means of the order processing method and apparatus, and the device, the system and the storage medium provided in the embodiments of the present disclosure, orders can be assigned in batches according to the priorities thereof, such that the probability of orders of the same priority being assigned to the same operation table is reduced, thereby improving the delivery efficiency of orders.

Description

Order processing method, apparatus, device, system and storage medium

This disclosure claims the priority of the Chinese patent application with the application number 202011013424.3 and the application title "Order Processing Method, Apparatus, Equipment, System and Storage Medium" filed with the China Patent Office on September 24, 2020, the entire contents of which are by reference Incorporated in this disclosure.

technical field

The present disclosure relates to the field of intelligent warehousing, and in particular, to an order processing method, device, device, system and storage medium.

Background technique

With the continuous development of intelligent warehousing technology, the social demand for warehousing is also increasing. The console and robot can assist in the processing of various types of goods, improve the efficiency of goods processing and reduce costs.

In the current intelligent warehousing system, when an order issued by the customer system is obtained, the order can be sent to the operation table first, and then according to the goods demand of the operation table, a picking task is generated for the robot, and the robot delivers the goods to the corresponding The operation table is completed by the picking staff.

When there are multiple consoles and robots, all orders with the same priority may be sent to one console, and the system generally controls the robots to process high-priority orders first, so the robots are concentrated on high-priority orders. Due to the limited picking speed of the picking personnel, the robot has to queue up at the operating table corresponding to the order level, resulting in the idleness of other operating tables and the inability to use the robot resources reasonably, and the overall efficiency of delivery is low.

SUMMARY OF THE INVENTION

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.

In a first aspect, an embodiment of the present disclosure provides an order processing method, including:

Obtain pending orders, and determine the priority of each order in the pending orders;

for multiple orders belonging to the same priority, allocating the multiple orders among multiple operation stations;

Send orders with assigned operation desks to the corresponding operation desks for processing.

In one possible design, determining the priority of each of the pending orders includes:

According to the delivery deadline of each order, determine the priority corresponding to the order;

Among them, the orders with the same delivery deadline belong to the same priority; or, the orders with the delivery deadline in the same time period belong to the same priority.

In a possible design, for multiple orders belonging to the same priority, the multiple orders are distributed among multiple operation stations, including:

sorting the pending orders according to priority;

According to the order of priority from high to low, each priority is processed as follows: all the orders corresponding to the priority are allocated, and the operation table corresponding to each order in all the orders is determined.

In a possible design, all the orders corresponding to the priorities are allocated, and the operation table corresponding to each order in the all orders is determined, including:

If there is an already divided order, according to the divided order and the console corresponding to the divided order, all the orders corresponding to the priority are allocated, and it is determined that each order in all the orders corresponding to the priority is the assigned console;

Wherein, the divided order is an order that has been assigned an operation table but has not yet been processed.

In a possible design, all orders corresponding to the priority are allocated according to the divided orders and the console corresponding to the divided orders, and each order in all the orders corresponding to the priority is determined Assigned consoles, including:

According to the divided orders and their corresponding operation stations, the final assignment result is determined by evaluating the amount of cargo tasks and/or the number of types of goods corresponding to each operation station after all orders corresponding to the priorities are assigned.

In a possible design, according to the divided orders and their corresponding consoles, after all orders corresponding to the priorities are allocated, the task volume of goods and/or the number of types of goods corresponding to each console is evaluated by evaluating, Determine the final allocation results, including:

Determine all possible allocation schemes according to all orders corresponding to the priority and multiple operating desks;

For any distribution scheme, according to the divided order and its corresponding operation station and the distribution scheme, calculate the score corresponding to the variance of the cargo task amount of the multiple operation stations, and/or calculate the multiple operation stations. The score corresponding to the sum of the types and quantities of goods on the console;

Based on the calculated scores, the final selected allocation scheme is determined.

In a possible design, there is a negative correlation between the variance of the task amount of the plurality of operation stations and the corresponding score, and/or the sum of the number of types of goods of the plurality of operation stations and the corresponding score is a negative correlation.

In one possible design, an order for an assigned operation station is sent to the corresponding operation station for processing, including:

When there is a free slot on any console, if there are remaining orders allocated to the console, according to at least one of the priority, the type of goods, and the quantity of goods corresponding to the remaining orders, choose to send to the said console. Console order.

In a possible design, the method further includes:

If there are no remaining orders assigned to the operation station, an order is selected from the remaining orders assigned to other operation stations and/or unassigned orders to be sent to the operation station.

In a possible design, the method further includes:

According to the priority of the goods currently processed by each operation station, the robot is assigned to pick up tasks.

In a possible design, the method further includes:

For any order, the priority of the goods included in the order is dynamically adjusted according to the delivery deadline of the order.

In a possible design, dynamically adjust the priority of the goods included in the order according to the delivery deadline of the order, including:

When the time difference between the delivery deadline of the order and the current time is greater than the preset time threshold, the priority of the goods included in the order is set to the lowest priority;

When the time difference between the delivery deadline of the order and the current time is less than a preset time threshold, determining the priority of the goods included in the order according to the time difference;

When the delivery deadline is reached, the priority of the goods included in the order is set to the highest priority.

In a possible design, the pending orders are obtained, and the priority of each order in the pending orders is determined, including:

Get the order sent by the customer's system;

Find orders that are currently assigned to the console but have not been sent to the console for processing, and delete the association between the found order and its assigned console;

The orders sent by the client system and the found orders are regarded as pending orders, and the priority of each order is determined.

In a second aspect, an embodiment of the present disclosure provides an order processing apparatus, including:

an acquisition module, used for acquiring pending orders, and determining the priority of each order in the pending orders;

an allocation module, used for allocating the plurality of orders among the plurality of operation stations for the plurality of orders belonging to the same priority;

The sending module is used to send the order that has been assigned to the operating table to the corresponding operating table for processing.

In a third aspect, an embodiment of the present disclosure provides a control device, including:

at least one processor; and

a memory communicatively coupled to the at least one processor;

Wherein, 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.

In a fourth aspect, an embodiment of the present disclosure provides a storage system, including the control device described in the third aspect and an operation console; the operation console is used to acquire and process an order sent by the control device.

In a fifth aspect, 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.

In a sixth aspect, 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 acquire orders to be processed, and determine the priority of each order in the pending orders. For multiple orders belonging to the same priority , distribute the multiple orders among multiple operation stations, and send the orders that have been assigned operation stations to the corresponding operation stations for processing. The probability that an order is assigned to the same operation station improves the efficiency of order delivery.

Description of drawings

In order to illustrate the embodiments of the present disclosure or the technical solutions in the prior art more clearly, the following briefly introduces the accompanying drawings used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description These are some embodiments of the present disclosure. For those of ordinary skill in the art, other drawings can also be obtained based on these drawings without any creative effort.

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 diagram of the principle of order allocation according to an embodiment of the present disclosure;

FIG. 4 is a schematic flowchart of allocating orders according to 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 diagram of a change of cargo priority according to an embodiment of the present disclosure;

FIG. 7 is a schematic structural diagram of an order processing apparatus according to an embodiment of the present disclosure;

FIG. 8 is a schematic structural diagram of a control device according to an embodiment of the present disclosure.

detailed description

In order to make the purposes, technical solutions and advantages of the embodiments of the present disclosure clearer, the technical solutions in the embodiments of the present disclosure will be described clearly and completely below with reference to the accompanying drawings in the embodiments of the present disclosure. Obviously, the described embodiments These are some, but not all, embodiments of the present disclosure. Based on the embodiments in the present disclosure, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present disclosure.

FIG. 1 is a schematic diagram of an application scenario provided by an embodiment of the present disclosure. As shown in FIG. 1 , in order to improve the efficiency of warehouse delivery, multiple operating platforms 1 and multiple robots 2 can be set in the storage system. 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. After acquiring the order issued by the user, the control device 3 can allocate the order to the console 1, and when the console 1 has a free slot 10, send the order to the console 1 for processing.

The control device 3 can generate a picking task for the robot 2 according to the goods requirements of each operating table 1. According to the picking task, the robot 2 transports the goods 5 required by the order from the warehouse shelves to the vicinity of the operating table 1, and the picking task is carried out by the picker. The cargo person 4 places the cargo 5 carried by the robot 2 into the slot 10 of the operating table 1, and finally the robot 2 returns the unused cargo 5 to the warehouse. The dotted line in the figure indicates that the item 5 is moved from the robot 2 into the slot 10 .

After the goods 5 required for an order are collected in the slot 10, the goods 5 can be sent for secondary sorting or packing. When one or more slots 10 are vacated, the control device 3 can send a new order to the console for processing.

In the whole process, the priority of the order can be set to be related to the delivery deadline. The closer the delivery deadline, the higher the priority. If the order is not picked within the specified delivery deadline, it will be regarded as a pending order. If a targeted order placement strategy is not adopted to balance the priority of orders, it is easy to cause orders of the same priority to be sent to a certain console 1, which will lead to multiple robots 2 when the order of the priority is about to be placed. In this operation station 1, a queue is waiting for the picking personnel 4 to pick the goods, resulting in a low efficiency of delivery.

In order to solve this problem, after determining the priority of each order, the embodiment of the present disclosure can perform hierarchical clustering of orders according to different priorities, and for multiple orders belonging to the same priority, the multiple orders are placed in the Allocating among multiple operating tables 1, so that orders of each priority can be allocated and processed separately, reducing the probability of orders of the same priority being allocated to the same operating table, thereby effectively improving the efficiency of warehouse delivery.

Some embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings. The following embodiments and features in the embodiments may be combined with each other without conflict between the embodiments.

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. As shown in FIG. 2, the order processing method in this embodiment may include:

Step 201: Acquire pending orders, and determine the priority of each order in the pending orders.

The order to be processed may be an original order issued by a customer, or an order obtained by grouping the original order issued by the customer. For example, multiple original orders with the same priority and the same type of goods demand can be combined together to generate a new order, thereby effectively reducing the number of orders and improving the efficiency of goods processing.

In this step, the number of the orders to be processed may be multiple. Each order has a corresponding priority. Optionally, the priority corresponding to the order may be determined according to the delivery deadline of each order.

In an optional implementation solution, orders with the same delivery deadline may belong to the same priority. For example, if the delivery deadlines of order 1 and order 2 are both at 8:00, then these two orders belong to the same priority.

In another optional implementation solution, orders whose delivery deadlines are in the same time period may belong to the same priority. The length of the time period may be, for example, 2 hours, then one day may be divided into 12 time periods. If the delivery deadlines of any two orders are in the same time period, the two orders belong to the same priority. In this way, orders with the same and close delivery deadlines can be assigned the same priority, which improves the flexibility of order processing.

For example, 7:00-9:00 is a time period, the delivery deadline of order 1 is 8:00, and the delivery deadline of order 2 is 7:30, then these two orders belong to the same priority.

Optionally, the closer the delivery deadline is, the higher the priority can be, and the farther the delivery deadline is, the lower the priority can be. Therefore, priorities can change dynamically over time. The priority can be expressed in multiple ways, for example, the priority can be divided into high, medium, low, etc., or the priority can be represented by numbers, and the priority level is determined by numbers, for example, 10 means the highest and 1 means the lowest.

Step 202 , for multiple orders belonging to the same priority, distribute the multiple orders among multiple operation stations.

In this embodiment, a hierarchical clustering method may be adopted to process orders of each layer, that is, each priority. For all orders corresponding to each priority, these orders can be distributed among multiple operation stations.

Optionally, the to-be-processed orders may be divided into multiple groups according to priority, and each group has the same priority; for each group, all orders in the group are allocated, and the operation to which each order is allocated is determined. tower.

There are many kinds of specific allocation strategies. A simple example is to distribute orders as evenly as possible across the stations.

FIG. 3 is a schematic diagram of the principle of order allocation according to an embodiment of the present disclosure. The small squares in the figure represent orders, and the shadows in the squares represent the priority of the order, and the same shade corresponds to the same priority. As shown in Figure 3, in the case of three operation stations, the orders with high priority can be distributed among the three operation stations. Similarly, an order with a low priority can also be allocated among the three operation stations, so that the order priority of each operation station is more balanced.

Step 203: Send the order that has been assigned to the console to the corresponding console for processing.

The timing of allocation can be set according to actual needs, and it is not limited that it must be sent to the console for processing immediately after the allocation is completed. Optionally, when there are free slots on the operating table, an order may be selected from the orders that have been allocated to the operating table and sent to the operating table for processing. Each order can occupy one slot.

In addition to the slots, the console can also be equipped with processing equipment such as LCD computers that interact with the user. After the processing equipment obtains the order sent by the control equipment, it can display or play the order information corresponding to the slot to the picker. , so that the picker can select the goods required by the order from the goods moved by the robot and put them into the slot. When the goods in a slot are collected, the goods can be sent for secondary sorting or packaging processing. At the same time, the slot is released and re-enters the idle state, and the control device can then select the order and send it to the console for processing.

In other optional implementation manners, the order can also be sent to the operation console after the allocation, and the order can be queued at the operation console for processing.

In practical applications, when multiple pending orders are obtained, multiple orders can be allocated hierarchically according to their priorities, instead of all priority orders being mixed together for allocation, so as to avoid assigning the same priority as much as possible. of orders are assigned to the same console. The advantages of the embodiments of the present disclosure over the prior art are described below through a simple example.

For example, suppose there are 10 operating desks in total, and all orders are divided into three priority levels: high, medium, and low. There are 10 high-priority orders, and each console is assigned one high-priority order. There are 30 medium-priority orders, and each console is assigned to 3 medium-priority orders. There are 60 low-priority orders, and each console is assigned 6 low-priority orders. In this way, the priority of the orders of each operation station is balanced.

However, if the hierarchical allocation method according to the priority is not adopted, the 100 orders may be allocated together, which may lead to all 10 high-priority orders being allocated to one operation station, so that the robots are concentrated on this operation. Line up at the table, resulting in reduced efficiency.

To sum up, the order processing method provided in this embodiment can acquire pending orders, determine the priority of each order in the pending orders, and for multiple orders belonging to the same priority, An order is allocated among multiple operation stations, and orders that have been allocated to the operation station are sent to the corresponding operation station for processing. Orders can be allocated in batches according to their priorities, and orders of the same priority can be reduced to be assigned to the same operation station. The probability of the operation table improves the efficiency of order delivery.

On the basis of the technical solutions provided in the above embodiments, optionally, for multiple orders belonging to the same priority, the multiple orders are allocated among multiple operation consoles, which may be implemented in the following manner.

Sort the orders to be processed according to the priority, and sequentially process each priority according to the order of priority from high to low: Allocate all the orders corresponding to the priority, and determine all the orders There is an operation table corresponding to each order in the system, so that the order allocation can be realized according to the priority, so that the orders of each priority can be distributed evenly, and the efficiency of warehouse delivery can be further improved.

Optionally, when allocating an order corresponding to a certain priority, an order that has been allocated before may be considered.

Correspondingly, allocating all the orders corresponding to the priority, and determining the operation table corresponding to each order in the all orders may include: The operating table corresponding to the order allocates all the orders corresponding to the priority, and determines the operating table to which each order in all the orders corresponding to the priority is allocated; wherein, the divided order is an operation that has been allocated orders that have not yet been processed. Order allocation can be made more precise by taking divided orders into account when allocating.

For example, first allocate 10 orders with high priority, and then allocate 30 orders with medium priority after the allocation is completed. When allocating 30 orders with medium priority, you can consider The previous allocation result, that is, the allocation result of the 10 orders with high priority. Similarly, when allocating the 70 orders with low priority, the allocation results of the previous 40 orders can be considered, thereby improving the overall allocation effect of the orders.

After an order has been allocated, it has been sent to the operation table and the picking has been completed, then the order belongs to the processed order, and the order is no longer considered when the subsequent orders are allocated.

In the technical solutions provided by the embodiments of the present disclosure, the specific allocation strategy of the order can be set according to actual needs. Here is a specific implementation strategy, which can be based on the divided orders and their corresponding consoles, by evaluating the task volume of goods and/or goods corresponding to each console after all orders corresponding to the priority are allocated. The number of species determines the final allocation result.

Specifically, the goal of allocating orders may be: to make the task volume of goods on each operating table as balanced as possible, and the sum of the types and quantities of goods on all operating tables is as small as possible.

Wherein, the quantity of goods tasks of each operating table may refer to the total quantity of goods contained in all orders to which the operating table is allocated. The sum of the types and quantities of goods of all the operation stations may refer to the result obtained by directly adding the quantities of the types of goods allocated to each operation station.

Optionally, goods can be represented by SKU (Stock Keeping Unit). SKU is the unit of inventory in and out measurement, which can be extended to the abbreviation of the unified product number. Each product corresponds to a unique SKU number. The type of goods can refer to the type of SKU, and different SKUs correspond to different types.

Suppose that No. 1 console is assigned to 2 orders, one of which includes goods A and B, and the other order includes goods B and C. Therefore, the types of goods corresponding to No. 1 console include A, B, and C, then, 1 The number of types of goods on the console No. 3 is 3.

Assume that the number of types of goods on the No. 2 console is also 3, including goods A, C, and D. Then the sum of the types of goods on the No. 1 console and the No. 2 console is 3+3=6. Without distinguishing between the consoles, there are actually only four types of goods in all orders: A, B, C, and D, and the total number of goods types is 4. Therefore, the sum of the types of goods on the console may not be equal to the number of types of goods in all orders.

In practical applications, robots carry goods according to the console. Even if the same goods exist on different consoles, the robots often do not carry them together, so the types of goods cannot be combined. Through the above evaluation method, the sum of the types and quantities of goods on all consoles can be made as small as possible, and 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 cost of the robot to pick up the goods. less time.

Optionally, for all orders corresponding to any priority, all possible allocation schemes can be found, and then the optimal solution can be selected from all possible allocation schemes by scoring.

FIG. 4 is a schematic flowchart of allocating orders according to an embodiment of the present disclosure. As shown in FIG. 4 , according to the divided orders and their corresponding consoles, the final determination is made by evaluating the amount of cargo tasks and/or the number of types of goods corresponding to each console after all the orders corresponding to the priorities are allocated. The allocation result can include the following steps:

Step 401: Determine all possible allocation schemes according to all orders corresponding to the priority and multiple operation consoles.

Specifically, when allocating 10 high-priority orders, assuming that there are currently no divided orders, only the current 10 orders are considered, and all possible allocation schemes are traversed. Each allocation scheme specifies these 10 To which station the order is assigned.

Step 402: For any distribution scheme, calculate the score corresponding to the variance of the cargo task amount of the plurality of operation stations according to the divided orders and their corresponding operation stations and the distribution scheme, and/or calculate all The score corresponding to the sum of the number of types of goods on multiple consoles.

Step 403: Determine the final selected allocation scheme according to the calculated score.

The factors that can be considered when scoring include at least one of the following: the variance of the task volume of goods on multiple operating platforms, and the sum of the types and quantities of goods on multiple operating platforms. Each factor can have its corresponding score.

Optionally, there is a negative correlation between the variance of the task amount of the plurality of operation stations and the corresponding score, and/or, the sum of the number of types of goods of the plurality of operation stations and the corresponding score are negatively correlated. . The finally selected allocation scheme may be the scheme with the highest score.

Specifically, in each allocation scheme, the smaller the variance of the task volume of multiple consoles, the more balanced the task volume of each console, and the higher the corresponding score; the less the sum of the number of cargo types of all consoles , the less total handling the robot may need, the higher the corresponding score. The optimal solution can be selected only according to the score corresponding to the variance of the task volume, or only according to the score corresponding to the sum of the types and quantities of goods. Alternatively, the score corresponding to the variance 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 allocation plan with the highest total score can be selected as the final selected allocation plan, which can accurately select from multiple order plans. Select the optimal solution to ensure the delivery effect.

Through the allocation process shown in Figure 4, some given orders can be clustered and grouped according to the number of consoles. The goal is to make the task volume of each stack (operator) as balanced as possible, and the sum of the types of goods in all stacks. As few as possible, so as to prevent the robots from lining up on a certain operating table and improve the efficiency of warehouse delivery.

In addition, the allocation process can also be implemented through other allocation strategies. For example, the station to which each order is assigned may be determined in a sequential manner.

Specifically, each order can be allocated in turn, and when allocating each order, the current local optimal solution can be considered, that is, which console is optimal to allocate the current order to. The task volume of each station and/or the sum of the number of goods types of all stations can still be considered for each assignment. In this way, the final solution may not be the global optimal solution, but it is more efficient and has certain application value.

FIG. 5 is a schematic flowchart of another order processing method provided by an embodiment of the present disclosure. As shown in Figure 5, the method includes:

Step 501: Acquire pending orders, and determine the priority of each order in the pending orders.

Step 502: Sort the pending orders according to priority.

Step 503: In order of priority from high to low, perform the following processing on each priority: Allocate all orders corresponding to the priority, and determine the console corresponding to each order in all the orders.

In this embodiment, for the specific implementation principles and processes of steps 501 to 503, reference may be made to the foregoing embodiments, and details are not described herein again.

Step 504: Send the order that has been assigned to the console to the corresponding console for processing.

Optionally, when there are free slots on the console, orders can be selected and sent to the console according to a preset order issuing strategy. The newly sent order occupies the slot, and the picker can place the goods corresponding to the order in the slot.

Optionally, the order issuing strategy may include: when there is a free slot on any operating table, if there are remaining orders allocated to the operating table, according to the priority, the type of goods, the goods corresponding to the remaining orders. At least one of the quantities, select the order to send to the console. Wherein, the remaining orders allocated to the operation station may refer to orders that have been allocated to the operation station but have not been sent to the operation station.

Further, if there are no remaining orders allocated to the operation station, an order is selected from the remaining orders allocated to other operation stations and/or unassigned orders to be sent to the operation station.

According to the above-mentioned order issuing strategy, it can be divided into two levels: in the first step, each console only selects from its corresponding allocated orders. If its own orders have been selected, temporarily mark this console as Unmet consoles; the second step for all unmet consoles, pick orders from all remaining orders to these unsatisfied consoles. The factors considered when selecting an order may include at least one of the following: the priority of the order, the type of goods in the order, the quantity of goods in the order, and the like.

Optionally, according to the method provided in the foregoing embodiment, the orders of each priority can be allocated and processed separately. The goal of allocation is to make the task volume of each operating table as balanced as possible, and the sum of the types and quantities of goods on all operating tables. Keep it as small as possible so that a new order is allocated to the console and sent.

Step 505: Allocate a picking task to the robot according to the priority of the goods currently being processed by each operating console.

Optionally, according to the order sent to each operating table, the cargo demand of the operating table can be determined, and then according to the cargo demand of each operating table, a picking task can be assigned to the robot. When assigning picking tasks, consider the priority of the goods. The higher the priority of the goods, the more priority is assigned to the robot to pick up. For example, if the robot can pick up 5 items at a time, the robot can be instructed to pick up the 5 items with the highest priority first.

Optionally, the priority setting of the goods may adopt a strategy of dynamic adjustment over time. Specifically, for any order, the priority of the goods included in the order can be dynamically adjusted according to the delivery deadline of the order.

In an optional implementation manner, the priority of the goods changes with the priority of the order, and the priority of the order gradually increases as the delivery deadline gradually approaches. This method is simple and easy to implement.

In another optional implementation manner, dynamically adjusting the priority of the goods included in the order according to the delivery deadline of the order may include: when the delivery deadline of the order is between the delivery deadline and the current time When the time difference is greater than the preset time threshold, the priority of the goods included in the order is set to the lowest priority; when the time difference between the delivery deadline of the order and the current time is less than the preset time threshold, according to the According to the time difference, the priority of the goods included in the order is determined; when the delivery deadline is reached, the priority of the goods included in the order is set to the highest priority.

FIG. 6 is a schematic diagram of a change of cargo priority according to an embodiment of the present disclosure. As shown in Figure 6, when the delivery deadline of the order is still far away, such as when it is greater than a certain threshold, the priority of the goods in the order can be zero. When the order deadline is less than the set threshold, the priority begins to jump, and the priority of the goods in the order begins to gradually increase. When the order to which the goods belong is pending, that is, when the order deadline is reached, the priority of the goods increases to the highest priority set.

In the case where the priority of the goods is equal to the priority of the order, when the control device assigns tasks to the robot, the robot is always asked to pick up the goods in batches from high to low strictly according to the priority of the goods. This may not be optimal in terms of outbound efficiency, because it greatly limits the types of candidate goods that the robot can pick up each time, so that the robot may have to travel a long way to get the full goods.

Therefore, in this implementation manner, on the basis of ensuring that the order is not pending, the priority of the goods can be set in a flexible manner. When orders with different priorities are far away from their respective delivery deadlines, the priority of the goods corresponding to these orders can be set to 0, so that the types of goods that the robot can choose is greatly increased, which is conducive to improving the efficiency of picking up goods. Only when the order is approaching its own delivery deadline, does it start to adjust the priority of its corresponding goods, distinguish urgent orders, and give priority to the processing of urgent orders.

In the order processing method provided by this embodiment, when there is a free slot on any console, the order is first selected from the remaining orders corresponding to itself. On the basis of ensuring the priority processing of the orders allocated to itself, it can assist in processing the remaining orders of other consoles or orders that have not been allocated, effectively improving the overall order processing efficiency; for any order, according to the The delivery deadline of an order dynamically adjusts the priority of the goods included in the order, and further improves the delivery efficiency under the constraint that all orders are not pending.

On the basis of the technical solutions provided by the above embodiments, the function of order rollback can be further added. Optionally, acquiring pending orders, and determining the priority of each order in the pending orders may include: acquiring orders sent by the customer system; searching for an operation desk that is currently assigned but has not been sent to an operation. The order processed by the console is deleted, and the relationship between the found order and its assigned operation console is deleted; the order sent by the customer system and the found order are regarded as pending orders, and the priority of each order is determined.

Specifically, when a new batch of orders arrives, you can obtain orders that have been allocated to the console before but have not been sent to the console, and cancel the assignment results of these orders, that is, delete the association between these orders and the console relationship, these orders are regarded as orders that have not been assigned to the console, and they are combined with a new batch of orders for redistribution to improve the overall distribution effect of orders.

FIG. 7 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:

an acquisition module 701, configured to acquire pending orders, and determine the priority of each order in the pending orders;

an allocation module 702, configured to allocate the plurality of orders among the plurality of operation stations for the plurality of orders belonging to the same priority;

The sending module 703 is configured to send the order that has been assigned an operation station to a corresponding operation station for processing.

In an optional implementation manner, when determining the priority of each order in the pending orders, the obtaining module 701 is specifically configured to:

In an optional implementation manner, the allocation module 702 is specifically configured to:

sorting the pending orders according to priority;

In an optional implementation manner, when the allocation module 702 allocates all the orders corresponding to the priorities and determines the operation table corresponding to each order in the all orders, it is specifically used for:

In an optional implementation manner, the allocation module 702 allocates all orders corresponding to the priority according to the divided orders and the operating table corresponding to the divided orders, and determines the priority corresponding to the order. When each order is assigned to the operation table of all orders, it is specifically used for:

In an optional implementation manner, the allocation module 702 allocates all orders corresponding to the priority by evaluating the assigned orders and their corresponding operation stations, and the task volume of goods corresponding to each operation station and/or the number of types of goods, when determining the final distribution result, specifically for:

In an optional implementation manner, there is a negative correlation between the variance of the task amount of the plurality of operation stations and the corresponding score, and/or the sum of the types and quantities of goods of the plurality of operation stations and the corresponding Ratings are negatively correlated.

In an optional implementation manner, the sending module 703 is specifically configured to:

In an optional implementation manner, the sending module 703 is further configured to:

In an optional implementation manner, when dynamically adjusting the priority of the goods included in the order according to the delivery deadline of the order, the sending module 703 is specifically configured to:

When the time difference between the delivery deadline of the order and the current time is greater than the preset time threshold, setting the priority of the goods included in the order to the lowest priority;

In an optional implementation manner, the obtaining module 701 is specifically configured to:

Get the order sent by the customer's system;

The apparatus provided in this embodiment can be used to implement the technical solutions of the method embodiments shown in FIG. 1 to FIG. 6 , and the implementation principles and technical effects thereof are similar, and are not described again in this embodiment.

FIG. 8 is a schematic structural diagram of a control device according to an embodiment of the present disclosure. As shown in FIG. 8 , the control device in this embodiment may include:

at least one processor 801; and

a memory 802 in communication with the at least one processor;

Wherein, the memory 802 stores instructions that can be executed by the at least one processor 801, and the instructions are executed by the at least one processor 801, so that the control device executes the method described in any of the foregoing embodiments. method.

Optionally, the memory 802 may be independent or integrated with the processor 801 .

For the implementation principle and technical effect of the control device provided in this embodiment, reference may be made to the foregoing embodiments, and details are not described herein again.

An embodiment of the present disclosure further provides a storage system, including the control device and an operation table described in any of the foregoing embodiments.

Wherein, the operation console is used to acquire and process the order sent by the control device. Optionally, after acquiring the order, the operation console can play or display the order to the picker, for example, it can be displayed that the order in slot 1 includes: 5 pieces of A goods and 10 pieces of B goods.

In addition, the system may further include a robot, the robot is used to obtain the picking task sent by the control device, and according to the picking task, take out the goods from the warehouse and move them to the corresponding operating table for the picking personnel to pick up the goods. The goods are put into the slots of the operating table.

In the storage system provided by the embodiments of the present disclosure, the specific working principles, processes, and beneficial effects of the control device, the operating table, and the robot can be referred to the foregoing embodiments, which will not be repeated here.

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. .

Embodiments of the present disclosure also provide a computer program product, including a computer program, which implements the method described in any of the foregoing embodiments when the computer program is executed.

In the several embodiments provided in the present disclosure, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the device embodiments described above are only illustrative. For example, the division of the modules is only a logical function division. In actual implementation, there may be other division methods. For example, multiple modules may be combined or integrated. to another system, or some features can be ignored, or not implemented. On the other hand, 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.

The modules described as separate components may or may not be physically separated, and 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.

In addition, 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 various embodiments of the present disclosure.

It should be understood that the above-mentioned 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. 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.

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. The bus can be divided into address bus, data bus, control bus and so on. For ease of representation, 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. 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. Of course, 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). Of course, the processor and the storage medium may also exist in the electronic device or the host device as discrete components.

Those of ordinary skill in the art can understand that all or part of the steps of implementing the above method embodiments may be completed by program instructions related to hardware. The aforementioned program can be stored in a computer-readable storage medium. When the program is executed, the steps including the above method embodiments are executed; and the foregoing storage medium includes: ROM, RAM, magnetic disk or optical disk and other media that can store program codes.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present disclosure, but not to limit them; although the present disclosure has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: The technical solutions described in the foregoing embodiments can still be modified, or some or all of the technical features thereof can be equivalently replaced; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the technical solutions of the embodiments of the present disclosure. Scope.

Claims

An order processing method, comprising:

Obtain pending orders, and determine the priority of each order in the pending orders;

for multiple orders belonging to the same priority, allocating the multiple orders among multiple operation stations;

Send orders with assigned operation desks to the corresponding operation desks for processing.
The method according to claim 1, wherein determining the priority of each order in the pending orders comprises:

According to the delivery deadline of each order, determine the priority corresponding to the order;

Among them, the orders with the same delivery deadline belong to the same priority; or, the orders with the delivery deadline in the same time period belong to the same priority.
The method according to claim 1 or 2, characterized in that, for multiple orders belonging to the same priority, allocating the multiple orders among multiple operation stations comprises:

sorting the pending orders according to priority;

According to the order of priority from high to low, each priority is processed as follows: all the orders corresponding to the priority are allocated, and the operation table corresponding to each order in all the orders is determined.
The method according to claim 3, wherein allocating all the orders corresponding to the priorities, and determining the operation table corresponding to each order in the all orders, comprising:

If there is an already divided order, according to the divided order and the console corresponding to the divided order, all the orders corresponding to the priority are allocated, and it is determined that each order in all the orders corresponding to the priority is the assigned console;

Wherein, the divided order is an order that has been assigned an operation table but has not yet been processed.
The method according to claim 4, wherein all orders corresponding to the priority are allocated according to the divided orders and the operating table corresponding to the divided orders, and all orders corresponding to the priority are determined. The station to which each order in the order is assigned, including:

According to the divided orders and their corresponding operation stations, the final assignment result is determined by evaluating the amount of cargo tasks and/or the number of types of goods corresponding to each operation station after all orders corresponding to the priorities are assigned.
The method according to claim 5, characterized in that, according to the divided orders and their corresponding operation stations, after all the orders corresponding to the priority are assigned through evaluation, the cargo task volume and/or the corresponding operation stations are evaluated. or the number of types of goods to determine the final distribution results, including:

Determine all possible allocation schemes according to all orders corresponding to the priority and multiple operating desks;

For any distribution scheme, according to the divided order and its corresponding operation station and the distribution scheme, calculate the score corresponding to the variance of the cargo task amount of the multiple operation stations, and/or calculate the multiple operation stations. The score corresponding to the sum of the types and quantities of goods on the console;

Based on the calculated scores, the final selected allocation scheme is determined.
The method according to claim 6, characterized in that there is a negative correlation between the variance of the task amount of the plurality of operation stations and the corresponding score, and/or the difference between the types and quantities of goods of the plurality of operation stations and the corresponding scores are negatively correlated.
The method according to any one of claims 1-7, characterized in that, sending an order that has been assigned an operation station to a corresponding operation station for processing, comprising:

When there is a free slot on any console, if there are remaining orders allocated to the console, according to at least one of the priority, the type of goods, and the quantity of goods corresponding to the remaining orders, choose to send to the said console. Console order.
The method of claim 8, further comprising:

If there are no remaining orders assigned to the operation station, an order is selected from the remaining orders assigned to other operation stations and/or unassigned orders to be sent to the operation station.
The method according to any one of claims 1-9, characterized in that, further comprising:

According to the priority of the goods currently processed by each operation station, the robot is assigned to pick up tasks.
The method of claim 10, further comprising:

For any order, the priority of the goods included in the order is dynamically adjusted according to the delivery deadline of the order.
The method according to claim 11, wherein dynamically adjusting the priority of the goods included in the order according to the delivery deadline of the order, comprising:

When the time difference between the delivery deadline of the order and the current time is greater than the preset time threshold, setting the priority of the goods included in the order to the lowest priority;

When the time difference between the delivery deadline of the order and the current time is less than a preset time threshold, determining the priority of the goods included in the order according to the time difference;

When the delivery deadline is reached, the priority of the goods included in the order is set to the highest priority.
The method according to any one of claims 1-12, wherein obtaining the pending orders, and determining the priority of each order in the pending orders, comprising:

Get the order sent by the customer's system;

Find orders that are currently assigned to the console but have not been sent to the console for processing, and delete the association between the found order and its assigned console;

The orders sent by the client system and the found orders are regarded as pending orders, and the priority of each order is determined.
An order processing device, characterized in that it includes:

an acquisition module, used for acquiring pending orders, and determining the priority of each order in the pending orders;

an allocation module, used for allocating the plurality of orders among the plurality of operation stations for the plurality of orders belonging to the same priority;

The sending module is used to send the order that has been assigned to the operating table to the corresponding operating table for processing.
A control device, characterized in that it includes:

at least one processor; and

a memory communicatively coupled to the at least one processor;

Wherein, 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 execute the control device according to any one of claims 1-13. method.
A storage system, characterized in that, comprising: the control device of claim 15 and an operating table;

The operating console is used to acquire and process the orders sent by the control device.
A computer-readable storage medium, wherein computer-executable instructions are stored in the computer-readable storage medium, and when a processor executes the computer-executable instructions, the computer-executable instructions according to any one of claims 1-13 are implemented. method.
A computer program product, characterized in that it comprises a computer program, which implements the method according to any one of claims 1-13 when the computer program is executed.