Method for acquiring optimal handling path on the basis of handling tasks and distances of devices

Abstract

The present invention relates to a method for acquiring an optimal handling path on the basis of handling tasks and distances of devices, comprising: listing a fixed path definition table; filling in a device unit table; setting a distance weight value; performing calculation on the basis of the number of handling tasks and the distance weight value, selecting an optimal path, and increasing the number of tasks of an intermediate node on the path by one; and upon completion of a handling task, reducing the number of tasks by one for all the nodes from a starting point to a destination of the task. According to the method for acquiring an optimal handling path on the basis of handling tasks and distances of devices of the present invention, under the condition that lifters or multiple entrances and exits are present, an optimal handling path can be selected on the basis of the number of handling tasks and distances of all the nodes in paths, thereby achieving transport capacity balance in logistics handling.

Description

A method for obtaining the best transport path based on equipment transport tasks and distances Technical Field

[0001] The present invention relates to the field of automated logistics, and in particular to a method for obtaining an optimal transport path based on equipment transport tasks and distances. Background Art

[0002] In automated logistics factories, there are often multiple transport routes for transport carts, especially when using elevators or ladders. If the wrong route is chosen, it can easily lead to transport cart congestion.

[0003] Summary of the Invention

[0004] In order to solve the technical problems existing in the prior art, the present invention provides a method for obtaining an optimal transport path according to the equipment transport task and distance.

[0005] To achieve the above object, the technical solutions of the present invention are as follows:

[0006] A method for obtaining an optimal transport path based on equipment transport tasks and distances, comprising the following steps:

[0007] Step 1: List the fixed route definition table, with parameters including starting point, destination, fixed route and distance;

[0008] Step 2: Fill in the equipment name and handling task quantity into the equipment unit table;

[0009] Step 3: Set the distance weight value;

[0010] Step 4: Select the best path based on the number of transport tasks and the distance weight value, and increase the number of tasks at the intermediate nodes on the path by one;

[0011] Step 5: After the transport task is completed, the task quantity of all nodes from the task starting point to the destination is reduced by one.

[0012] As a preferred technical solution, in step 1, the distance in the fixed path definition table is the distance to the front and rear devices of the area.

[0013] As a preferred technical solution, in step 4, when selecting the starting point and destination of the path, the exit and entrance with the least number of handling tasks are used as the starting point and destination of the optimal path.

[0014] As a preferred technical solution, in step 4, when selecting the intermediate node in the path, the intermediate node with the smallest sum of the number of equipment handling tasks and the product of the distance and weight value is set as the intermediate node of the optimal path.

[0015] As a preferred technical solution, the method further includes step six, when the transport task is canceled, reducing the number of subsequent unexecuted node tasks by one.

[0016] Compared with the prior art, the present invention has the following beneficial effects:

[0017] The method of the present invention for obtaining the optimal transport path based on equipment transport tasks and distances can select the optimal transport path based on the number of transport tasks and distances of all nodes in the path when there are elevators or multiple entrances and exits, thereby achieving a balance of transport capacity in logistics transport. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] FIG1 is a schematic diagram of a conventional automated factory logistics system selecting a transport path;

[0019] FIG2 is a schematic diagram of a method for obtaining an optimal transport path according to equipment transport tasks and distances according to the present invention. DETAILED DESCRIPTION

[0020] The technical solution of the present invention is further described below in conjunction with specific implementation methods: In the logistics and transportation process of existing automated factories, load balancing of handling tasks is usually performed based on the number of tasks scheduled from the starting point to the destination. However, when the handling paths of many devices are shared to a certain intermediate node, it is not possible to ensure that the most suitable intermediate node can be selected only by the number of handling path tasks between the starting point and the destination, because it is impossible to know how many handling tasks of other devices involve the same intermediate node. As shown in Figure 1, the starting point is A and the destination is B. Elevator 1 currently has one handling, elevator 2 has two handlings, and elevator 3 currently has no handling. For A and B, the existing logistics system does not care how many tasks are scheduled on the elevator, but only selects the path based on the number of scheduled tasks and the distance between points A and B. Since elevators 1, 2, and 3 do not have handling tasks belonging to A and B, when moving from A to B, elevator 2, which is closer, will be selected, and elevator 3, which is currently idle, will not be selected.

[0021] After improvement, the present invention's method for obtaining the optimal transport path based on equipment transport tasks and distances uses the number of tasks and distances of intermediate nodes to select the least busy intermediate node when multiple devices share a common intermediate node. As shown in Figure 2, the intermediate node for transport between A and B will select the currently idle elevator 3, thus achieving balanced transport capacity in logistics transport. Specifically, the method includes the following steps:

[0022] Step 1: List the fixed path definition table, as shown in Table 1 below;

[0023] Table 1

[0024] The distance is determined by the distance before and after the domain. According to the data of No. 1, the distance from A to elevator 1 is 10, and the distance from elevator 1 to B is 20.

[0025] Step 2: Fill in the equipment name and handling task quantity into the equipment unit table, as shown in Table 2 below;

[0026] Table 2

[0027] Step 3: Set the distance weight value, as shown in Table 3 below:

[0028] Table 3

[0029] Step 4: Select the best path based on the number of transport tasks and the distance weight value, and increase the number of tasks at the intermediate nodes on the path by one;

[0030] Specifically, if the weight value of a task is 0.1, the fixed path definition table is shown in Table 4 below, and the equipment unit table is shown in Table 5 below.

[0031] Table 4

[0032] Table 5

[0033] The optimal path is: A=>Exit 2=>1F Area=>Elevator 2=>2F Area=>Inlet 1.

[0034] The selection of inbound and outbound ports is directly based on the number of tasks handled. The ports with the least number of tasks are used as the starting and destination points of the optimal path. Distance and weight are considered when selecting intermediate node elevators between areas. This is calculated by adding the number of tasks handled by the equipment to the product of the distance and weight. The smallest value is selected as the intermediate node. For elevator 2, the value of 7 + (10 + 30) * 0.1 is less than the other two elevators. Therefore, elevator 2 is the intermediate node of the optimal path.

[0035] Step 5: After the transport task is completed, the task quantity of all nodes from the task starting point to the destination is reduced by one;

[0036] Step 6: When the transport task is canceled, the number of subsequent unexecuted node tasks is reduced by one.

[0037] This embodiment is only a further explanation of the present invention and is not a limitation of the present invention. After reading this specification, those skilled in the art may make non-creative modifications to this embodiment as needed, but as long as they are within the scope of the claims of the present invention, they are protected by patent law.

Claims

1. A method for obtaining an optimal transport path based on equipment transport tasks and distances, characterized in that: The method comprises the following steps: Step 1: List the fixed route definition table, with parameters including starting point, destination, fixed route and distance; Step 2: Fill in the equipment name and handling task quantity into the equipment unit table; Step 3: Set the distance weight value; Step 4: Select the best path based on the number of transport tasks and the distance weight value, and increase the number of tasks of the intermediate nodes on the path by one; Step 5: After the transport task is completed, the task quantity of all nodes from the task starting point to the destination is reduced by one.

2. The method for obtaining the optimal transport path according to the equipment transport task and distance according to claim 1, characterized in that: In step 1, the distances in the fixed path definition table are the distances to the front and rear devices in the area.

3. The method for obtaining the optimal transport path according to the equipment transport task and distance according to claim 1, characterized in that: In step 4, when selecting the starting point and destination of the path, the exit and entrance with the least number of transport tasks are used as the starting point and destination of the optimal path.

4. The method for obtaining the optimal transport path according to the equipment transport task and distance according to claim 3, characterized in that: In step 4, when selecting the intermediate node in the path, the intermediate node with the smallest sum of the number of equipment handling tasks and the product of the distance and the weight value is set as the intermediate node of the optimal path.

5. The method for obtaining the best transport path according to the equipment transport task and distance according to claim 1, characterized in that: The method further includes step six, when the transport task is canceled, reducing the number of subsequent unexecuted node tasks by one.

Images