Goods dispatching method, device, server and storage medium
By repeatedly performing the starting and destination allocation method determination operations, optimizing the starting and destination allocation of goods based on the total transport distance, solving the inefficiency problem caused by random allocation in the prior art, and achieving more efficient goods scheduling.
Patent Information
- Application Number
- CN202010296796.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2020-04-15
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2040-04-15
AI Technical Summary
In the existing goods scheduling methods, after randomly determining the departure point, only the closest feed port is considered as the destination, and other possible optimization scheduling methods are not explored, resulting in low efficiency.
By repeatedly performing the starting and destination allocation method determination operation, based on the total transport distance between the current and candidate allocation methods, the latest starting and destination allocation method is determined until a better scheduling method is found to ensure the destination of each item. and the starting point allocation is optimal.
It improves the efficiency of goods scheduling, ensures that better scheduling methods are found and adopted in the allocation of departure and destinations, and improves warehouse operation efficiency.
Smart Images

Figure CN113537856B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to a field, and specifically to a cargo scheduling method, device, server, and storage medium. Background Art
[0002] The dispatching of goods is a basic part of warehouse management. In the dispatching of goods, it is necessary to determine the dispatching method that defines at which picking station each good is picked and to which feeding port each good is put, that is, to determine the dispatching method that defines the departure and destination of each good.
[0003] At present, the commonly used method is to randomly determine the departure point of each product. For each product, the closest feeding port to the randomly determined departure point of the product and the corresponding order requiring the product is used as the destination of the product.
[0004] However, the scheduling method obtained by the above method is obtained by determining the destination allocation method that defines the destination of each product under only one departure allocation method. Other possible destination allocation methods under other departure allocation methods are not considered, and accordingly, other possible scheduling methods cannot be obtained. There may be other scheduling methods that are better than the scheduling method obtained by determining the destination allocation method under only one departure allocation method, but they are not found, resulting in low efficiency. Summary of the invention
[0005] In order to overcome the problems existing in the related art, the present application provides a cargo scheduling method, device, server and storage medium.
[0006] According to a first aspect of an embodiment of the present application, a method for dispatching goods is provided, comprising:
[0007] Repeatedly perform the departure and destination allocation method determination operation to determine a final departure allocation method and a final destination allocation method;
[0008] For each of the goods to be dispatched, a transport robot is used to transport the goods from the departure place of the goods defined in the final departure place allocation method to the destination of the goods defined in the final destination allocation method, wherein the departure place and destination allocation method determination operation includes:
[0009] The destination allocation mode determination operation is repeatedly performed, and the destination allocation mode determination operation includes:
[0010] Based on the current destination allocation method, determine a candidate destination allocation method;
[0011] Determining a latest destination allocation method based on a first total transport distance corresponding to a current destination allocation method and a second total transport distance corresponding to a candidate destination allocation method, wherein the first total transport distance corresponding to the current destination allocation method and the second total transport distance corresponding to the candidate destination allocation method are determined based on a current departure location allocation method;
[0012] The following departure allocation method determination operation is performed: Based on the latest destination allocation method, the latest departure allocation method is determined.
[0013] According to a second aspect of an embodiment of the present application, a goods scheduling device is provided, including:
[0014] A determination unit is configured to repeatedly perform a departure and destination allocation method determination operation to determine a final departure allocation method and a final destination allocation method, wherein the departure and destination allocation method determination operation includes: repeatedly performing a destination allocation method determination operation, and the destination allocation method determination operation includes: determining a candidate destination allocation method based on a current destination allocation method; determining an updated destination allocation method based on a first total transportation distance corresponding to the current destination allocation method and a second total transportation distance corresponding to the candidate destination allocation method, wherein the first total transportation distance corresponding to the current destination allocation method and the second total transportation distance corresponding to the candidate destination allocation method are determined based on the current departure allocation method; performing the following departure allocation method determination operation: determining an updated departure allocation method based on the updated destination allocation method.
[0015] The transport unit is configured to use a transport robot to transport each of the goods to be dispatched from the departure point of the goods defined in the final departure point allocation method to the destination of the goods defined in the final destination allocation method.
[0016] The goods dispatching method and device provided by the embodiment of the present application realizes that each time the departure and destination allocation method determination operation is performed, it is determined whether there are other dispatching methods that are better than the latest determined dispatching method, that is, it is determined whether there are other destination allocation methods that are better than the latest determined destination allocation method that defines the destination of each goods and whether there are other departure allocation methods that are better than the latest determined departure allocation method that defines the departure of each goods. The departure and destination allocation method determination operation is repeatedly performed until a better dispatching method is found, and each goods is dispatched with the better dispatching method, thereby improving dispatching efficiency. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.
[0018] Figure 1 A schematic diagram showing the effect of applying the goods scheduling method provided in an embodiment of the present application to a warehouse;
[0019] Figure 2 A flow chart of a method for dispatching goods provided in an embodiment of the present application is shown;
[0020] Figure 3 The structural block diagram of the goods scheduling device provided in the embodiment of the present application is shown;
[0021] Figure 4 A structural block diagram of a server provided in an embodiment of the present application is shown. DETAILED DESCRIPTION
[0022] The present application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the relevant invention, rather than to limit the invention. It should also be noted that, for ease of description, only the parts related to the relevant invention are shown in the accompanying drawings.
[0023] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.
[0024] Figure 1 A schematic diagram showing the effect of applying the goods scheduling method provided in an embodiment of the present application to a warehouse.
[0025] exist Figure 1 In the figure, three departure places, i.e., picking sites 101, are shown at the bottom, and multiple destinations, i.e., feeding ports 102, are located on both sides of the cargo aisle above. Each departure place may include two stations for picking goods. Each destination corresponds to an order, and the destination of each good is the feeding port where the good is required by the corresponding order. All goods to be dispatched can be successively transferred from the warehouse site to the departure place, i.e., the picking site, of the goods through a conveyor belt. The staff at the departure place of the goods places the goods on a handling robot, such as a flip-plate AGV, and the handling robot, such as a flip-plate AGV, transports the goods from the departure place of the goods to the destination of the goods, and the handling robot finally performs the goods feeding operation at the destination of the goods.
[0026] Figure 2 A flow chart of a method for dispatching goods provided in an embodiment of the present application is shown, and the method includes:
[0027] Step 201, repeatedly performing the departure and destination allocation method determination operation to determine the final departure allocation method and the final destination allocation method.
[0028] In the present application, for each product, the departure point of the product is a picking site, and for each product, the destination of the product is a feeding port where the corresponding order requires the product.
[0029] In step 201, for all goods to be dispatched, the departure and destination allocation method determination operation is repeatedly performed to determine the final departure allocation method and the final destination allocation method, thereby determining the final dispatch method for all goods to be dispatched.
[0030] After the last departure and destination allocation method determination operation is completed, the latest departure allocation method is used as the final departure allocation method. After the last departure and destination allocation method determination operation is completed, the latest destination allocation method is used as the final destination allocation method.
[0031] All the goods to be dispatched in step 201 may refer to a batch of goods required for a batch of orders generated within a certain period of time.
[0032] In the present application, each time all the goods to be dispatched are moved from the departure point to the destination, steps 201-202 can be executed to determine the departure point and destination of each of all the goods to be dispatched, and each of all the goods to be dispatched is transported from the determined departure point to the determined destination.
[0033] In the present application, the final departure point allocation method defines the final departure point of each of all goods to be dispatched, and the final destination allocation method defines the final destination of each of all goods to be dispatched.
[0034] In the present application, before the departure and destination allocation mode determination operation is performed for the first time, the departure and destination initialization operation may be performed first.
[0035] The departure and destination initialization operations may be: randomly assigning a departure point for each item and a destination for each item.
[0036] For each product, as long as an order corresponding to a destination requires the product, the destination can be used as the destination assigned to the product when the destinations of the products are assigned in a random manner.
[0037] In this application, the operation of determining the mode of allocating the origin and destination includes:
[0038] The destination allocation mode determination operation is repeatedly performed, and the destination allocation mode determination operation includes:
[0039] Determine a candidate destination allocation method based on the current destination allocation method, wherein the candidate destination allocation method is determined by selecting a candidate destination of the target goods to be dispatched from the destinations of all target goods defined in the current destination allocation method;
[0040] Determine the latest destination allocation method based on the first total transport distance corresponding to the current destination allocation method and the second total transport distance corresponding to the candidate destination allocation method
[0041] The following departure allocation method determination operation is performed: Based on the latest destination allocation method, the latest departure allocation method is determined.
[0042] In the present application, when a preset condition indicating that the repeated execution of the operation of determining the allocation mode of the departure place and the destination is stopped is met, the operation of determining the allocation mode of the departure place and the destination is no longer executed. For example, when the preset condition indicating that the repeated execution of the operation of determining the allocation mode of the departure place and the destination is stopped is that the number of times the operation of determining the allocation mode of the departure place and the destination has been executed reaches a number threshold, the operation of determining the allocation mode of the departure place and the destination is no longer executed after the most recently executed operation of determining the allocation mode of the departure place and the destination is completed.
[0043] In the present application, the departure and destination initialization operations may be referred to as step S1. The destination allocation method determination operation may be referred to as step S2. The departure allocation method determination operation may be referred to as step S3.
[0044] Step S1 only needs to be performed once. After step S1 is performed, the latest departure place allocation mode and the latest destination allocation mode are obtained for the first time. After step S1 is performed, the departure place and destination allocation mode determination operation is repeatedly performed.
[0045] In the present application, for each execution of the departure and destination allocation method determination operation, step S2 may be repeatedly executed in the departure and destination allocation method determination operation executed this time, and step S2 may no longer be executed when a preset condition indicating the process of stopping the repeated execution of step S2 is met. For example, the preset condition indicating the process of stopping the repeated execution of step S2 is that the number of times step S2 executed in the current execution of the departure and destination allocation method determination operation has reached a number threshold.
[0046] For each execution of the operation of determining the method of allocating the place of departure and the destination, after the last execution of step S2 in the execution of the operation of determining the method of allocating the place of departure and the destination is completed, step S3 is executed once, and after the execution of step S3 once in the execution of the operation of determining the method of allocating the place of departure and the destination is completed, the execution of the operation of determining the method of allocating the place of departure and the destination is completed.
[0047] In the present application, each time step S2 is executed, the latest destination allocation method can be determined. Each time step S3 is executed, the latest departure allocation method can be determined.
[0048] In the present application, the latest destination allocation method refers to the latest determined destination allocation method. The current destination allocation method and the latest destination allocation method should be understood in conjunction with the steps in which they are located.
[0049] The latest departure allocation method refers to the most recently determined departure allocation method. The current departure allocation method and the latest departure allocation method should be understood in conjunction with the step in which they are located.
[0050] For each execution of step S2 in the operation of determining the departure place and destination allocation method in a single execution, if step S2 is continued to be executed after step S2 executed this time, the latest destination allocation method determined by step S2 executed this time becomes the current destination allocation method based on which step S2 is executed the next time.
[0051] For each execution of step S2 in a single execution of the operation for determining the method for allocating the place of departure and the destination, if step S2 executed this time is the last step S2 executed in this execution of the operation for determining the method for allocating the place of departure and the destination, then the latest destination allocation method determined by step S2 executed this time becomes the latest destination allocation method on which step S3 executed after step S2 executed this time is based.
[0052] In step S2 executed for the first time in the operation of determining the allocation method of the departure place and the destination executed for the first time, the current destination allocation method is the latest destination allocation method determined in step S1.
[0053] In each step S2 executed in the first execution of the departure and destination allocation method determination operation, the current departure allocation method based on which the first total transportation distance corresponding to the current destination allocation method and the second total transportation distance corresponding to the candidate destination allocation method are calculated is: the latest departure allocation method determined by step S1.
[0054] For each departure and destination allocation method determination operation that is not performed for the first time, in each execution of step S2 in the departure and destination allocation method determination operation that is not performed for the first time, the current departure allocation method based on which the first total transportation distance corresponding to the current destination allocation method and the second total transportation distance corresponding to the candidate destination allocation method are calculated is: the latest departure allocation method determined by step S3 in the departure and destination allocation method determination operation that was performed last time before the departure and destination allocation method determination operation that is not performed for the first time.
[0055] For each departure and destination allocation method determination operation that is not performed for the first time, the current destination allocation method based on which step S2 is executed for the first time in this departure and destination allocation method determination operation that is not performed for the first time is: the latest destination allocation method determined by the last executed step S2 in the departure and destination allocation method determination operation that was performed last time before this departure and destination allocation method determination operation that is not performed for the first time.
[0056] For each execution of step S3, the latest destination allocation method based on which step S3 is executed is: the latest destination allocation method determined by the last execution of S2 in the operation of determining the departure place and destination allocation method belonging to step S3 executed this time.
[0057] The following example illustrates the process of determining multiple departure and destination allocation methods:
[0058] The first execution of the departure and destination allocation method determination operation includes: step S2 executed multiple times in the first execution of the departure and destination allocation method determination operation, and step S3 executed in the first execution of the departure and destination allocation method determination operation.
[0059] The current destination allocation system based on which step S2 is executed for the first time in the first execution of the departure and destination allocation system determination operation is executed is the latest destination allocation system determined in step S1.
[0060] The current departure point allocation method based on which the corresponding first total distance and second total distance are calculated in each execution of step S2 in the first execution of the departure point and destination allocation method determination operation is the latest departure point allocation method determined in step S1.
[0061] In step S3 executed in the first execution of the departure and destination allocation method determination operation, the latest destination allocation method based on the latest departure allocation method is determined as: the latest destination allocation method determined by the last execution of step S2 in the first execution of the departure and destination allocation method determination operation.
[0062] The second execution of the departure and destination allocation method determination operation includes: step S2 executed multiple times in the second execution of the departure and destination allocation method determination operation, and step S3 executed in the second execution of the departure and destination allocation method determination operation.
[0063] The current destination allocation method based on which step S2 executed for the first time in the second execution of the departure and destination allocation method determination operation is executed is: the latest destination allocation method determined by the last step S2 in the first execution of the departure and destination allocation method determination operation.
[0064] In each step S2 executed in the second execution of the departure and destination allocation method determination operation, the current departure allocation method based on which the corresponding first total distance and second total distance are calculated is: the latest departure allocation method determined by step S3 executed in the first execution of the departure and destination allocation method determination operation.
[0065] The latest destination allocation method based on which step S3 executed in the second execution of the departure and destination allocation method determination operation is executed is: the latest destination allocation method determined by the last execution of step S2 in the second execution of the departure and destination allocation method determination operation.
[0066] The third execution of the departure and destination allocation method determination operation includes: step S2 executed multiple times in the third execution of the departure and destination allocation method determination operation, and step S3 executed in the third execution of the departure and destination allocation method determination operation.
[0067] The current destination allocation method based on which step S2 is executed for the first time in the third execution of the departure and destination allocation method determination operation is: the latest destination allocation method determined by step S2 executed for the last time in the second execution of the departure and destination allocation method determination operation.
[0068] In each step S2 executed in the third execution of the departure and destination allocation method determination operation, the current departure allocation method based on which the corresponding first total distance and second total distance are calculated is: the latest departure allocation method determined by step S3 executed in the second execution of the departure and destination allocation method determination operation.
[0069] The latest destination allocation method based on which step S3 executed in the third execution of the departure and destination allocation method determination operation is executed is the latest destination allocation method determined by step S2 executed for the last time in the third execution of the departure and destination allocation method determination operation.
[0070] The execution process of the departure and destination allocation method determination operation for other executions is similar.
[0071] In some embodiments, repeatedly performing the departure and destination allocation method determination operation to determine the final departure allocation method and the final destination allocation method includes: repeatedly performing the departure and destination allocation method determination operation until a first stop condition is met, and the first stop condition is one of the following: the latest destination allocation method and the latest departure allocation method have not changed during the multiple consecutive executions of the departure and destination allocation method determination operation, and the number of times the departure and destination allocation method determination operation has been executed reaches the first number threshold.
[0072] If the latest destination allocation method and the latest departure allocation method have not changed during multiple consecutive executions of the departure and destination allocation method determination operations, it can be determined that the first stop condition is met and the departure and destination allocation method determination operations will no longer be executed.
[0073] For example, starting from a certain execution of the departure and destination allocation method determination operation, the latest destination allocation method and the latest departure allocation method have not changed during the five consecutive executions of the departure and destination allocation method determination operation. In other words, starting from a certain execution of the departure and destination allocation method determination operation, after the execution of each of the five consecutive executions of the departure and destination allocation method determination operation is completed, the latest destination allocation method determined is the same as the latest destination allocation method determined after the last execution of the departure and destination allocation method determination operation is completed, and the latest departure allocation method determined is the same as the latest departure allocation method determined after the last execution of the departure and destination allocation method determination operation is completed. Then, it can be determined that the first stop condition is met, and the departure and destination allocation method determination operation is no longer executed.
[0074] If the number of times the departure and destination allocation method determination operation has been executed reaches a first number threshold, it can be determined that the first stop condition is met and the departure and destination allocation method determination operation is no longer executed.
[0075] In the present application, each time step S2, i.e., the destination allocation method determination operation, is executed, all target goods can be determined first, and all target goods need to meet the following exchange conditions: for each target product, the order corresponding to the candidate destination of the target product requires that the destination of the target product and each target product defined in the current destination allocation method be different.
[0076] Each time step S2, ie, the destination allocation method determination operation, is performed, as long as a plurality of goods meet the exchange conditions, the plurality of goods can be used as all target goods.
[0077] In the present application, each time step S2, i.e., the destination allocation method determination operation, is executed, for each target product among all products to be dispatched, a candidate destination of the target product is selected from the destinations of all target products defined in the current destination allocation method.
[0078] For each target item among all items to be dispatched, a candidate destination of the target item is selected that is different from the destination of the target item defined in the current destination allocation mode.
[0079] Each time step S2 is executed, the destination of the target product defined in the current destination allocation method is replaced by the candidate destination of the target product to obtain a candidate destination allocation method.
[0080] Each time step S2 is executed, the destination of each target product defined in the candidate destination allocation method is a candidate destination, and the destination of each non-target product defined in the candidate destination allocation method remains unchanged and is still the destination of the non-target product defined in the current destination allocation method.
[0081] In some embodiments, based on the current destination allocation method, determining the candidate destination allocation method includes: determining at least two target goods, wherein each target goods are of the same type and the destination of each target goods defined in the current destination allocation method is different; for each target goods, selecting a candidate destination of the target goods from the destinations of all target goods defined in the current destination allocation method, wherein the candidate destination of the target goods is different from the destination of the target goods defined in the current destination allocation method.
[0082] In the case where all the target goods determined are of the same type and the destinations of the target goods defined in the current destination allocation method are different, each time step S2, i.e., the destination allocation method determination operation, is executed, one of the two target goods is called the first target goods, and the other target goods is called the second target goods.
[0083] Each time step S2, i.e., the destination allocation method determination operation, is executed, the destination of the first target commodity defined in the current destination allocation method is used as the candidate destination of the second target commodity, and the destination of the second target commodity defined in the current destination allocation method is used as the candidate destination of the first target commodity. This is equivalent to exchanging the destinations of the two target commodities defined in the current destination allocation method each time step S2 is executed, and using the exchanged destinations as the candidate destinations of the target commodities.
[0084] Thus, in the case where all the target goods determined are of the same type and the destinations of the target goods defined in the current destination allocation method are different, each time step S2 is executed, the destination of each of the two target goods defined in the candidate destination allocation method is the corresponding candidate destination, and the destination of each non-target commodity defined in the candidate destination allocation method remains unchanged and is still the destination of the non-target commodity defined in the current destination allocation method.
[0085] In the case where all the determined target commodities are three or more target commodities of the same type and the destinations of the target commodities defined in the current destination allocation method are different, the candidate destination of each target commodity can be randomly selected, as long as it is ensured that the candidate destination of each target commodity is unique and different from the destination of the target commodity defined in the current destination allocation method. This is equivalent to randomly exchanging the destinations of the target commodities defined in the current destination allocation method among the target commodities among the three or more target commodities to determine the candidate destination of each target commodity.
[0086] In the case where all the determined target goods are three or more target goods of the same type and have different destinations defined in the current destination allocation method, each time step S2, i.e., the destination allocation method determination operation, is executed, the destination of each target commodity defined in the candidate destination allocation method is the corresponding candidate destination, and the destination of each non-target commodity defined in the candidate destination allocation method remains unchanged and is still the destination of the non-target commodity defined in the current destination allocation method.
[0087] In the present application, each time step S2, ie, the destination allocation method determination operation, is performed, the latest destination allocation method is determined based on the first total transport distance corresponding to the current destination allocation method and the second total transport distance corresponding to the candidate destination allocation method.
[0088] In the present application, each time step S2, i.e., the destination allocation method determination operation, is executed, the first total transportation distance corresponding to the current destination allocation method is determined based on the destination of each product defined in the current destination allocation method and the departure point of each product defined in the current departure allocation method.
[0089] Each time step S2, i.e., the destination allocation method determination operation, is performed, when calculating the first total transport distance corresponding to the current destination allocation method, for each product, the distance between the destination of the product defined in the current destination allocation method and the departure point of the product defined in the current departure point allocation method is calculated to obtain the distance corresponding to the product. The sum of the distances corresponding to all products is taken as the first total transport distance corresponding to the current destination allocation method.
[0090] In the present application, each time step S2, i.e., the destination allocation method determination operation, is executed, for the candidate destination allocation method, the second total transportation distance corresponding to the candidate destination allocation method is determined based on the destination of each product defined in the candidate destination allocation method and the departure point of each product defined in the current departure allocation method.
[0091] Each time step S2, i.e., the destination allocation method determination operation, is performed, when calculating the second total transport distance corresponding to the candidate destination allocation method, for each target product, the distance between the candidate destination of the target product defined in the candidate destination allocation method and the departure point of the target product defined in the current departure point allocation method is calculated to obtain the distance corresponding to the target product. The sum of the distances corresponding to all target products is taken as the total distance corresponding to the target product.
[0092] For each non-target product, the distance between the destination of the non-target product defined in the candidate destination allocation method and the departure point of the non-target product defined in the current departure point allocation method is calculated to obtain the distance corresponding to the non-target product. The sum of the distances corresponding to all non-target products is taken as the total distance corresponding to the non-target product.
[0093] The sum of the total distance corresponding to the target goods and the total distance corresponding to the non-target goods is used as the second total transportation distance corresponding to the candidate destination allocation method.
[0094] Each time step S2, ie, the destination allocation method determination operation, is performed, it may be determined whether the first total transport distance corresponding to the current destination allocation method is greater than the second total transport distance corresponding to the candidate destination allocation method.
[0095] Each time step S2, i.e., the destination allocation method determination operation, is executed, if it is determined that the first total transport distance corresponding to the current destination allocation method when executing step S2 is greater than the second total transport distance corresponding to the candidate destination allocation method, the candidate destination allocation method can be determined as the latest destination allocation method.
[0096] Each time step S2, i.e., the destination allocation method determination operation, is executed, if it is determined that the first total transport distance corresponding to the current destination allocation method when step S2 is executed this time is less than the second total transport distance corresponding to the candidate destination allocation method, then the current destination allocation method when step S2 is executed this time can be determined as the latest destination allocation method.
[0097] In some embodiments, determining the latest destination allocation method based on a first total transportation distance corresponding to the current destination allocation method and a second total transportation distance corresponding to the candidate destination allocation method includes: determining whether one of multiple update conditions is satisfied based on the first total transportation distance corresponding to the current destination allocation method and the second total transportation distance corresponding to the candidate destination allocation method, wherein the multiple update conditions include: the first total transportation distance corresponding to the current destination allocation method is greater than the second total transportation distance corresponding to the candidate destination allocation method, the first total transportation distance corresponding to the current destination allocation method is less than the second total transportation distance corresponding to the candidate destination allocation method, and the destination allocation method update probability is greater than a probability threshold; if so, determining the candidate destination allocation method as the latest destination allocation method; if not, determining the current destination allocation method as the latest destination allocation method.
[0098] The probability of updating the destination allocation method can be calculated by using a hill climbing algorithm. The probability of updating the destination allocation method can be expressed as exp(-(yx)*β / step), where β is a preset parameter in the hill climbing algorithm, x represents the first total transport distance corresponding to the current destination allocation method, y represents the second total transport distance corresponding to the candidate destination allocation method, and step represents the number of times step S2, i.e., the destination allocation method determination operation, has been executed in the currently executed departure and destination allocation method determination operation.
[0099] Each time step S2, i.e., the destination allocation method determination operation, is performed, if the first total transport distance corresponding to the current destination allocation method is greater than the second total transport distance corresponding to the candidate destination allocation method, it can be determined that one of the multiple update conditions is satisfied, and the candidate destination allocation method can be determined as the latest destination allocation method. That is, if x is greater than y, the candidate destination allocation method is determined as the latest destination allocation method.
[0100] Each time step S2, i.e., the destination allocation method determination operation, is performed, if the first total transport distance corresponding to the current destination allocation method is less than the second total transport distance corresponding to the candidate destination allocation method and the destination allocation method update probability is greater than the probability threshold, it can be determined that one of the multiple update conditions is satisfied, and the candidate destination allocation method can be determined as the latest destination allocation method. That is, if x is less than y, then when the destination allocation method update probability is greater than the probability threshold, the candidate destination allocation method is determined as the latest destination allocation method.
[0101] Each time step S2, ie, the destination allocation mode determination operation, is executed, if any update condition is not satisfied, the current destination allocation mode at the time of executing step S2 may be determined as the latest destination allocation mode.
[0102] In some embodiments, repeatedly performing a destination allocation method determination operation includes: repeatedly performing a destination allocation method determination operation until a second stop condition is met, and the second stop condition is one of the following: the latest destination allocation method has not changed during multiple consecutive executions of the destination allocation method determination operation in the current execution of the departure and destination allocation method determination operation, and the number of times the destination allocation method determination operation executed in the current execution of the departure and destination allocation method determination operation has been executed reaches a second number threshold.
[0103] For each execution of the departure and destination allocation method determination operation, when the departure and destination allocation method determination operation executed this time is executed, the departure and destination allocation method determination operation executed this time is called the departure and destination allocation method determination operation executed this time.
[0104] For each execution of the departure and destination allocation method determination operation, the plurality of destination allocation method determination operations that are continuously executed in the departure and destination allocation method determination operation that is executed that time are executed during the execution of the departure and destination allocation method determination operation that is executed that time.
[0105] For each execution of the departure and destination allocation method determination operation, if the latest destination allocation method has not changed during the process of step S2, i.e., the destination allocation method determination operation, which is executed multiple times in succession in the departure and destination allocation method determination operation executed this time, it can be determined that the second stop condition is met, and step S2, i.e., the destination allocation method determination operation, will no longer be executed.
[0106] For example, for a certain execution of the operation of determining the allocation method of the place of departure and the destination, starting from step S2 executed at a certain time in the execution of the operation of determining the allocation method of the place of departure and the destination, the latest destination allocation method has not changed in the process of the five consecutive executions of step S2. In other words, starting from step S2 executed at a certain time, in the process of the execution of step S2 in each of the five consecutive executions of step S2, the candidate destination allocation method has not been used as the latest destination allocation method. It can be determined that the second stop condition is satisfied, and step S2 is no longer executed. Step S3 executed in the execution of the operation of determining the allocation method of the place of departure and the destination is started.
[0107] For each execution of the departure and destination allocation method determination operation, if the number of times that step S2 executed in the departure and destination allocation method determination operation executed this time, i.e., the destination allocation method determination operation, has been executed reaches the second number threshold, it can be determined that the second stop condition is met, and step S2 is no longer executed. Step S3 executed in the departure and destination allocation method determination operation executed this time begins to be executed.
[0108] The number of times step S2 has been executed in the departure place and destination allocation method determination operation being executed this time refers to the number of times step S2 has been executed during the execution of the departure place and destination allocation method determination operation being executed this time.
[0109] In the present application, each time step S3 is executed, the latest departure allocation method is determined based on the latest destination allocation method. The latest departure allocation method can be determined based on the distance between the destination of each product and each departure point defined in the latest destination allocation method.
[0110] In the present application, for each product, the departure point among all departure points that is closest to the destination of the product defined in the latest destination allocation method can be determined, and the closest departure point can be determined as the departure point of the product defined in the latest departure point allocation method.
[0111] In some embodiments, determining the latest departure allocation method based on the latest destination allocation method includes: determining the latest departure allocation method based on the distance between the destination of each cargo and each departure point and the busyness of each departure point defined in the latest destination allocation method.
[0112] In the present application, each time step S3, i.e., the departure point allocation method determination operation, is executed, the latest departure point allocation method can be determined based on the distance between the destination of each product and each departure point and the busyness of each departure point defined in the latest destination allocation method.
[0113] For each departure point, the busyness of the departure point is the number of goods of the departure point defined in the latest departure point allocation method to be determined.
[0114] For each departure point, the maximum number of goods for the departure point defined in the latest departure point allocation method to be determined is equal to the busyness of the departure point.
[0115] In this application, for each product, the distance between the destination of the product and each departure point defined in the latest destination allocation method can be calculated. Each product can correspond to multiple distances.
[0116] For example, there are 3 departure points in total. For each product, calculate the distance between the destination of the product and each departure point defined in the latest destination allocation method. Each product corresponds to 3 distances. All calculated distances include: 3 distances corresponding to each product.
[0117] For each of all the calculated distances, the distance is associated with the origin and destination based on which the distance is calculated.
[0118] For each product, the shortest distance among multiple distances corresponding to the product is the minimum distance corresponding to the product.
[0119] For each departure place, determine each minimum distance product associated with the departure place, and the minimum distance product associated with the departure place is: the corresponding minimum distance product associated with the departure place.
[0120] For each departure place, the minimum distances corresponding to each minimum distance product associated with the departure place are sorted in order of distance from small to large. After sorting, the smaller the minimum distance corresponding to the minimum distance product associated with the departure place, the closer the position of the minimum distance product associated with the departure place is, and the larger the minimum distance corresponding to the minimum distance product associated with the departure place, the closer the position of the minimum distance corresponding to the minimum distance product associated with the departure place is.
[0121] For example, there are 3 departure points in total. For each product, calculate the distance between the destination of the product and each departure point defined in the latest destination allocation method. Each product corresponds to 3 distances. All calculated distances include: 3 distances corresponding to each product.
[0122] For the first departure, determine each minimum distance product associated with the first departure. The minimum distance product associated with the first departure is: The corresponding minimum distance is the product associated with the first departure. In other words, the minimum distance product associated with the first departure is: The corresponding minimum distance is calculated based on the destination of the product defined in the latest destination allocation method and the first departure.
[0123] In order of distance from small to large, the minimum distance corresponding to each minimum distance product associated with the first departure point is sorted.
[0124] If the number of minimum distance goods associated with the first departure point is less than or equal to the busyness of the first departure point, for each minimum distance goods associated with the first departure point, the first departure point will be used as the departure point of the minimum distance goods associated with the first departure point defined in the latest departure point allocation method.
[0125] If the number of minimum distance goods associated with the first departure point is greater than the busyness of the first departure point, for each of the first N1 minimum distance goods, the first departure point is used as the departure point of the minimum distance goods associated with the first departure point defined in the latest departure point allocation method. N1 is the busyness of the first departure point.
[0126] For the second departure point, each minimum distance product associated with the second departure point is determined. The minimum distance product associated with the second departure point is: the product with the corresponding minimum distance associated with the second departure point. In other words, the minimum distance product associated with the second departure point is: the product with the corresponding minimum distance calculated based on the destination of the product defined in the latest destination allocation method and the second departure point.
[0127] Sort the minimum distances corresponding to each minimum distance product associated with the second departure place in order from small to large.
[0128] If the number of minimum distance goods associated with the second departure point is less than or equal to the busyness of the second departure point, for each minimum distance goods associated with the second departure point, the second departure point will be used as the departure point of the minimum distance goods associated with the second departure point defined in the latest departure point allocation method.
[0129] If the number of minimum distance goods associated with the second departure point is greater than the busyness of the second departure point, for each of the first N2 minimum distance goods, the second departure point is used as the departure point of the minimum distance goods associated with the second departure point defined in the latest departure point allocation method. N2 is the busyness of the second departure point.
[0130] For the third departure place, determine each minimum distance product associated with the third departure place. The minimum distance product associated with the third departure place is: the corresponding minimum distance product associated with the third departure place.
[0131] Sort the minimum distances corresponding to each minimum distance product associated with the third departure point in order from small to large.
[0132] If the number of minimum distance goods associated with the third departure point is less than or equal to the busyness of the third departure point, for each minimum distance goods associated with the third departure point, the third departure point will be used as the departure point of the minimum distance goods associated with the third departure point defined in the latest departure point allocation method.
[0133] If the number of goods associated with the third departure point is greater than the busyness of the third departure point, for each of the first N3 minimum distance goods, the third departure point is used as the departure point of the minimum distance goods associated with the third departure point defined in the latest departure point allocation method. N3 is the busyness of the third departure point.
[0134] For all the goods except for the goods whose departure places have been determined in the latest departure allocation method, while fixing the destinations of the remaining goods defined in the latest destination allocation method, the shortest path algorithm is used to calculate the departure place of each remaining goods that can make the total distance shortest. For each remaining goods, the departure place calculated by the shortest path algorithm will be used as the latest departure place of the remaining goods in the latest departure allocation method.
[0135] After determining the departure point of each item, obtain the latest departure point allocation method.
[0136] In some embodiments, based on the distance between the destination of each cargo and each departure point and the busyness of each departure point defined in the latest destination allocation method, determining the latest departure allocation method includes: for each cargo among all cargoes to be scheduled, calculating the distance between the destination of the cargo and each departure point defined in the latest destination allocation method, and obtaining multiple distances corresponding to the cargo; sorting all calculated distances in order from small to large; visiting one distance each time in order from small to large, and performing a departure determination operation on the visited distance, the departure determination operation including: determining whether the busyness of the departure point related to the visited distance is less than the busyness threshold, if so, determining the departure point related to the visited distance as the departure point of the cargo corresponding to the visited distance defined in the latest departure allocation method, deleting other distances in the multiple distances corresponding to the cargo, and continuing to visit the first undeleted distance after the visited distance, if not, continuing to visit the next distance after the visited distance.
[0137] The calculated distances include: calculating a plurality of distances corresponding to each of all the goods to be dispatched.
[0138] For each of all the calculated distances, the distance is associated with the origin and destination based on which the distance is calculated.
[0139] After calculating all the distances, you can visit one distance at a time in order from small to large.
[0140] Each time a distance is visited, it is determined whether the busyness of the departure point related to the visited distance is less than the busyness threshold. If so, the departure point related to the visited distance is determined as the departure point of the goods corresponding to the visited distance defined in the latest departure point allocation method, and the other distances among the multiple distances corresponding to the goods are deleted, and the first undeleted distance after the visited distance is continued to be visited. If not, the next distance after the visited distance is continued to be visited.
[0141] The following example illustrates the process of determining the latest departure point allocation method:
[0142] There are 3 departure points in total. For each product, calculate the distance between the destination of the product and each departure point defined in the latest destination allocation method. Each product corresponds to 3 distances. All calculated distances include: 3 distances corresponding to each product.
[0143] For each of all the calculated distances, the distance is associated with the origin and destination based on which the distance is calculated.
[0144] Sort all calculated distances from smallest to largest.
[0145] Visit all distances in order from smallest to largest.
[0146] The first visit is to the first distance, which is the smallest distance among all distances, to determine whether the busyness of the departure place associated with the first distance, i.e., the departure place based on which the first distance is calculated, is less than the busyness threshold. When visiting the first distance, the busyness of each departure place is 0. Therefore, the busyness of the departure place associated with the first distance must be less than the busyness threshold.
[0147] The departure point associated with the first distance visited is determined as the departure point of the goods corresponding to the first distance visited defined in the latest departure point allocation method, and the other distances among the multiple distances corresponding to the goods are deleted as well as the first undeleted distance after the first distance visited.
[0148] Assuming that the first distance is the distance between the destination of product 1 and departure point 1 among the three departure points defined in the latest destination allocation method, the departure point associated with the first distance visited is departure point 1. Product 1 corresponds to 3 distances, and the 3 distances corresponding to product 1 include: the distance between the destination of product 1 and each of the three departure points defined in the latest destination allocation method.
[0149] The departure place 1 is determined as the latest departure place of the product 1 defined in the latest departure place allocation method, and the other distances among the multiple distances corresponding to the product 1 are deleted.
[0150] Since the departure place of product 1 defined in the latest departure place allocation method has been determined, the other distances among the multiple distances corresponding to product 1 are deleted, and the other distances among the multiple distances corresponding to product 1 will no longer be accessed. Accordingly, the departure place of product 1 defined in the latest departure place allocation method will no longer be determined.
[0151] After deleting other distances among the multiple distances corresponding to item 1, continue to visit the first undeleted distance after the first distance visited.
[0152] For the Nth visited distance, it is determined whether the busyness of the departure place associated with the Nth visited distance, ie, the departure place based on which the Nth visited distance is calculated, is less than a busyness threshold.
[0153] If the busyness of the departure place associated with the distance visited for the Nth time is less than the busyness threshold, the departure place associated with the distance visited for the Nth time is determined as the departure place of the goods corresponding to the distance visited for the Nth time defined in the latest departure place allocation method, and the other distances among the multiple distances corresponding to the goods are deleted, and the first undeleted distance after the distance visited for the Nth time is continued to be visited.
[0154] If the busyness of the departure point related to the distance visited for the Nth time is equal to the busyness threshold, continue to visit the next distance after the distance visited for the Nth time.
[0155] Assume that the product corresponding to the distance visited for the Nth time is product M. The distance visited for the Nth time is the distance between the destination of product M and the departure point D1 among the three departure points defined in the latest destination allocation method, and the departure point associated with the distance visited for the Nth time is departure point D1. Product 1 corresponds to 3 distances, and product M corresponds to 3 distances including: the distance between the destination of product M and each of the three departure points defined in the latest destination allocation method.
[0156] Since the departure place of the product M defined in the latest departure place allocation method has been determined, the other distances among the multiple distances corresponding to the product M are deleted, and the other distances among the multiple distances corresponding to the product M will no longer be accessed. Accordingly, the departure place of the product M defined in the latest departure place allocation method will no longer be determined.
[0157] After deleting other distances among the multiple distances corresponding to the item M, continue to access the first distance after the item M that has not been deleted.
[0158] Step 202: For each product, the transport robot transports the product from the departure point defined in the final departure point allocation method to the destination of the product defined in the final destination allocation method.
[0159] In the present application, for each of all the goods to be dispatched, the goods can be transported to the departure place of the goods defined in the final departure place allocation method by a conveyor belt. Then, for each of the goods, a transport robot is used to transport the departure place of the goods defined in the final departure place allocation method to the destination of the goods defined in the final destination allocation method, thereby completing the dispatch of all the goods to be dispatched.
[0160] Please refer to Figure 3 , which shows a structural block diagram of a goods dispatching device provided in an embodiment of the present application. The device includes: a determination unit 301 and a transport unit 302.
[0161] The determination unit 301 is configured to repeatedly perform the departure and destination allocation mode determination operation to determine the final departure allocation mode and the final destination allocation mode, wherein the departure and destination allocation mode determination operation includes: repeatedly performing the destination allocation mode determination operation, the destination allocation mode determination operation includes: determining a candidate destination allocation mode based on the current destination allocation mode; determining the latest destination allocation mode based on a first total transport distance corresponding to the current destination allocation mode and a second total transport distance corresponding to the candidate destination allocation mode, wherein the first total transport distance corresponding to the current destination allocation mode and the second total transport distance corresponding to the candidate destination allocation mode are determined based on the current departure allocation mode; performing the following departure allocation mode determination operation: determining the latest departure allocation mode based on the latest destination allocation mode;
[0162] The transport unit 302 is configured to use a transport robot to transport each of the goods to be dispatched from the departure point of the goods defined in the final departure point allocation method to the destination of the goods defined in the final destination allocation method.
[0163] In some embodiments, the determining unit 301 includes:
[0164] The first execution control subunit is configured to: repeatedly execute the departure and destination allocation method determination operation until the first stop condition is met, and the first stop condition is one of the following: the latest destination allocation method and the latest departure allocation method have not changed during the multiple consecutive executions of the departure and destination allocation method determination operation, and the number of times the departure and destination allocation method determination operation has been executed reaches the first number threshold.
[0165] In some embodiments, the determining unit 301 includes:
[0166] The second execution control subunit is configured to: repeatedly execute the destination allocation method determination operation until the second stop condition is met, and the second stop condition is one of the following: the latest destination allocation method has not changed during the multiple destination allocation method determination operations successively executed in the departure and destination allocation method determination operation executed this time, and the number of times the destination allocation method determination operation executed in the departure and destination allocation method determination operation executed this time has reached a second number threshold.
[0167] In some embodiments, the determining unit 301 includes:
[0168] The update determination subunit is configured to determine whether one of multiple update conditions is satisfied based on a first total transport distance corresponding to the current destination allocation method and a second total transport distance corresponding to the candidate destination allocation method, wherein the multiple update conditions include: the first total transport distance corresponding to the current destination allocation method is greater than the second total transport distance corresponding to the candidate destination allocation method, the first total transport distance corresponding to the current destination allocation method is less than the second total transport distance corresponding to the candidate destination allocation method, and the destination allocation method update probability is greater than a probability threshold; if so, the candidate destination allocation method is determined as the latest destination allocation method; if not, the current destination allocation method is determined as the latest destination allocation method.
[0169] In some embodiments, the determining unit 301 includes:
[0170] The candidate destination allocation method determination subunit is configured to determine at least two target goods, wherein each target goods are of the same type and the destination of each target goods defined in the current destination allocation method is different; for each target goods, select a candidate destination of the target goods from the destinations of all target goods defined in the current destination allocation method, wherein the candidate destination of the target goods is different from the destination of the target goods defined in the current destination allocation method.
[0171] In some embodiments, the determining unit 301 includes:
[0172] The latest departure point allocation method determining subunit is configured to determine the latest departure point allocation method based on the distance between the destination of each cargo and each departure point and the busyness of each departure point defined in the latest destination allocation method.
[0173] In some embodiments, the latest departure point allocation method determination subunit is further configured to calculate, for each cargo to be scheduled, the distance between the destination of the cargo and each departure point defined in the latest destination allocation method, to obtain multiple distances corresponding to the cargo; sort all calculated distances in ascending order; and perform a departure point determination operation on the visited distance each time a distance is visited in descending order, the departure point determination operation including: determining whether the busyness of the departure point associated with the visited distance is less than a busyness threshold, if so, determining the departure point associated with the visited distance as the departure point of the cargo corresponding to the visited distance defined in the latest departure point allocation method, deleting other distances in the multiple distances corresponding to the cargo, and continuing to visit the first undeleted distance after the visited distance, if not, continuing to visit the next distance after the visited distance.
[0174] Figure 4 4 is a block diagram of a server provided by the present application. The server includes a processing component 422, which further includes one or more processors, and a memory resource represented by a memory 432 for storing instructions executable by the processing component 422, such as an application. The application stored in the memory 432 may include one or more modules, each corresponding to a set of instructions. In addition, the processing component 422 is configured to execute instructions to perform the above method.
[0175] The server may also include a power supply component 426 configured to perform power management of the server, a wired or wireless network interface 450 configured to connect the server to a network, and an input / output (I / O) interface 458. The server 400 may operate based on an operating system stored in the memory 432, such as Windows Server™, MacOS X™, Unix™, Linux™, FreeBSD™, or the like.
[0176] In an exemplary embodiment, a storage medium including instructions is also provided, such as a memory including instructions, and the instructions can be executed by a server to complete the above method. Optionally, the storage medium can be a non-transitory computer-readable storage medium, for example, the non-transitory computer-readable storage medium can be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, etc.
[0177] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the invention disclosed herein. The present application is intended to cover any variations, uses or adaptations of the present application, which follow the general principles of the present application and include common knowledge or customary techniques in the art that are not disclosed in the present application. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present application are indicated by the following claims.
[0178] It should be understood that the present application is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.
Claims
1. A method for dispatching goods, characterized in that: The method comprises: Repeatedly perform the departure and destination allocation method determination operation to determine a final departure allocation method and a final destination allocation method; For each of the goods to be dispatched, a transport robot is used to transport the goods from the departure place of the goods defined in the final departure place allocation method to the destination of the goods defined in the final destination allocation method, wherein the departure place and destination allocation method determination operation includes: The destination allocation mode determination operation is repeatedly performed, and the destination allocation mode determination operation includes: Based on the current destination allocation method, determine a candidate destination allocation method; Determining a latest destination allocation method based on a first total transport distance corresponding to a current destination allocation method and a second total transport distance corresponding to a candidate destination allocation method, wherein the first total transport distance corresponding to the current destination allocation method and the second total transport distance corresponding to the candidate destination allocation method are determined based on a current departure location allocation method; The following departure allocation method determination operation is performed: Based on the latest destination allocation method, the latest departure allocation method is determined.
2. The method according to claim 1, characterized in that Repeatedly performing the departure and destination allocation method determination operation to determine the final departure allocation method and the final destination allocation method includes: The operation of determining the allocation method of the departure place and the destination is repeatedly performed until the first stop condition is met, and the first stop condition is one of the following: the latest destination allocation method and the latest departure allocation method have not changed during the multiple consecutive executions of the operation of determining the allocation method of the departure place and the destination, and the number of times the operation of determining the allocation method of the departure place and the destination has been performed reaches the first number threshold.
3. The method according to claim 1, characterized in that Repeatedly performing the destination allocation mode determination operation includes: The destination allocation method determination operation is repeatedly performed until the second stop condition is met, and the second stop condition is one of the following: the latest destination allocation method has not changed during the multiple destination allocation method determination operations performed continuously in the departure and destination allocation method determination operation executed this time, and the number of times the destination allocation method determination operation performed in the departure and destination allocation method determination operation executed this time has reached the second number threshold.
4. The method according to claim 1, characterized in that: Determining the latest destination allocation method based on a first total transport distance corresponding to the current destination allocation method and a second total transport distance corresponding to the candidate destination allocation method includes: Based on a first total transport distance corresponding to the current destination allocation method and a second total transport distance corresponding to the candidate destination allocation method, determining whether one of a plurality of update conditions is satisfied, wherein the plurality of update conditions include: the first total transport distance corresponding to the current destination allocation method is greater than the second total transport distance corresponding to the candidate destination allocation method, the first total transport distance corresponding to the current destination allocation method is less than the second total transport distance corresponding to the candidate destination allocation method, and the destination allocation method update probability is greater than a probability threshold; If so, determining the candidate destination allocation method as the latest destination allocation method; If not, determining the current destination allocation method as the latest destination allocation method; The method also includes: calculating the probability of updating the destination allocation method by the formula exp(-(y-x)*β / step), β is a preset parameter, x is a first total transport distance corresponding to the current destination allocation method, y represents a second total transport distance corresponding to the candidate destination allocation method, and step is the number of times the destination allocation method determination operation has been executed.
5. The method according to claim 1, characterized in that Based on the current destination allocation method, the candidate destination allocation methods are determined including: Determine at least two target goods, wherein each target goods is of the same type and each target goods has a different destination defined in a current destination allocation method; For each target item, a candidate destination of the target item is selected from destinations of all target items defined in a current destination allocation method, wherein the candidate destination of the target item is different from the destination of the target item defined in the current destination allocation method.
6. The method according to any one of claims 1 to 5, characterized in that: Based on the latest destination allocation method, the latest departure allocation method is determined including: The latest departure point allocation method is determined based on the distance between the destination of each cargo item and each departure point and the busyness of each departure point defined in the latest destination allocation method.
7. The method according to claim 6, characterized in that Based on the distance between the destination of each product and each departure point and the busyness of each departure point defined in the latest destination allocation method, the latest departure point allocation method is determined to include: For each product to be dispatched, calculate the distance between the destination of the product and each departure point defined in the latest destination allocation method to obtain multiple distances corresponding to the product; Sort all calculated distances from smallest to largest; In order from small to large, each time a distance is visited, a departure point determination operation is performed on the visited distance. The departure point determination operation includes: Determine whether the busyness of the departure place associated with the visited distance is less than the busyness threshold. If so, determine the departure place associated with the visited distance as the departure place of the goods corresponding to the visited distance defined in the latest departure place allocation method, delete other distances among the multiple distances corresponding to the goods, and continue to visit the first undeleted distance after the visited distance. If not, continue to visit the next distance after the visited distance.
8. A goods dispatching device, characterized in that: The device comprises: The determination unit is configured to repeatedly perform a departure and destination allocation method determination operation to determine a final departure allocation method and a final destination allocation method, wherein the departure and destination allocation method determination operation includes: repeatedly performing a destination allocation method determination operation, and the destination allocation method determination operation includes: determining a candidate destination allocation method based on a current destination allocation method; determining a latest destination allocation method based on a first total transport distance corresponding to the current destination allocation method and a second total transport distance corresponding to the candidate destination allocation method, wherein the first total transport distance corresponding to the current destination allocation method and the second total transport distance corresponding to the candidate destination allocation method are determined based on the current departure allocation method; performing the following departure allocation method determination operation: determining a latest departure allocation method based on the latest destination allocation method; The transport unit is configured to use a transport robot to transport each of the goods to be dispatched from the departure point of the goods defined in the final departure point allocation method to the destination of the goods defined in the final destination allocation method.
9. A server, comprising: processor; a memory for storing instructions executable by the processor; The processor is configured to execute the instructions to implement the method according to any one of claims 1 to 7.
10. A storage medium, when instructions in the storage medium are executed by a processor of a server, enables the server to execute the method according to any one of claims 1 to 7.
