Method, device, storage medium and electronic device for generating picking tasks
By combining the distance and stacking relationship between the goods and the storage location and picking storage location, a picking task map is generated, which solves the problem of unreasonable picking tasks in B2B warehousing and distribution business, and improves the picking efficiency and task rationality.
Patent Information
- Application Number
- CN202010131368.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2020-02-28
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2040-02-28
AI Technical Summary
In the B2B warehousing and distribution business scenario, the existing technology fails to effectively consider the limitations of the picking operation range when generating picking tasks, resulting in unreasonable picking tasks and affecting picking efficiency.
By determining the distance between the goods and the storage space, the distance between the picking storage location and the storage space, and the stacking relationship between the goods, a picking task map is generated, and the picking task nodes and paths are optimized to ensure the rationality of the task. and efficiency.
It improves picking efficiency, reduces invalid time and travel distance, and ensures that the rationality of the picking task matches the actual scenario.
Smart Images

Figure CN111369189B_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the field of order picking, and in particular, to a method, device, storage medium and electronic device for generating a picking task. Background Art
[0002] In the warehousing and distribution business scenario under the B2B business model, customers place orders before the order deadline. After the order deadline, the warehousing and distribution management system can arrange the delivery route according to the order delivery address (i.e. the arranging stage). After the arranging is completed, picking tasks can be generated according to the order requirements in the arranging route. After that, the warehousing and distribution staff can pick the goods according to the picking tasks so that the goods can be delivered after the picking is completed. In this business scenario, the rationality of the generated picking tasks directly affects the picking efficiency of the staff.
[0003] The optimization methods for picking task generation are mostly optimized from two aspects: order batching and path planning. Existing research mainly focuses on B2C warehouse picking scenarios, and the distance calculation and estimation during path planning all consider the travel distance within the picking area. In the B2B business scenario, the picking operation scope is not limited to the picking area. Therefore, the use of existing technical solutions will lead to unreasonable generated picking tasks, thereby affecting picking efficiency. Summary of the invention
[0004] The purpose of the present disclosure is to provide a method, device, storage medium and electronic device for generating a picking task.
[0005] In a first aspect, a method for generating a picking task is provided, the method comprising: for each of a plurality of target orders, determining the picking information corresponding to each of the goods in the target order; for any two of the plurality of picking information, determining, according to a preset position correspondence, a first distance between the storage locations where the goods respectively corresponding to the any two picking information are located, and a second distance between the picking storage locations respectively corresponding to the any two picking information; wherein the preset position correspondence comprises a correspondence between the goods and the storage locations where the goods are stored in the warehouse, and a correspondence between different wiring information and the picking storage locations, the picking storage locations being locations where the goods corresponding to the same wiring information are stored after the picking is completed; for each of the plurality of picking information, determining, according to the preset position correspondence, a third distance between the storage location where the goods corresponding to the picking information are located and the picking storage location corresponding to the picking information; generating a picking task according to the picking information corresponding to the plurality of target orders, the first distance, the second distance, and the third distance.
[0006] Optionally, generating a picking task according to the picking information corresponding to the multiple target orders, the first distance, the second distance, and the third distance includes: generating the picking task node according to the goods corresponding to each picking information, the picking task node corresponding to the goods one-to-one; determining a first connecting edge between two picking task nodes, and a second connecting edge between a preset node and any of the picking task nodes, the preset node representing the starting node and the ending node of each picking; taking the sum of the first distance and the second distance corresponding to the two picking task nodes connected by the first connecting edge as the weight of the first connecting edge, and taking the third distance corresponding to the picking task node connected by the second connecting edge as the weight corresponding to the second connecting edge; generating the picking task graph according to the preset node, multiple picking task nodes, the weight of the first connecting edge, and the weight of the second connecting edge; generating the picking task according to the picking task graph.
[0007] Optionally, the picking task graph includes a picking task directed graph. Before generating the picking task graph according to the preset nodes, multiple picking task nodes, the weight of the first connecting edge and the weight of the second connecting edge, the method also includes: determining the direction of the connecting edge between the picking task nodes according to a preset stacking constraint rule, and the preset stacking constraint rule is used to characterize whether any two goods corresponding to the picking information can be stacked; generating the picking task graph according to the preset nodes, multiple picking task nodes, the weight of the first connecting edge and the weight of the second connecting edge includes: generating the picking task directed graph according to the preset nodes, multiple picking task nodes, the weight of the first connecting edge, the weight of the second connecting edge and the direction.
[0008] Optionally, generating the picking task according to the picking task graph includes: determining a first root node among multiple nodes of the picking task directed graph; generating a minimum tree graph with the first root node as the root according to a preset tree graph generation algorithm; and generating the picking task according to the minimum tree graph.
[0009] Optionally, determining the first root node among the multiple nodes of the picking task directed graph includes: taking a node with the smallest out-degree among the nodes of the picking task directed graph as the first root node.
[0010] Optionally, generating the picking task according to the minimum tree diagram includes: taking each node in the minimum tree diagram as the second root node, determining multiple subtrees corresponding to the minimum tree diagram, and the subtrees correspond to the second root nodes one by one; determining the sum of weights of directed edges corresponding to each subtree, and the sum of parameters of goods corresponding to the picking task nodes of each subtree, the sum of parameters including weight sum and / or volume sum; obtaining preset parameters and thresholds corresponding to the picking equipment; determining a target subtree from the multiple subtrees, the target subtree being a subtree whose sum of parameters is less than or equal to the preset parameters and thresholds and whose sum of weights is the smallest; generating the picking task according to the goods corresponding to all picking task nodes of the target subtree.
[0011] Optionally, after the picking task is generated according to the goods corresponding to all the picking task nodes of the target subtree, the method further includes: deleting the nodes corresponding to the target subtree in the picking task directed graph to obtain an updated picking task directed graph; if the node set corresponding to the updated picking task directed graph is non-empty, generating a new minimum tree graph corresponding to the updated picking task directed graph, and regenerating the picking task according to the new minimum tree graph; if the node set corresponding to the updated picking task directed graph is empty, determining that the picking task generation is completed.
[0012] In a second aspect, a device for generating a picking task is provided, the device comprising: a cargo information determination module, for determining, for each of a plurality of target orders, the picking information corresponding to each cargo in the target order; a first determination module, for determining, for any two of the plurality of picking information, a first distance between the storage locations where the cargo corresponding to the two picking information are located, and a second distance between the picking storage locations corresponding to the two picking information respectively, according to a preset position correspondence relationship; wherein the preset position correspondence relationship comprises a correspondence relationship between cargo and the storage locations where the cargo is stored in a warehouse, and a correspondence relationship between different wiring information and the picking storage locations, the picking storage locations being locations where cargo corresponding to the same wiring information is stored after the picking is completed; a second determination module, for determining, for each of the plurality of picking information, a third distance between the storage location where the cargo corresponding to the picking information is located, and the picking storage location corresponding to the picking information, according to the preset position correspondence relationship; a task generation module, for generating a picking task according to the picking information corresponding to the plurality of target orders, the first distance, the second distance, and the third distance.
[0013] Optionally, the task generation module is used to generate the picking task node according to the goods corresponding to each picking information, and the picking task node corresponds to the goods one by one; determine the first connecting edge between two of the picking task nodes, and the second connecting edge between a preset node and any of the picking task nodes, and the preset node represents the starting node and the ending node of each picking; use the sum of the first distance and the second distance corresponding to the two picking task nodes connected by the first connecting edge as the weight of the first connecting edge, and use the third distance corresponding to the picking task node connected by the second connecting edge as the weight corresponding to the second connecting edge; generate the picking task graph according to the preset node, multiple picking task nodes, the weight of the first connecting edge and the weight of the second connecting edge; generate the picking task according to the picking task graph.
[0014] Optionally, the picking task graph includes a picking task directed graph, and the task generation module is further used to determine the direction of the connecting edges between the picking task nodes according to a preset stacking constraint rule, and the preset stacking constraint rule is used to characterize whether any two goods corresponding to the picking information can be stacked, and generate the picking task directed graph according to the preset nodes, multiple picking task nodes, the weight of the first connecting edge, the weight of the second connecting edge and the direction.
[0015] Optionally, the task generation module is used to determine a first root node among multiple nodes of the picking task directed graph, generate a minimum tree graph with the first root node as the root according to a preset tree graph generation algorithm, and generate the picking task according to the minimum tree graph.
[0016] Optionally, the task generation module is used to use the node with the smallest out-degree among the nodes of the picking task directed graph as the first root node.
[0017] Optionally, the task generation module is used to take each node in the minimum tree diagram as the second root node, determine multiple subtrees corresponding to the minimum tree diagram, and the subtrees correspond to the second root nodes one by one; determine the sum of weights of the directed edges corresponding to each subtree, and the sum of parameters of the goods corresponding to the picking task nodes of each subtree, the sum of parameters including the sum of weight and / or the sum of volume; obtain preset parameters and thresholds corresponding to the picking equipment; determine a target subtree from the multiple subtrees, the target subtree being the subtree whose sum of parameters is less than or equal to the preset parameters and thresholds and whose sum of weights is the smallest; and generate the picking task according to the goods corresponding to all the picking task nodes of the target subtree.
[0018] Optionally, the device also includes: an updating module, used to delete the nodes corresponding to the target subtree in the picking task directed graph to obtain an updated picking task directed graph; a tree graph generation module, used to generate a new minimum tree graph corresponding to the updated picking task directed graph if the node set corresponding to the updated picking task directed graph is non-empty, and regenerate the picking task according to the new minimum tree graph; if the node set corresponding to the updated picking task directed graph is empty, it is determined that the picking task generation is completed.
[0019] In a third aspect, a computer-readable storage medium is provided, on which a computer program is stored, and when the program is executed by a processor, the steps of the method described in the first aspect of the present disclosure are implemented.
[0020] In a fourth aspect, an electronic device is provided, comprising: a memory on which a computer program is stored; and a processor for executing the computer program in the memory to implement the steps of the method described in the first aspect of the present disclosure.
[0021] Through the above-mentioned technical scheme, the present invention integrates multiple information data such as picking information, routing distances between cargo storage locations, routing distances between picking storage locations, and distances between cargo storage locations and corresponding picking storage locations to generate picking tasks. While providing a more effective data structure and highly integrated information for picking task optimization, it also makes the generated picking tasks more in line with actual picking scenarios. In this way, when staff pick goods based on the picking tasks, on the one hand, they can effectively avoid aimlessly searching for goods in the warehouse during the picking process and reduce invalid time. On the other hand, they can effectively reduce the travel distance during the picking process, shorten the picking operation time, and improve the picking efficiency.
[0022] Other features and advantages of the present disclosure will be described in detail in the following detailed description. BRIEF DESCRIPTION OF THE DRAWINGS
[0023] The accompanying drawings are used to provide a further understanding of the present disclosure and constitute a part of the specification. Together with the following specific embodiments, they are used to explain the present disclosure but do not constitute a limitation of the present disclosure. In the accompanying drawings:
[0024] Figure 1 It is a schematic diagram of the warehouse and distribution business process involved in an actual B2B business model;
[0025] Figure 2 It is a schematic diagram of a picking scenario involved in an actual B2B business model;
[0026] Figure 3 is a flowchart of a first method for generating a picking task according to an exemplary embodiment;
[0027] Figure 4 is a flow chart of a second method for generating a picking task according to an exemplary embodiment;
[0028] Figure 5 is a schematic diagram of a scenario of gridding a warehouse according to an exemplary embodiment;
[0029] Figure 6 is a schematic diagram of a directed graph of a picking task according to an exemplary embodiment;
[0030] Figure 7 is a schematic diagram of a stacked constraint directed graph according to an exemplary embodiment;
[0031] Figure 8 is a schematic diagram of a minimum tree diagram according to an exemplary embodiment;
[0032] Fig. 9 is a block diagram of a first device for generating a picking task according to an exemplary embodiment;
[0033] Fig.10 is a block diagram of a second device for generating a picking task according to an exemplary embodiment;
[0034] Fig.11 The present invention is a structural block diagram of an electronic device according to an exemplary embodiment. DETAILED DESCRIPTION
[0035] The specific implementation of the present disclosure is described in detail below in conjunction with the accompanying drawings. It should be understood that the specific implementation described herein is only used to illustrate and explain the present disclosure, and is not used to limit the present disclosure.
[0036] First, the application scenarios of the present disclosure are introduced. The present disclosure is mainly applied to the warehousing and distribution business scenarios in the B2B business model. For example, Figure 1 This is a typical diagram of the warehouse and distribution business process involved in the actual B2B business model, such as Figure 1 As shown in the figure, the customer places an order before the order deadline (T1). After the order deadline, the warehouse and distribution management system can arrange the distribution route and allocate the distribution force according to the order quantity and the order delivery location (this is the line arrangement stage). After the line arrangement ends (T2), according to the order requirements in the line arrangement route, a picking task is generated in the time period from T2 to T3. After the picking task is generated, the warehouse and distribution staff will pick the goods according to the picking task, and then deliver them according to the allocated distribution force. In this business scenario, the batch delivery mode is usually adopted. Its typical picking scenario is as follows: Figure 2As shown in Figure 1, the warehouse is mainly divided into several functional areas, such as storage area, picking area, picking dock, etc. In batch line picking operations, warehouse staff need to pick the order goods contained in each line from the goods storage location in the picking area and transport them to the picking storage location corresponding to the line (such as Figure 2 The picking dock shown in the figure, and the wiring lines correspond one-to-one to the picking dock), and the basic basis for warehouse staff to pick is the picking tasks generated by the warehouse distribution management system. Whether the generated picking tasks are reasonable or not directly affects the picking efficiency of the staff.
[0037] The optimization methods for picking task generation are mostly optimized from two aspects: order batching and path planning. Existing research mainly focuses on B2C warehouse picking scenarios, and the distance calculation and estimation during path planning all consider the travel distance within the picking area. In the B2B business scenario, picking is not just done within the picking area, but also includes the area where the picking dock is located. Therefore, only considering the distance within the picking area will result in the generated picking task not considering the relevant distance of the picking dock, making the generated picking task inconsistent with the actual picking scenario, thereby affecting the picking efficiency of the staff. In addition, the picking and delivery tasks of large-scale batch distribution are very heavy, and the picking operation can only start after the picking task is generated. In order to receive as many orders as possible, the order deadline is usually postponed. These two aspects squeeze the picking task generation time, resulting in a slower picking task, and then resulting in lower overall picking efficiency.
[0038] In order to solve the above-mentioned problems, the present disclosure provides a method, device, storage medium and electronic device for generating a picking task, which can first determine the picking information corresponding to each of the target orders in a plurality of target orders, and then determine, for any two of the plurality of picking information, a first distance between the storage locations where the goods respectively corresponding to the any two picking information are located, and a second distance between the picking storage locations respectively corresponding to the any two picking information according to a preset position correspondence relationship; wherein the preset position correspondence relationship includes a correspondence relationship between the goods and the storage locations where the goods are stored in the warehouse, and a correspondence relationship between different arrangement line information and the picking storage location, the picking storage location being the location where the goods corresponding to the same arrangement line information are stored after the picking is completed, and for any two of the plurality of picking information, a first distance between the storage locations where the goods respectively corresponding to the any two picking information are located, and a second distance between the picking storage locations respectively corresponding to the any two picking information; wherein the preset position correspondence relationship includes a correspondence relationship between the goods and the storage locations where the goods are stored in the warehouse, and a correspondence relationship between different arrangement line information and the picking storage location, the picking storage location being the location where the goods corresponding to the same arrangement line information are stored after the picking is completed, and for the plurality of the picking information For each picking information in the target order, the storage location of the goods corresponding to the picking information is determined according to the preset position correspondence, and the third distance from the picking storage location corresponding to the picking information is determined; finally, a picking task is generated according to the picking information corresponding to the target order, the first distance, the second distance and the third distance; the picking task is used to instruct the picking device to pick up the goods, thereby providing a more effective data structure and highly integrated information for the picking task optimization, and also making the generated picking task more in line with the actual picking scenario. In this way, when the staff picks the goods based on the picking task, on the one hand, it can effectively avoid aimlessly searching for goods in the warehouse during the picking process and reduce invalid time; on the other hand, it can effectively reduce the travel distance and the picking operation time during the picking process and improve the picking efficiency.
[0039] The specific embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.
[0040] Figure 3 is a flowchart of a method for generating a picking task according to an exemplary embodiment. Figure 3 As shown, the method comprises the following steps:
[0041] In step 301, for each target order among multiple target orders, picking information corresponding to each cargo in the target order is determined.
[0042] In this step, multiple target orders to be picked and the line arrangement information of each target order can be obtained, and then the picking information corresponding to each item in the target order is determined according to the line arrangement information.
[0043] Among them, the target order may include orders placed by customers before a preset order deadline. After obtaining multiple target orders, the warehouse and distribution management system can arrange the delivery route according to the delivery address of each target order to obtain the route information. This process is the route arrangement process. The route arrangement information may include the identification of the delivery route (or route arrangement), the goods to be delivered in the delivery route and their quantity, and other information.
[0044] The picking information can be defined from two dimensions: the line and the item. The specific form can be: <line, item, quantity>, that is, the quantity of a certain item in a line that needs to be picked, which can generally be expressed as:
[0045] tk i =(line j ,sku i ,q)
[0046] Among them, sku i Indicates the item of goods, q indicates that the item of goods is sku i The quantity of goods, tk i Indicates that the line is arranged according to the jth line j The goods items to be delivered are sku i The i-th picking information corresponding to the goods.
[0047] In step 302, for any two of the plurality of picking information, a first distance to the storage location where the goods corresponding to the two picking information are located and a second distance to the picking storage location corresponding to the two picking information are determined according to a preset position correspondence.
[0048] The preset position correspondence relationship includes the correspondence relationship between the goods and the storage location where the goods are stored in the warehouse, and the correspondence relationship between different line information and the picking storage location. The picking storage location is the location where the goods corresponding to the same line information are stored after the picking is completed. For example, the picking storage location is Figure 2 The single-line dock shown in the figure can, during the picking process, place the goods to be delivered on the same line at the single-line dock corresponding to the same line for unified delivery after picking is completed.
[0049] In step 304, for each of the plurality of picking information, the storage location where the goods corresponding to the picking information are located and the third distance between the storage location of the goods corresponding to the picking information and the picking information are determined according to the preset position correspondence relationship.
[0050] In step 305, a picking task is generated according to the picking information corresponding to the plurality of target orders, the first distance, the second distance, and the third distance.
[0051] The picking task is used to instruct the staff to pick the goods.
[0052] In a possible implementation, a picking task can be generated by following the steps below:
[0053] S1. Generate a picking task node according to the goods corresponding to each picking information.
[0054] Among them, the picking task node corresponds to the goods one by one.
[0055] S2. Determine the first connecting edge between the two picking task nodes, and the second connecting edge between the preset node and any of the picking task nodes, and use the sum of the first distance and the second distance corresponding to the two picking task nodes connected by the first connecting edge as the weight of the first connecting edge, and use the third distance corresponding to the picking task node connected by the second connecting edge as the weight corresponding to the second connecting edge.
[0056] The preset nodes represent the starting and ending nodes of each picking operation.
[0057] S3. Generate the picking task graph according to the preset node, the plurality of picking task nodes, the weight of the first connecting edge, and the weight of the second connecting edge.
[0058] In this step, you can first create an empty picking task graph, and add a preset node to the picking task graph, and then add multiple picking task nodes to the picking task graph, and connect two of the picking task nodes to obtain a first connection edge, and connect the preset node and any of the picking task nodes to obtain a second connection edge, and set the weights of the first connection edge and the second connection edge to obtain the picking task graph.
[0059] It should be noted that, considering that most of the existing picking tasks assume that the goods can be stacked arbitrarily on the picking truck, this may not have much impact on some small goods or light goods. However, for some goods that cannot withstand stacking, it may cause damage to the goods. For example, some goods are fragile goods (such as glass products, etc.), and stacking other goods on these fragile goods may cause these fragile goods to be crushed. Therefore, in order to solve this problem, in another embodiment of the present disclosure, in the process of generating a picking task graph, the direction of the edges between the picking task nodes can also be used to represent whether any two goods corresponding to the picking information can be stacked, so that the stacking relationship between the goods is used as a reference factor for generating the picking task graph, and then a picking task directed graph is obtained. For example, before step S3, the direction of the connection edge between the picking task nodes can also be determined according to the preset stacking constraint rule, and the preset stacking constraint rule is used to characterize whether any two goods corresponding to the picking information can be stacked, so that in step S3, the picking task directed graph can be generated according to the preset node, multiple picking task nodes, the weight of the first connection edge, the weight of the second connection edge and the direction. In this way, the picking task directed graph obtained by the above method can clearly indicate whether different goods can be stacked, so that the picking tasks generated later according to the picking task directed graph are more reasonable and accurate.
[0060] S4. Generate the picking task according to the picking task graph.
[0061] In this step, when the picking task graph is a picking task directed graph, the picking tasks can be generated according to the picking task directed graph in the following manner:
[0062] First, a first root node may be determined among multiple nodes of the picking task directed graph.
[0063] For example, the node with the smallest out-degree among the nodes of the picking task directed graph may be used as the first root node.
[0064] It should be noted here that, in the above process of generating the picking task graph, if the stacking relationship between the goods is not considered, the connecting edges in the generated picking task graph do not include direction, that is, the picking task graph is equivalent to an undirected graph, and there is no such thing as out-degree. At this time, the node with the smallest degree among the nodes of the picking task directed graph can be used as the first root node.
[0065] Secondly, a minimum tree graph with the first root node as the root is generated according to a preset tree graph generation algorithm.
[0066] Finally, the picking task is generated according to the minimum tree graph.
[0067] In a possible implementation, after obtaining the minimum tree diagram, each node in the minimum tree diagram can be used as the second root node to determine multiple subtrees corresponding to the minimum tree diagram, the subtrees corresponding to the second root node one by one, and the weight sum of the directed edges corresponding to each subtree, as well as the sum of the parameters of the goods corresponding to the picking task node of each subtree are determined, the sum of the parameters includes the weight sum and / or the volume sum, and the preset parameters and thresholds corresponding to the picking device are obtained, and the target subtree is determined from the multiple subtrees, the target subtree is the subtree with the sum of the parameters less than or equal to the preset parameters and thresholds, and the weight sum is the smallest, and finally, the picking task is generated according to the goods corresponding to all the picking task nodes of the target subtree. In this way, the picking task is generated according to the minimum tree diagram of the picking task graph, without traversing the entire picking task graph, which greatly reduces the search space, improves the generation speed of the picking task, and thus improves the generation efficiency of the picking task.
[0068] It should be noted that the above-mentioned implementation method of generating the picking task according to the picking task graph is explained by taking the picking task graph as a picking task directed graph as an example. For the case where whether the goods are stacked or not, the generated picking task graph can be an undirected graph. In this case, the implementation method of generating the picking task according to the picking task graph can refer to the above-mentioned method of generating the picking task according to the picking task directed graph, and this embodiment will not be repeated here.
[0069] By adopting the above method, a picking task is generated by integrating multiple information data such as picking information, routing distances between cargo storage locations, routing distances between picking storage locations, and distances between cargo storage locations and corresponding picking storage locations. While providing a more effective data structure and highly integrated information for picking task optimization, the generated picking task also makes the generated picking task more in line with actual picking scenarios. In this way, when the staff picks based on the picking task, on the one hand, they can effectively avoid aimlessly searching for goods in the warehouse during the picking process and reduce invalid time. On the other hand, they can effectively reduce the travel distance during the picking process, shorten the picking operation time, and improve the picking efficiency.
[0070] Figure 4 is a flowchart of a method for generating a picking task according to an exemplary embodiment. Figure 4 As shown, in this embodiment, taking the picking task graph as a picking task directed graph as an example for explanation, the method includes the following steps:
[0071] In step 401, a plurality of target orders to be picked and the arrangement information of each target order are obtained.
[0072] Among them, the target order may include orders placed by customers before a preset order deadline. After obtaining multiple target orders, the warehouse and distribution management system can arrange the delivery route according to the delivery address of each target order to obtain the route information. This process is the route arrangement process. The route arrangement information may include the identification of the delivery route (or route arrangement), the goods to be delivered in the delivery route and their quantity, and other information.
[0073] For example, suppose that three target orders, Order 1, Order 2, and Order 3, are obtained. Order 1 contains Goods A, and the quantity of Goods A is 10. The delivery address corresponding to Order 1 is Address 1; Order 2 contains Goods B, and the quantity of Goods B is 20. The delivery address corresponding to Order 2 is Address 2; Order 3 contains Goods C, and the quantity of Goods C is 30. The delivery address corresponding to Order 3 is Address 3. Assuming that Address 1 and Address 2 can be delivered on one delivery route, and Address 3 needs to be delivered on another delivery route, when the three target orders are delivered, After the lines are arranged, the line information corresponding to order 1 and order 2 is (L1; A: 10; B: 20), and the line information corresponding to order 3 is (L2; C: 30), wherein Li is the identifier of the delivery line, indicating the i-th line, (L1; A: 10; B: 20) indicates that goods A and goods B need to be delivered on line L1, and the quantity of goods A is 10, and the quantity of goods B is 20; (L2; C: 30) indicates that goods C needs to be delivered on line L2, and the quantity of goods C is 30. The above examples are only for illustration, and the present disclosure is not limited to this.
[0074] In step 402, for each of the target orders among the multiple target orders, the picking information corresponding to each of the goods in the target order is determined according to the line arrangement information.
[0075] In a possible implementation, the picking information can be defined from two dimensions: the line and the item. The specific form can be: <line, item, quantity>, that is, the quantity of a certain item in a certain line that needs to be picked, which can generally be expressed as:
[0076] tk i =(line j ,sku i ,q)
[0077] Among them, sku i Indicates the item of goods, q indicates that the item of goods is sku i The quantity of goods, tk i Indicates that the line is arranged according to the jth line j The goods items to be delivered are sku i The i-th picking information corresponding to the goods.
[0078] In a possible implementation of this step, the picking information corresponding to each cargo may be determined according to the cabling identifier in the cabling information, the cargo to be delivered on the cabling corresponding to the cabling identifier, and the quantity thereof.
[0079] For example, continuing with the example in step 401, assuming that the line information corresponding to order 1 and order 2 is (L1; A: 10; B: 20), and the line information corresponding to order 3 is (L2; C: 30), that is, goods A and goods B need to be delivered on the line information L1, and goods C needs to be delivered on the line information L2. Then, based on the line information, it can be determined that the picking information corresponding to goods A is (L1, A, 10), the picking information corresponding to goods B is (L1, B, 20), and the picking information corresponding to goods C is (L2, C, 30). The above examples are only for illustrative purposes and the present disclosure is not limited to this.
[0080] In step 403, for any two picking information among the multiple picking information, a first distance between the storage location where the goods corresponding to the any two picking information are located and a second distance between the picking storage location corresponding to the any two picking information are determined according to a preset position correspondence relationship; for each picking information among the multiple picking information, a third distance between the storage location where the goods corresponding to the picking information are located and the picking storage location corresponding to the picking information is determined according to the preset position correspondence relationship.
[0081] The preset position correspondence relationship includes the correspondence relationship between the goods and the storage location where the goods are stored in the warehouse, and the correspondence relationship between different line information and the picking storage location. The picking storage location is the location where the goods corresponding to the same line information are stored after the picking is completed. For example, the picking storage location is Figure 2 The single-line dock shown in the figure can, during the picking process, place the goods to be delivered on the same line at the single-line dock corresponding to the same line for unified delivery after picking is completed.
[0082] For example, taking the three picking information (L1, A, 10), (L1, B, 20) and (L2, C, 30) in the step 402 example, the first distance includes the distance between the storage location for storing goods A and the storage location for storing goods B, the distance between the storage location for storing goods A and the storage location for storing goods C, and the distance between the storage location for storing goods B and the storage location for storing goods C. The second distance includes the distance between the single line terminal corresponding to line LI and the single line terminal corresponding to line L2. The third distance includes the distance between the storage location of goods A and the single line terminal corresponding to line L1 (the line corresponding to goods A), the distance between the storage location of goods B and the single line terminal corresponding to line L1, and the distance between the storage location of goods C and the single line terminal corresponding to line L2.
[0083] In a possible implementation of this step, the target area in the warehouse can be first divided into grids, and the target area includes a picking area and a picking storage location area. Then, the attribute information of each grid is determined according to a preset layout of the target area. The attribute information includes a storage location identifier, an aisle identifier, or a picking completion location identifier. In this way, the first distance, the second distance, and the third distance can be determined according to the preset position correspondence and the attribute information using a preset distance algorithm, wherein the preset distance algorithm may include an A* algorithm.
[0084] For example, Figure 5 According to an exemplary embodiment, Figure 2 The schematic diagram of the scenario of grid division of warehouse in the business scenario shown in FIG. Figure 5 As shown, the picking area and the picking dock area in the warehouse can be divided into grids. For example, when dividing the grids, the size of each grid can be set according to the size of each storage location, and then the attributes of each grid can be set according to the warehouse layout of the picking area and the picking dock area to obtain the attribute information of each grid (for example, if a grid only contains Figure 2 The lane area shown in the figure records the attribute of the grid as the lane identification. If a grid contains Figure 2 The storage area shown in the figure, the attribute of the grid is recorded as the identification of the storage location), the grids where the storage locations are selected two by two, the A* algorithm is used to calculate the distance between the grids where the two currently selected storage locations are located, and the distance is recorded in the distance matrix between the storage locations shown in Table 1. Similarly, the grids where the single-line terminal is located are selected two by two, the A* algorithm is used to calculate the distance between the grids where the two currently selected single-line terminals are located, and the distance is recorded in the distance matrix between the terminals shown in Table 2; the grid where any storage location is located and the grid where any terminal is located are selected, the A* algorithm is used to calculate the distance between the grid where the currently selected storage location is located and the grid where the terminal is located, and the distance is recorded in the distance matrix between the terminal and the storage location shown in Table 3, thereby recording the three distance data in the picking operation scene in a table. The above examples are only for illustration, and the present disclosure does not limit this. Because the three distances are basically static, as long as the warehouse layout remains unchanged, they do not need to be calculated every time; if the warehouse layout changes, it is recalculated once, and the calculation result can be stored in the database as basic data, wherein Si in Table 1 represents the i-th storage location, D s,ij represents the distance between the i-th storage location and the j-th storage location, Ki in Table 2 represents the i-th terminal, D k,ij represents the distance between the i-th pier and the j-th pier. In Table 3, Si represents the i-th storage location, Ki represents the i-th pier, and D si,ki Represents the distance between the i-th storage location and the i-th dock.
[0085] In addition, the specific calculation method of calculating the above three distances through the A* algorithm after grid division can refer to the relevant description in the existing literature, and the present disclosure does not limit this.
[0086] S1 S2 ....... Si ....... Sn S1 0 <![CDATA[D s,12 ]]> ....... <![CDATA[D s,1i ]]> ....... <![CDATA[D s,1n ]]> S2 <![CDATA[D s,21 ]]> 0 ....... <![CDATA[D s,2i ]]> ....... <![CDATA[D s,2n ]]> ...... ...... ...... ....... ....... ....... ...... Si <![CDATA[D s,i1 ]]> <![CDATA[D s,i2 ]]> ....... 0 ....... <![CDATA[D s,in ]]> ...... ....... ....... ....... ....... ....... ....... Sn <![CDATA[D s,n1 ]]> <![CDATA[D s,n2 ]]> ....... <![CDATA[D s,ni ]]> ....... 0
[0087] Table 1 Distance matrix between storage locations
[0088]
[0089]
[0090] Table 2 Distance matrix between docks
[0091]
[0092] Table 3 Distance matrix between docks and storage locations
[0093] After obtaining the three distance data shown in Table 1, Table 2 and Table 3, the first distance, the second distance and the third distance can be further obtained in combination with the preset position correspondence relationship.
[0094] For example, taking the three picking information (L1, A, 10), (L1, B, 20) and (L2, C, 30) as examples, when calculating the first distance between the storage location where the goods A are stored and the storage location where the goods B are stored in the two picking information (L1, A, 10) and (L1, B, 20), the storage location corresponding to the goods A and the storage location corresponding to the goods B can be found according to the correspondence between the goods and the storage locations where the goods are stored in the warehouse in the preset position correspondence relationship, and then the first distance between the storage location corresponding to the goods A and the storage location corresponding to the goods B can be obtained by looking up the table in the distance matrix shown in Table 1; when calculating the second distance between the single line terminal corresponding to the line L1 and the single line terminal corresponding to the line L2 in the two picking information (L1, B, 20) and (L2, C, 30), the preset position can be used to obtain the first distance between the storage location corresponding to the goods A and the storage location corresponding to the goods B. The correspondence between different picking information and picking storage positions in the correspondence relationship finds the single line terminal corresponding to line L1 and the single line terminal corresponding to line L2, and then obtains the second distance between the single line terminal corresponding to line L1 and the single line terminal corresponding to line L2 by looking up the table in the distance matrix shown in Table 2; when calculating the third distance between the storage location corresponding to the goods A in the (L1, A, 10) picking information and the single line terminal corresponding to line L1, the storage location where the A goods are located and the single line terminal corresponding to line L1 can be found according to the preset position correspondence relationship, and then obtains the third distance between the storage location where the A goods are located and the single line terminal corresponding to line L1 by looking up the table in the distance matrix shown in Table 3. The above examples are only for illustrative purposes and the present disclosure is not limited to this.
[0095] In this embodiment, after obtaining the picking information, the first distance, the second distance and the third distance, a directed graph of picking tasks can be generated according to the picking information corresponding to multiple target orders, the first distance, the second distance, the third distance and preset stacking constraint rules by executing steps 404 to 408.
[0096] In step 404, the picking task node is generated according to the goods corresponding to each picking information.
[0097] Among them, the picking task node corresponds to the goods one by one.
[0098] In this step, since there is a one-to-one correspondence between the picking information and the goods, one picking information can be used as a picking task node, and different picking information generates different picking task nodes. For example, Figure 6 is a schematic diagram of a directed graph of a picking task according to an exemplary embodiment. Figure 6 As shown, taking (L1, A, 10), (L1, B, 20) and (L2, C, 30) as examples, the picking information (L1, A, 10) can be generated Figure 6 Node a in the picking information (L1, B, 20) can be generated Figure 6 In the b node, the picking information (L2, C, 30) can be generated Figure 6 The c node in is only an example and is not limited in the present disclosure.
[0099] In step 405, a first connection edge between two of the picking task nodes and a second connection edge between a preset node and any of the picking task nodes are determined.
[0100] The preset nodes represent the starting and ending nodes of each picking operation.
[0101] In step 406, the sum of the first distance and the second distance corresponding to the two picking task nodes connected by the first connecting edge is used as the weight of the first connecting edge, and the third distance corresponding to the picking task node connected by the second connecting edge is used as the weight corresponding to the second connecting edge.
[0102] The first connection edge includes an edge between two of the picking task nodes, and the second connection edge includes an edge between the preset node and any of the picking task nodes. Figure 6 As shown, the first connecting edge is the connecting edge between any two nodes among the a, b, c, d, and x nodes, and the second connecting edge is the connecting edge between any one node among the a, b, c, d, and x nodes and the 0 node.
[0103] For example, suppose Figure 6 The picking information corresponding to the a node is (L1, A, 10), and the picking information corresponding to the c node is (L2, C, 30). In the process of calculating the weight of the first connecting edge between the a node and the c node, the sum of the first distance and the second distance (the first distance and the second distance can be determined according to the method in step 403) between the picking information (L1, A, 10) and the picking information (L2, C, 30) can be used as the weight of the first connecting edge between the a node and the c node. In the process of calculating the weight of the second connecting edge between the a node and the 0 node, the third distance corresponding to (L1, A, 10) calculated by the method in step 403 can be used as the weight of the second connecting edge between the a node and the 0 node. The above examples are only illustrative and the present disclosure is not limited to this.
[0104] In step 407, the direction of the connection edge between the picking task nodes is determined according to the preset stacking constraint rule.
[0105] The preset stacking constraint rule is used to indicate whether any two goods corresponding to the picking information can be stacked. For example, when stacking goods during the picking process, the principle of heavy goods not pressing light goods and large goods not pressing small goods should be followed, so that the generated picking task is more in line with the actual picking scenario.
[0106] like Figure 6 As shown in , the direction of the connecting edge between the picking task nodes represents the stacking constraint between the goods in the picking information corresponding to the two nodes. For example, if Figure 6 The picking information corresponding to node a is (L1, A, 10), and the picking information corresponding to node c is (L2, C, 30). If goods A can be stacked on goods C, there is a connecting edge between node a and node c, and the direction of this connecting edge is from node a to node c. If goods C can also be stacked on goods A, there is another connecting edge between node c and node a, and the direction of this other connecting edge is from node c to node a.
[0107] It should be noted that, in a possible implementation, the preset stacking constraint rule can be used as follows: Figure 7 The stacking constraint is expressed as a directed graph, as shown in Figure 7 As shown, the nodes of the stacking constraint directed graph are the goods SKU (i.e., goods items). i and sku j , if sku i Can be stacked in sku j The maximum stacking number is l ij , then sku exists i To sku j The connecting edge, and the direction of the connecting edge is skui To sku j , the weight of the connecting edge is l ij .
[0108] In another possible implementation, the preset stacking constraint rule can also be represented by a stacking constraint matrix as shown in Table 4. As shown in Table 4, for sku i and sku j , if sku i Can be stacked in sku j The maximum stacking number is l ij , then the i-th row and j-th column of the matrix is l ij ; If not stackable, the i row and j column are 0.
[0109]
[0110]
[0111] Table 4 Stacking constraints based on matrix expression
[0112] In step 408, the picking task directed graph is generated according to the preset node, the plurality of picking task nodes, and the weight and direction corresponding to each of the connecting edges.
[0113] In a possible implementation of this step, an empty picking task graph can be created first, and preset nodes (such as Figure 6 0 node in the picking task graph) is added to the picking task graph, and then multiple picking task nodes are added to the picking task graph, and the weights and directions of the first connecting edge and the second connecting edge are set according to the weights and directions corresponding to each connecting edge, so as to generate the following Figure 6 The picking task is shown as a directed graph.
[0114] Since the directed graph of the picking task integrates multiple information data such as picking information, routing distances between cargo storage locations, routing distances between picking storage locations, distances between cargo storage locations and corresponding picking storage locations, and stacking constraints between cargoes, this provides a more effective data structure and highly integrated information for picking task optimization, while also making the subsequently generated picking tasks more in line with actual picking scenarios, thereby improving the picking efficiency of staff when picking based on the picking tasks.
[0115] Taking into account the need to generate the picking task as quickly as possible in actual business needs, in order to ensure the generation efficiency of the picking task, in a possible implementation method of the present invention, the picking task can be generated according to the minimum tree diagram of the picking task directed graph. In this way, there is no need to traverse the entire picking task directed graph to generate the picking task, thereby improving the generation speed of the picking task. In this embodiment, the picking task can be generated according to a branch-and-bound search algorithm that uses the minimum tree diagram of the picking task graph as inspiration information, for example, as shown in steps 409 to 415.
[0116] In step 409 , a first root node is determined among multiple nodes of the picking task directed graph.
[0117] Since the direction of the edge of the picking task directed graph expresses the stacking constraints between the goods in the picking information, in this step, the node with the smallest out-degree in the nodes of the picking task directed graph can be used as the first root node, where, for a directed graph, the number of out-edges of a node is the out-degree of the node.
[0118] In step 410, a minimum tree graph with the first root node as the root is generated according to a preset tree graph generation algorithm.
[0119] The preset tree diagram generation algorithm may include the Chu-Liu-Edmonds algorithm. Since the Chu-Liu-Edmonds algorithm is a common technique in the art, it will not be described in detail herein. Figure 8 As shown, it is a schematic diagram of the minimum tree diagram generated according to the preset tree diagram generation algorithm.
[0120] In step 411, a picking task is generated according to the minimum tree diagram.
[0121] In this step, each node in the minimum tree diagram is taken as the second root node, and multiple subtrees corresponding to the minimum tree diagram are determined, and the subtrees correspond to the second root node one by one; the weight sum of the connecting edges corresponding to each subtree and the sum of the parameters of the goods corresponding to the picking task nodes of each subtree are determined, and the sum of the parameters includes the weight sum and / or the volume sum; the preset parameters and thresholds corresponding to the picking device (such as a picking truck) are obtained; the target subtree is determined from the multiple subtrees, and the target subtree is the subtree whose sum of the parameters is less than or equal to the preset parameters and thresholds, and whose weight sum is the smallest; the picking task is generated according to the goods corresponding to all the picking task nodes of the target subtree.
[0122] The preset parameters and thresholds may include preset weights and thresholds, and / or preset volumes and thresholds, and the preset parameters and thresholds correspond to the parameters.
[0123] For example, Figure 8Taking the minimum tree diagram shown in FIG. 1 as an example, each node in the minimum tree diagram is used as the second root node, and the multiple subtrees corresponding to the minimum tree diagram determined include: a subtree with the x node as the second root node (such as Figure 8 As shown, subtree 1 includes Figure 8 All nodes in the tree), with node b as the second root node of the subtree (such as Figure 8 As shown, subtree 2 includes Figure 8 Other nodes except x node), with a node as the subtree of the second root node (such as Figure 8 As shown, subtree three includes Figure 8 The a node and c node in the subtree), where the weight corresponding to the subtree is d xb +d ba +d ac +d bd , the weight and item of the subtree are sku x 、sku b 、sku a 、sku c 、sku d The sum of the weight of the goods, the volume corresponding to the subtree 1 and the goods items are sku x 、sku b 、sku a 、sku c 、sku d The sum of the cargo volumes of subtree 2 is d ba +d ac +d bd The weight and item of the subtree 2 are sku b 、sku a 、sku c 、sku d The sum of the weight of the goods, the volume of subtree 2 and the corresponding items of goods are sku b 、sku a 、sku c 、sku d The sum of the cargo volumes of subtree 3 is d ac The weight and item of the subtree 3 are sku a 、sku c The sum of the weight of the goods, the volume of subtree three and the corresponding items are sku a 、sku cThe sum of the volumes of the goods, assuming that the sum of the parameters is the sum of the weights of the goods corresponding to all the nodes on a certain subtree, when determining the target subtree from the above three subtrees, the subtree with the sum of the weights of the goods less than or equal to the preset weight and threshold and the smallest weight sum can be taken as the target subtree. After that, the goods corresponding to all the picking task nodes of the target subtree can be picked in the same picking task, that is, the picking truck starts from node 0, and the goods corresponding to all the picking task nodes of the target subtree can be completed in the same picking task in the picking area. The above examples are only for illustration, and the present disclosure is not limited to this.
[0124] In step 412, the node corresponding to the target subtree is deleted from the picking task directed graph to obtain an updated picking task directed graph.
[0125] For example, if the target subtree is subtree 3 in step 411, in the process of executing this step, Figure 6 Nodes a and c are deleted from the picking task directed graph shown to obtain an updated picking task directed graph.
[0126] In step 413, it is determined whether the node set corresponding to the updated picking task directed graph is non-empty.
[0127] Among them, the node set is the set composed of all nodes in the directed graph of the picking task. If the node set is empty, it means that all the goods represented in the directed graph of the picking task have been divided into different picking tasks, that is, the picking task generation is completed. Otherwise, it means that all the goods represented in the directed graph of the picking task have not been divided into different picking tasks.
[0128] Therefore, in this step, if it is determined that the node set corresponding to the updated picking task directed graph is not empty, execute step 414; otherwise, execute step 415.
[0129] In step 414, a new minimum tree graph corresponding to the updated picking task directed graph is generated, and the picking task is regenerated according to the new minimum tree graph.
[0130] Among them, the picking task can be regenerated by referring to the above steps 409 to 411, which will not be described in detail.
[0131] In step 415, the picking task is generated.
[0132] By adopting the above method, multiple information data such as picking information, routing distances between cargo storage locations, routing distances between picking storage locations, distances between cargo storage locations and corresponding picking storage locations, and stacking constraints between cargoes can be integrated to generate picking tasks. While providing a more effective data structure and highly integrated information for picking task optimization, the generated picking tasks also conform to actual picking scenarios. In this way, when workers pick goods based on the picking tasks, on the one hand, they can effectively avoid aimlessly searching for goods in the warehouse during the picking process and reduce invalid time. On the other hand, they can effectively reduce the travel distance during the picking process, shorten the picking operation time, and improve the picking efficiency. In addition, the picking task can include a picking task graph. To ensure the generation efficiency of the picking task, the present disclosure can further generate a single picking task based on the minimum tree graph of the picking task graph, without traversing the entire picking task graph to generate the picking task, thereby improving the generation speed of the picking task.
[0133] Fig. 9 is a block diagram of a device for generating a picking task according to an exemplary embodiment. Fig. 9 As shown, the device comprises:
[0134] The goods information determination module 901 is used to determine the picking information corresponding to each of the goods in the target order for each of the target orders;
[0135] The first determination module 902 is used to determine, for any two of the plurality of picking information, a first distance between the storage locations where the goods respectively corresponding to the any two picking information are located, and a second distance between the picking storage locations respectively corresponding to the any two picking information, according to a preset position correspondence relationship; wherein the preset position correspondence relationship includes a correspondence relationship between the goods and the storage locations where the goods are stored in the warehouse, and a correspondence relationship between different arrangement line information and the picking storage location, and the picking storage location is a location where the goods corresponding to the same arrangement line information are stored after the picking is completed;
[0136] The second determining module 903 is used to determine, for each of the plurality of picking information, a storage location where the goods corresponding to the picking information are located according to the preset position correspondence relationship, and a third distance from the storage location of the goods corresponding to the picking information;
[0137] The task generating module 904 is used to generate a picking task according to the picking information corresponding to the target orders, the first distance, the second distance and the third distance.
[0138] Optionally, the task generation module 904 is used to generate the picking task node according to the goods corresponding to each picking information, and the picking task node corresponds to the goods one by one; determine the first connecting edge between two of the picking task nodes, and the second connecting edge between a preset node and any of the picking task nodes, and the preset node represents the starting node and the ending node of each picking; use the sum of the first distance and the second distance corresponding to the two picking task nodes connected by the first connecting edge as the weight of the first connecting edge, and use the third distance corresponding to the picking task node connected by the second connecting edge as the weight corresponding to the second connecting edge; generate the picking task graph according to the preset node, multiple picking task nodes, the weight of the first connecting edge and the weight of the second connecting edge; generate the picking task according to the picking task graph.
[0139] Optionally, the picking task graph includes a picking task directed graph, and the task generation module 904 is further used to determine the direction of the connecting edge between the picking task nodes according to a preset stacking constraint rule, and the preset stacking constraint rule is used to characterize whether any two goods corresponding to the picking information can be stacked, and generate the picking task directed graph according to the preset node, multiple picking task nodes, the weight of the first connecting edge, the weight of the second connecting edge and the direction.
[0140] Optionally, the task generation module 904 is used to determine a first root node among multiple nodes of the picking task directed graph, generate a minimum tree graph with the first root node as the root according to a preset tree graph generation algorithm, and generate the picking task according to the minimum tree graph.
[0141] Optionally, the task generating module 904 is configured to use the node with the smallest out-degree among the nodes of the picking task directed graph as the first root node.
[0142] Optionally, the task generation module 904 is used to take each node in the minimum tree diagram as the second root node, determine multiple subtrees corresponding to the minimum tree diagram, and the subtrees correspond to the second root node one by one; determine the weight sum of the directed edges corresponding to each subtree, and the sum of parameters of the goods corresponding to the picking task nodes of each subtree, and the sum of parameters includes the weight sum and / or volume sum; obtain the preset parameters and thresholds corresponding to the picking equipment; determine the target subtree from the multiple subtrees, the target subtree is the subtree whose sum of parameters is less than or equal to the preset parameters and thresholds, and whose weight sum is the smallest; generate the picking task according to the goods corresponding to all the picking task nodes of the target subtree.
[0143] Alternatively, if Fig.10 As shown, the device also includes:
[0144] An updating module 905 is used to delete the node corresponding to the target subtree in the picking task directed graph to obtain an updated picking task directed graph;
[0145] The tree diagram generation module 906 is used to generate a new minimum tree diagram corresponding to the updated picking task directed graph if the node set corresponding to the updated picking task directed graph is not empty, and regenerate the picking task according to the new minimum tree diagram; if the node set corresponding to the updated picking task directed graph is empty, it is determined that the picking task generation is completed.
[0146] Regarding the device in the above embodiment, the specific manner in which each module performs operations has been described in detail in the embodiment of the method, and will not be elaborated here.
[0147] By adopting the above-mentioned device, a plurality of information data such as picking information, routing distance between cargo storage locations, routing distance between picking storage locations, and distance between cargo storage locations and corresponding picking storage locations can be integrated to generate a picking task. While providing a more effective data structure and highly integrated information for picking task optimization, it also makes the generated picking task more in line with the actual picking scenario. In this way, when the staff picks based on the picking task, on the one hand, it can effectively avoid aimlessly searching for goods in the warehouse during the picking process and reduce invalid time. On the other hand, it can effectively reduce the travel distance during the picking process, shorten the picking operation time, and improve the picking efficiency.
[0148] Fig.11 FIG. 1 is a block diagram of an electronic device 1100 according to an exemplary embodiment. Fig.11 As shown, the electronic device 1100 may include: a processor 1101 and a memory 1102. The electronic device 1100 may also include one or more of a multimedia component 1103, an input / output (I / O) interface 1104, and a communication component 1105.
[0149] The processor 1101 is used to control the overall operation of the electronic device 1100 to complete all or part of the steps in the method for generating a picking task. The memory 1102 is used to store various types of data to support the operation of the electronic device 1100. For example, these data may include instructions for any application or method used to operate on the electronic device 1100, and application-related data, such as contact data, sent and received messages, pictures, audio, video, etc. The memory 1102 can 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 programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, disk or optical disk. The multimedia component 1203 may include a screen and an audio component. The screen may be, for example, a touch screen, and the audio component is used to output and / or input audio signals. For example, the audio component may include a microphone, which is used to receive external audio signals. The received audio signal may be further stored in the memory 1102 or sent through the communication component 1105. The audio component also includes at least one speaker for outputting audio signals. The I / O interface 1104 provides an interface between the processor 1101 and other interface modules, and the above-mentioned other interface modules may be keyboards, mice, buttons, etc. These buttons may be virtual buttons or physical buttons. The communication component 1105 is used for wired or wireless communication between the electronic device 1100 and other devices. Wireless communication, such as Wi-Fi, Bluetooth, Near Field Communication (NFC), 2G, 3G, 4G, NB-IOT, eMTC, or other 5G, etc., or a combination of one or more of them, is not limited here. Therefore, the corresponding communication component 1105 may include: Wi-Fi module, Bluetooth module, NFC module, etc.
[0150] In an exemplary embodiment, the electronic device 1100 can be implemented by one or more application specific integrated circuits (ASIC), digital signal processors (DSP), digital signal processing devices (DSPD), programmable logic devices (PLD), field programmable gate arrays (FPGA), controllers, microcontrollers, microprocessors or other electronic components to execute the above-mentioned method of generating picking tasks.
[0151] In another exemplary embodiment, a computer-readable storage medium including program instructions is also provided, and when the program instructions are executed by a processor, the steps of the above-mentioned method for generating a picking task are implemented. For example, the computer-readable storage medium may be the above-mentioned memory 1102 including program instructions, and the above-mentioned program instructions may be executed by the processor 1101 of the electronic device 1100 to complete the above-mentioned method for generating a picking task.
[0152] In another exemplary embodiment, a computer program product is further provided. The computer program product includes a computer program executable by a programmable device, and the computer program has a code portion for executing the above-mentioned method of generating a picking task when executed by the programmable device.
[0153] The preferred embodiments of the present disclosure are described in detail above in conjunction with the accompanying drawings; however, the present disclosure is not limited to the specific details in the above embodiments. Within the technical concept of the present disclosure, a variety of simple modifications can be made to the technical solution of the present disclosure, and these simple modifications all fall within the protection scope of the present disclosure.
[0154] It should also be noted that the various specific technical features described in the above specific embodiments can be combined in any suitable manner without contradiction. In order to avoid unnecessary repetition, the present disclosure will not further describe various possible combinations.
[0155] In addition, various embodiments of the present disclosure may be arbitrarily combined, and as long as they do not violate the concept of the present disclosure, they should also be regarded as the contents disclosed by the present disclosure.
Claims
1. A method for generating picking tasks, It is characterized in that The method comprises: For each of the target orders in the multiple target orders, determine the picking information corresponding to each of the goods in the target order; For any two of the plurality of picking information, a first distance between the storage locations where the goods respectively corresponding to the any two picking information are located and a second distance between the picking storage locations respectively corresponding to the any two picking information are determined according to a preset position correspondence relationship; wherein the preset position correspondence relationship includes a correspondence relationship between goods and the storage locations where the goods are stored in the warehouse, and a correspondence relationship between different arrangement line information and the picking storage location, and the picking storage location is a location where the goods corresponding to the same arrangement line information are stored after the picking is completed; For each of the plurality of picking information, determine, according to the preset position correspondence relationship, a storage location where the goods corresponding to the picking information are located, and a third distance from the storage location of the goods corresponding to the picking information; Generate a picking task according to the picking information corresponding to the plurality of target orders, the first distance, the second distance, and the third distance; Generating a picking task according to the picking information corresponding to the plurality of target orders, the first distance, the second distance, and the third distance comprises: Generate a picking task node according to the goods corresponding to each picking information, wherein the picking task node corresponds to the goods one by one; Determine a first connection edge between two of the picking task nodes, and a second connection edge between a preset node and any of the picking task nodes, wherein the preset node represents a start node and an end node of each picking; The sum of the first distance and the second distance corresponding to the two picking task nodes connected by the first connecting edge is used as the weight of the first connecting edge, and the third distance corresponding to the picking task node connected by the second connecting edge is used as the weight corresponding to the second connecting edge; Generate the picking task graph according to the preset node, the plurality of picking task nodes, the weight of the first connecting edge, and the weight of the second connecting edge; Generate the picking task according to the picking task graph; Generating the picking task according to the picking task graph comprises: Determine a first root node among a plurality of nodes of the picking task directed graph; Generate a minimum tree graph with the first root node as the root according to a preset tree graph generation algorithm; Generate the picking task according to the minimum tree diagram; Generating the picking task according to the minimum tree diagram includes: Taking each node in the minimum tree diagram as a second root node, determining a plurality of subtrees corresponding to the minimum tree diagram, wherein the subtrees correspond to the second root nodes one by one; Determine the sum of weights of directed edges corresponding to each subtree, and the sum of parameters of goods corresponding to the picking task nodes of each subtree, wherein the sum of parameters includes the sum of weights and / or the sum of volumes; Obtain preset parameters and thresholds corresponding to the picking equipment; Determine a target subtree from the plurality of subtrees, the target subtree being a subtree whose sum of the parameters is less than or equal to the preset parameter and the threshold and whose sum of weights is the smallest; The picking task is generated according to the goods corresponding to all the picking task nodes of the target subtree.
2. The method according to claim 1, It is characterized in that The picking task graph includes a picking task directed graph. Before generating the picking task graph according to the preset node, the plurality of picking task nodes, the weight of the first connecting edge, and the weight of the second connecting edge, the method further includes: Determine the direction of the connection edge between the picking task nodes according to a preset stacking constraint rule, wherein the preset stacking constraint rule is used to indicate whether any two goods corresponding to the picking information can be stacked; The step of generating the picking task graph according to the preset node, the plurality of picking task nodes, the weight of the first connecting edge, and the weight of the second connecting edge comprises: The picking task directed graph is generated according to the preset node, the plurality of picking task nodes, the weight of the first connecting edge, the weight of the second connecting edge, and the direction.
3. The method according to claim 1, It is characterized in that Determining the first root node among the multiple nodes of the picking task directed graph includes: The node with the smallest out-degree among the nodes of the picking task directed graph is used as the first root node.
4. The method according to claim 1, It is characterized in that After generating the picking task according to the goods corresponding to all the picking task nodes of the target subtree, the method further includes: Deleting the node corresponding to the target subtree in the picking task directed graph to obtain an updated picking task directed graph; If the node set corresponding to the updated picking task directed graph is not empty, generate a new minimum tree graph corresponding to the updated picking task directed graph, and regenerate the picking task according to the new minimum tree graph; If the node set corresponding to the updated picking task directed graph is empty, it is determined that the picking task generation is completed.
5. A computer-readable storage medium having a computer program stored thereon, It is characterized in that When the program is executed by a processor, the steps of the method described in any one of claims 1 to 4 are implemented.
6. An electronic device, It is characterized in that include: a memory having a computer program stored thereon; A processor, configured to execute the computer program in the memory to implement the steps of the method according to any one of claims 1 to 4.
