Task allocation method, task allocation device, medium and electronic equipment
Through multi-dimensional information, the target equipment is allocated to transportation tasks in the warehousing system, and the minimum cost maximum flow algorithm is used to optimize task allocation, which solves the problem of inefficiency caused by the unreasonable allocation of forklift tasks, and improves task execution efficiency and equipment utilization.
Patent Information
- Application Number
- CN202010307111.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2020-04-15
- Filing Date
- 2020-04-17
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2040-04-17
Smart Images

Figure CN113537672B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of computer technology, and in particular to a task allocation method, a task allocation device, a computer-readable storage medium, and an electronic device. Background Art
[0002] In the warehousing system, it is usually necessary to perform operations such as item sorting, receiving, shipping, and picking. In the process of sorting items, relevant personnel are usually required to assign transportation operations to forklifts based on past experience to control the forklifts to transport the goods to the corresponding locations. However, as the promotion activities of e-commerce platforms become more and more intensive, the number of logistics businesses is growing faster and faster, and manual work usually randomly assigns tasks to forklifts, which can easily cause some forklifts to have too many tasks and some forklifts to have too few tasks, that is, the problem of low rationality of task allocation, which can easily affect the efficiency of task execution.
[0003] It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present application, and therefore may include information that does not constitute the prior art known to ordinary technicians in the field. Summary of the invention
[0004] The purpose of this application is to provide a task allocation method, a task allocation device, a computer-readable storage medium and an electronic device, which can allocate a first transportation task through multi-dimensional information, improve the rationality of task allocation, and thus improve the efficiency of task execution.
[0005] Other features and advantages of the present application will become apparent from the following detailed description, or may be learned in part by the practice of the present application.
[0006] According to a first aspect of the present application, a task allocation method is provided, comprising:
[0007] Acquire at least one first transportation task to be assigned;
[0008] Obtaining the distance between each transport device and the starting point of each first transport task in at least one first transport task, and obtaining the allocated second transport task corresponding to each transport device;
[0009] According to the distance and the number of second transport tasks, a target transport equipment is allocated to each first transport task from each transport equipment, so that the sum of the distances between the starting point of at least one first transport task and the corresponding target transport equipment is minimized, and the sum of the number of first transport tasks and second transport tasks corresponding to each target transport equipment is less than or equal to the upper limit of the number of tasks.
[0010] In an exemplary embodiment of the present application, allocating a target transport device to each first transport task from each transport device according to the distance and the number of second transport tasks includes:
[0011] Determine the starting point and the end point corresponding to each first transportation task;
[0012] Generate a directed graph by taking the starting point, the end point, each transportation equipment, the source node and the sink node as directed graph nodes;
[0013] The minimum cost maximum flow algorithm is used to obtain the target node path from the directed graph; the total cost corresponding to the target node path is the smallest and the total flow corresponding to the target node path is the largest;
[0014] A target transport device is allocated to each first transport task from among the transport devices according to the target node path.
[0015] In an exemplary embodiment of the present application, in a directed graph, there is a first edge between a source node and each transport device, and further includes:
[0016] The difference between the sum of the number of first transport tasks and the second transport tasks corresponding to each target transport equipment and the upper limit of the number of tasks is calculated as the flow upper limit of the corresponding first connection; wherein the cost corresponding to the first connection is 0.
[0017] In an exemplary embodiment of the present application, in the directed graph, there is a second edge between each transport device and the starting point, and further includes:
[0018] The distance is determined as the cost corresponding to the second edge; wherein the flow upper limit corresponding to the second edge is positive infinity.
[0019] In an exemplary embodiment of the present application, in a directed graph, there is a third edge between the starting point and the end point, and further includes:
[0020] The number of total transport tasks corresponding to the starting point and the end point is calculated, where the total transport tasks include at least one of the first transport task and the second transport task; wherein the cost corresponding to the third connection is 0.
[0021] In an exemplary embodiment of the present application, in the directed graph, there is a fourth edge between the end point and the sink node, the flow upper limit corresponding to the fourth edge is positive infinity, and the cost corresponding to the fourth edge is 0.
[0022] In an exemplary embodiment of the present application, obtaining the distance between each transport device and the starting point of each first transport task in at least one first transport task includes:
[0023] Generate a route between each transport device and a starting point of each first transport task in at least one first transport task according to a route generation rule;
[0024] The length corresponding to the route is calculated, and the length is determined as the distance between each transport device and the starting point.
[0025] According to a second aspect of the present application, a task allocation device is provided, comprising a transport task acquisition unit, a distance acquisition unit and a task allocation unit, wherein:
[0026] A transport task acquisition unit, used to acquire at least one first transport task to be assigned;
[0027] A distance acquisition unit, used to acquire the distance between each transport device and the starting point of each first transport task in at least one first transport task, and to acquire the allocated second transport task corresponding to each transport device;
[0028] The task allocation unit is used to allocate target transport equipment for each first transport task from each transport equipment according to the distance and the number of second transport tasks, so that the sum of the distances between the starting point of at least one first transport task and the corresponding target transport equipment is minimized, and the sum of the number of first transport tasks and second transport tasks corresponding to each target transport equipment is less than or equal to the upper limit of the number of tasks.
[0029] In an exemplary embodiment of the present application, the task allocation unit allocates a target transport device to each first transport task from each transport device according to the distance and the number of second transport tasks, including:
[0030] Determine the starting point and the end point corresponding to each first transportation task;
[0031] Generate a directed graph by taking the starting point, the end point, each transportation equipment, the source node and the sink node as directed graph nodes;
[0032] The minimum cost maximum flow algorithm is used to obtain the target node path from the directed graph; the total cost corresponding to the target node path is the smallest and the total flow corresponding to the target node path is the largest;
[0033] A target transport device is allocated to each first transport task from among the transport devices according to the target node path.
[0034] In an exemplary embodiment of the present application, in a directed graph, there is a first edge between a source node and each transport device, and further includes:
[0035] The difference calculation unit is used to calculate the difference between the sum of the number of first transport tasks and second transport tasks corresponding to each target transport equipment and the upper limit of the number of tasks as the flow upper limit of the corresponding first connection; wherein the cost corresponding to the first connection is 0.
[0036] In an exemplary embodiment of the present application, in the directed graph, there is a second edge between each transport device and the starting point, and further includes:
[0037] The cost determination unit is used to determine the distance as the cost corresponding to the second edge; wherein the flow rate corresponding to the second edge is upper bounded to positive infinity.
[0038] In an exemplary embodiment of the present application, in a directed graph, there is a third edge between the starting point and the end point, and further includes:
[0039] The quantity calculation unit is used to calculate the number of total transportation tasks corresponding to the starting point and the end point, and the total transportation tasks include at least one of the first transportation task and the second transportation task; wherein the cost corresponding to the third connection is 0.
[0040] In an exemplary embodiment of the present application, in the directed graph, there is a fourth edge between the end point and the sink node, the flow upper limit corresponding to the fourth edge is positive infinity, and the cost corresponding to the fourth edge is 0.
[0041] In an exemplary embodiment of the present application, the distance acquisition unit acquires the distance between each transport device and the starting point of each first transport task in at least one first transport task, including:
[0042] Generate a route between each transport device and a starting point of each first transport task in at least one first transport task according to a route generation rule;
[0043] The length corresponding to the route is calculated, and the length is determined as the distance between each transport device and the starting point.
[0044] According to a third aspect of the present application, an electronic device is provided, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute any one of the above-mentioned methods by executing the executable instructions.
[0045] According to a fourth aspect of the present application, a computer-readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, any one of the methods described above is implemented.
[0046] The exemplary embodiments of the present application may have some or all of the following beneficial effects:
[0047] In the task assignment method provided in an example implementation of the present application, at least one first transport task to be assigned can be obtained; the distance between each transport equipment and the starting point of each first transport task in at least one first transport task is obtained, and the assigned second transport tasks corresponding to each transport equipment are obtained; target transport equipment is assigned to each first transport task from each transport equipment according to the distance and the number of second transport tasks, so that the sum of the distances between the starting point of at least one first transport task and the corresponding target transport equipment is minimized, and the sum of the number of first transport tasks and second transport tasks corresponding to each target transport equipment is less than or equal to the upper limit of the number of tasks. According to the above scheme description, on the one hand, the present application can assign the first transport task through multi-dimensional information, improve the rationality of task assignment, and thus improve the efficiency of task execution; on the other hand, it can also improve the utilization rate of transport equipment.
[0048] It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS
[0049] The drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present application, and together with the specification are used to explain the principles of the present application. Obviously, the drawings described below are only some embodiments of the present application, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0050] Figure 1 A schematic diagram showing an exemplary system architecture of a task allocation method and a task allocation device to which the embodiments of the present application can be applied;
[0051] Figure 2 A schematic diagram showing the structure of a computer system suitable for implementing an electronic device of an embodiment of the present application is shown;
[0052] Figure 3 A flowchart of a task allocation method according to an embodiment of the present application is schematically shown;
[0053] Figure 4 Schematically shows a schematic diagram of a directed graph according to an embodiment of the present application;
[0054] Figure 5 A flowchart of a task allocation method according to another embodiment of the present application is schematically shown;
[0055] Figure 6 The structure block diagram of a task allocation device according to an embodiment of the present application is schematically shown. DETAILED DESCRIPTION
[0056] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as being limited to the examples set forth herein; on the contrary, these embodiments are provided so that the present application will be more comprehensive and complete, and the concept of the example embodiments will be fully conveyed to those skilled in the art. The described features, structures, or characteristics may be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present application. However, those skilled in the art will appreciate that the technical solutions of the present application may be practiced while omitting one or more of the specific details, or other methods, components, devices, steps, etc. may be adopted. In other cases, known technical solutions are not shown or described in detail to avoid obscuring various aspects of the present application.
[0057] In addition, the accompanying drawings are only schematic illustrations of the present application and are not necessarily drawn to scale. The same reference numerals in the figures represent the same or similar parts, and thus their repeated description will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.
[0058] Figure 1 A schematic diagram of a system architecture of an exemplary application environment in which a task allocation method and a task allocation device according to an embodiment of the present application can be applied is shown.
[0059] like Figure 1 As shown, the warehouse system architecture 100 may include one or more of the transport equipment 101, 102, 103, a network 104 and a task allocation device 105. The network 104 is used to provide a medium for the communication link between the transport equipment 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links or fiber optic cables, etc. The transport equipment 101, 102, 103 can automatically move goods from one location to another. For example, the transport equipment may be an automated guided vehicle (AGV), including but not limited to forklift AGV, lifting AGV, traction AGV, flip AGV, roller AGV, etc. It should be understood that Figure 1 The number of transport equipment, networks and servers in the embodiment is only for illustration. According to the implementation requirements, there may be any number of transport equipment, networks and task allocation devices. For example, the task allocation device 105 may be a server cluster composed of multiple servers.
[0060] The task allocation method provided in the embodiment of the present application is generally executed by the task allocation device 105, and this exemplary embodiment does not specifically limit this. For example, in an exemplary embodiment, the task allocation device 105 can obtain at least one first transport task to be allocated; obtain the distance between each transport equipment and the starting point of each first transport task in at least one first transport task, and obtain the allocated second transport tasks corresponding to each transport equipment; allocate target transport equipment to each first transport task from each transport equipment according to the distance and the number of second transport tasks, so that the sum of the distances between the starting point of at least one first transport task and the corresponding target transport equipment is minimized, and the sum of the number of first transport tasks and second transport tasks corresponding to each target transport equipment is less than or equal to the upper limit of the number of tasks.
[0061] Figure 2 A schematic diagram of the structure of a computer system suitable for implementing an electronic device of an embodiment of the present application is shown.
[0062] It should be noted that Figure 2 The computer system 200 of the electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.
[0063] like Figure 2 As shown, the computer system 200 includes a central processing unit (CPU) 201, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 202 or a program loaded from a storage part 208 into a random access memory (RAM) 203. Various programs and data required for system operation are also stored in the RAM 203. The CPU 201, the ROM 202, and the RAM 203 are connected to each other via a bus 204. An input / output (I / O) interface 205 is also connected to the bus 204.
[0064] The following components are connected to the I / O interface 205: an input section 206 including a keyboard, a mouse, etc.; an output section 207 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 208 including a hard disk, etc.; and a communication section 209 including a network interface card such as a LAN card, a modem, etc. The communication section 209 performs communication processing via a network such as the Internet. A drive 210 is also connected to the I / O interface 205 as needed. A removable medium 211, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 210 as needed, so that a computer program read therefrom is installed into the storage section 208 as needed.
[0065] In particular, according to an embodiment of the present application, the process described below with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present application includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication part 209, and / or installed from a removable medium 211. When the computer program is executed by the central processing unit (CPU) 201, various functions defined in the method and apparatus of the present application are executed.
[0066] In modern automated warehouses, the warehouse management system (WMS) can dispatch transportation equipment (such as light forklifts, etc.) to the shelves to complete the assigned transportation tasks.
[0067] Light forklifts can take the required pallets from different shelves and move them to the conveyor line. Among them, calculating "which forklift will carry the pallet" is an important part of the production process and can affect order efficiency.
[0068] In order to improve production efficiency, the current market system usually adopts the method of dispatching forklifts nearby or randomly. However, the above method does not take into account the situation in the global production process, which may cause some light forklifts to have too many tasks and take too long to complete the tasks, thereby reducing warehouse efficiency.
[0069] Based on the above problems, this exemplary embodiment provides a task allocation method. The task allocation method can be applied to the above task allocation device 105. Figure 3 As shown, the task allocation method may include the following steps S310 to S330:
[0070] Step S310: Obtain at least one first transportation task to be assigned.
[0071] Step S320: obtaining the distance between each transport device and the starting point of each first transport task in at least one first transport task, and obtaining the allocated second transport task corresponding to each transport device.
[0072] Step S330: Allocate target transport equipment for each first transport task from each transport equipment according to the distance and the number of second transport tasks, so that the sum of the distances between the starting points of at least one first transport task and the corresponding target transport equipment is minimized, and the sum of the numbers of first transport tasks and second transport tasks corresponding to each target transport equipment is less than or equal to the upper limit of the number of tasks.
[0073] Next, the above steps of this exemplary embodiment are described in more detail.
[0074] In step S310, at least one first transportation task to be assigned is obtained.
[0075] Among them, the first transport task can be one or more, used to characterize the items to be transported currently. If there are multiple first transport tasks, any first transport task corresponds to a starting point and one or more end points, and the estimated completion time corresponding to each first transport task can be different or the same, which is not limited in the embodiments of the present application. In addition, the starting point corresponding to the first transport task is used to indicate the current location of the items to be transported, and the end point corresponding to the first transport task is used to indicate the location where the items to be transported need to be transported. According to the starting point and end point corresponding to the first transport task, the transport equipment can be controlled to transport the items to be transported from the current location to the location where they need to be transported.
[0076] Specifically, the starting point and the end point corresponding to each first transport task may be determined by obtaining the starting point and the end point in the task information of each first transport task. The task information includes the transport details of the items corresponding to the first transport task, which may include the name of the item to be transported and precautions (e.g., if the item to be transported is fragile) in addition to the starting point and the end point.
[0077] In step S320, the distance between each transport device and the starting point of each first transport task in at least one first transport task is obtained, and the allocated second transport task corresponding to each transport device is obtained.
[0078] The above distance may be a road distance, a water distance, or an air distance, etc., which is not limited in the embodiments of the present application. In addition, the number of to-be-performed transport tasks corresponding to different transport equipment may be the same or different, which is not limited in the embodiments of the present application. In addition, the second transport task is a transport task that has been assigned to the transport equipment.
[0079] It can be seen that the implementation of this optional embodiment can calculate the distance between each transportation equipment and each starting point, and then, the first transportation task can be allocated according to the distance, so that the transportation equipment close to the starting point performs the first transportation task corresponding to the starting point, thereby improving the execution efficiency of the transportation task.
[0080] In the embodiment of the present application, optionally, obtaining the distance between each transport device and the starting point of each first transport task in at least one first transport task includes:
[0081] Generate a route between each transport device and a starting point of each first transport task in at least one first transport task according to a route generation rule;
[0082] The length corresponding to the route is calculated, and the length is determined as the distance between each transport device and the starting point.
[0083] The route generation rule is used to generate a route according to the starting point of the first transport task and the position of each transport equipment, and the transport equipment can travel from the current position to the starting point according to the route.
[0084] In step S330, a target transport equipment is allocated to each first transport task from each transport equipment according to the distance and the number of second transport tasks, so that the sum of the distances between the starting points of at least one first transport task and the corresponding target transport equipment is minimized, and the sum of the numbers of first transport tasks and second transport tasks corresponding to each target transport equipment is less than or equal to the upper limit of the number of tasks.
[0085] In the embodiment of the present application, optionally, allocating a target transport device to each first transport task from each transport device according to the distance and the number of second transport tasks includes:
[0086] Determine the starting point and the end point corresponding to each first transportation task;
[0087] Generate a directed graph by taking the starting point, the end point, each transportation equipment, the source node and the sink node as directed graph nodes;
[0088] The minimum cost maximum flow algorithm is used to obtain the target node path from the directed graph; the total cost corresponding to the target node path is the smallest and the total flow corresponding to the target node path is the largest;
[0089] A target transport device is allocated to each first transport task from among the transport devices according to the target node path.
[0090] Specifically, with the starting point, the end point, each transportation equipment, the source node and the sink node as directed graph nodes, the method of generating the directed graph can be: connecting the source node with each transportation equipment; connecting each transportation equipment with the starting point; connecting the starting point with the end point; connecting the end point with the sink node.
[0091] In the directed graph, there is a first connection edge between the source node and each transport device, and the task allocation method further includes: calculating the difference between the sum of the number of first transport tasks and the second transport tasks corresponding to each target transport device and the upper limit of the number of tasks as the flow upper limit of the corresponding first connection edge; wherein the cost corresponding to the first connection edge is 0. The flow of the first connection edge can represent the busyness of each transport device.
[0092] Furthermore, in the directed graph, there is a second edge between each transport equipment and the starting point, and the task allocation method further includes: determining the distance as the cost corresponding to the second edge; wherein the flow rate corresponding to the second edge has an upper limit of positive infinity.
[0093] Furthermore, in the directed graph, there is a third edge between the starting point and the end point, and the task allocation method also includes: calculating the number of total transportation tasks corresponding to the starting point and the end point as the flow upper limit of the third edge, and the total transportation tasks include at least one of the first transportation task and the second transportation task; wherein the cost corresponding to the third edge is 0.
[0094] Also, in the directed graph, there is a fourth edge between the end point and the sink node, the flow upper limit corresponding to the fourth edge is positive infinity, and the cost corresponding to the fourth edge is 0.
[0095] In addition, before allocating a target transport device to each first transport task from each transport device according to the target node path, the following steps may be further included: obtaining the estimated completion time corresponding to each first transport task. Further, the first transport task may be allocated to the target transport device according to the estimated completion time corresponding to each first transport task and the target node path. In this way, the task arrangement may be performed according to the urgency of the first transport task, thereby improving the orderliness of the task allocation process.
[0096] It can be seen that the implementation of this optional embodiment can distribute tasks according to the distance and the current task volume of each transportation equipment, thereby improving the utilization rate of the transportation equipment and reducing labor costs.
[0097] For example, see Figure 4 , Figure 4 A schematic diagram of a directed graph according to an embodiment of the present application is schematically shown. Figure 4 The source node, sink node, transport equipment A1, transport equipment A2, ..., transport equipment AN, starting point B1, starting point B2, ..., starting point BN, end point C1, end point C2, ..., end point CN are shown in the figure, where N is a positive integer greater than or equal to 3.
[0098] The source node can be connected to transport equipment A1, transport equipment A2, ..., transport equipment AN through directed edges, and transport equipment AN may have the same or different or partially the same upper limit of the number of transport tasks. Figure 4 In the example, the upper limit of the number of transport tasks corresponding to transport equipment A1, transport equipment A2, ..., and transport equipment AN can be represented as 20, 30, ..., and 100. Then, if the number of to-be-executed transport tasks corresponding to transport equipment A1, transport equipment A2, ..., and transport equipment AN are 10, 10, ..., and 10, respectively, it can be understood that since the flow corresponding to the edge connecting the source node and the corresponding transport equipment is the difference between the upper limit of the number of transport tasks and the number of to-be-executed transport tasks, the flow corresponding to the edge between the source node and transport equipment A1, transport equipment A2, ..., and transport equipment AN is 10, 20, ..., and 90.
[0099] Furthermore, each node in the transport equipment A1, transport equipment A2, ..., and transport equipment AN is connected to the starting point B1, starting point B2, ..., and starting point BN. Since the starting point B1, starting point B2, ..., and starting point BN are used to represent different starting points, and the transport equipment A1, transport equipment A2, ..., and transport equipment AN all have corresponding traffic, the transport equipment A1, transport equipment A2, ..., and transport equipment AN can be used to travel to the starting point of any first transport task among the starting point B1, starting point B2, ..., and starting point BN to perform the corresponding first transport task. The corresponding transport equipment can be allocated to the starting point B1, starting point B2, ..., and starting point BN according to the distance between the starting point B1, starting point B2, ..., and starting point BN and the transport equipment A1, transport equipment A2, ..., and transport equipment AN.
[0100] For example, the distances between transport equipment A1 and starting point B1, starting point B2, ..., starting point BN are 10m, 3m, ..., 100m respectively; the distances between transport equipment A2 and starting point B1, starting point B2, ..., starting point BN are 5m, 5m, ..., 5m respectively; the distances between transport equipment AN and starting point B1, starting point B2, ..., starting point BN are 50m, 60m, ..., 2m respectively. It can be seen that the distance between transport equipment A2 and starting point B1 is the shortest, the distance between transport equipment A1 and starting point B2 is the shortest, and the distance between transport equipment AN and starting point BN is the shortest. Therefore, the first transport task corresponding to starting point B1 can be assigned to transport equipment A2, the first transport task corresponding to starting point B2 can be assigned to transport equipment A1, and the first transport task corresponding to starting point BN can be assigned to transport equipment AN.
[0101] Furthermore, transport equipment A1, transport equipment A2, ..., transport equipment AN can start from their respective starting points according to the above task allocation results and transport the items to be transported to the corresponding destination. Figure 4 The end points C1, C2, ..., CN in the figure are used to represent the end points. As can be seen from the figure, the starting point B1 corresponds to two first transport tasks, one of which corresponds to the end point C1 and the other corresponds to the end point C2. In addition, the end point of the first transport task corresponding to the starting point B2 is the end point CN, and the end point of the first transport task corresponding to the starting point BN is the end point C1.
[0102] Furthermore, the end point C1, the end point C2, ..., the end point CN are all connected to the sink node, and the sink node can be used to indicate that the first transport task is completed and the process corresponding to the first transport task is ended.
[0103] Based on the above Figure 4, and for example, the existing transportation equipment includes Forklift No. 1, Forklift No. 2 and Forklift No. 3. For example, the existing first transportation tasks include the first task of transporting a box of apples from the first warehouse to the second warehouse, the second task of transporting a box of bananas from the second warehouse to the third warehouse, and the third task of transporting a box of strawberries from the third warehouse to the fourth warehouse. The upper limit of the number of transportation tasks for Forklift No. 1 is 10 and the number of transportation tasks to be executed is 5, the upper limit of the number of transportation tasks for Forklift No. 2 is 20 and the number of transportation tasks to be executed is 10, and the upper limit of the number of transportation tasks for Forklift No. 3 is 30 and the number of transportation tasks to be executed is 15. Therefore, Forklift No. 1 can also undertake 5 first transportation tasks, Forklift No. 2 can also undertake 10 first transportation tasks, and Forklift No. 3 can also undertake 15 first transportation tasks. Therefore, any of the first task, the second task and the third task can be assigned to Forklift No. 1, Forklift No. 2 or Forklift No. 3. Furthermore, forklift No. 1, forklift No. 2 and forklift No. 3 can transport items according to the starting point and end point corresponding to the assigned task.
[0104] It can be seen that the implementation of this optional embodiment can improve the allocation efficiency and allocation effect of the first transport task by constructing an ordered directed graph.
[0105] It can be seen that implementation Figure 3 The task allocation method shown can allocate the first transportation task through multi-dimensional information, improve the rationality of task allocation, and further improve the task execution efficiency and the utilization rate of transportation equipment.
[0106] See also Figure 5 , Figure 5 A flowchart of a task allocation method according to another embodiment of the present application is schematically shown. Figure 5 As shown, the task allocation method of another embodiment includes steps S500 to S570, wherein:
[0107] Step S500: Obtain at least one first transportation task to be assigned.
[0108] Step S510: Generate a route between each transport device and a starting point of each first transport task in at least one first transport task according to a route generation rule.
[0109] Step S520: Calculate the length corresponding to the route, and determine the length as the distance between each transport device and the starting point of each first transport task.
[0110] Step S530: Obtain the allocated second transport task corresponding to each transport equipment.
[0111] Step S540: Generate a directed graph with the starting point, the end point, each transportation equipment, the source node and the sink node as directed graph nodes.
[0112] Step S550: adopting the minimum cost maximum flow algorithm to obtain the target node path from the directed graph; wherein the total cost corresponding to the target node path is the smallest and the corresponding total flow is the largest.
[0113] Step S560: Allocate target transport equipment for each first transport task from each transport equipment according to the target node path, so that the sum of the distances between the starting point of at least one first transport task and the corresponding target transport equipment is minimized, and the sum of the number of first transport tasks and second transport tasks corresponding to each target transport equipment is less than or equal to the upper limit of the number of tasks.
[0114] It should be noted that steps 500 to S570 are Figure 3 The steps and specific implementation methods shown correspond to each other, so for the embodiments corresponding to steps 500 to S570, please refer to Figure 3 The steps and their limitations shown will not be repeated here.
[0115] It can be seen that implementation Figure 5 The task allocation method shown can allocate the first transportation task through multi-dimensional information, improve the rationality of task allocation, and further improve the task execution efficiency and the utilization rate of transportation equipment.
[0116] Furthermore, in this exemplary embodiment, a task allocation device is also provided. Figure 6 As shown, the task allocation device 600 may include a transportation task acquisition unit 601, a distance acquisition unit 602, and a task allocation unit 603, wherein:
[0117] The transport task acquisition unit 601 is used to acquire at least one first transport task to be assigned;
[0118] A distance acquisition unit 602 is used to acquire the distance between each transport device and the starting point of each first transport task in at least one first transport task, and acquire the allocated second transport task corresponding to each transport device;
[0119] The task allocation unit 603 is used to allocate target transport equipment to each first transport task from each transport equipment according to the distance and the number of second transport tasks, so that the sum of the distances between the starting point of at least one first transport task and the corresponding target transport equipment is minimized, and the sum of the number of first transport tasks and second transport tasks corresponding to each target transport equipment is less than or equal to the upper limit of the number of tasks.
[0120] The distance acquisition unit 602 acquires the distance between each transport device and the starting point of each first transport task in at least one first transport task, including:
[0121] Generate a route between each transport device and a starting point of each first transport task in at least one first transport task according to a route generation rule;
[0122] The length corresponding to the route is calculated, and the length is determined as the distance between each transport device and the starting point.
[0123] It can be seen that implementation Figure 6 The task allocation device shown can allocate the first transportation task through multi-dimensional information, improve the rationality of task allocation, and further improve the task execution efficiency and the utilization rate of transportation equipment.
[0124] In an exemplary embodiment of the present application, the task allocation unit allocates a target transport device to each first transport task from each transport device according to the distance and the number of second transport tasks, including:
[0125] Determine the starting point and the end point corresponding to each first transportation task;
[0126] Generate a directed graph by taking the starting point, the end point, each transportation equipment, the source node and the sink node as directed graph nodes;
[0127] The minimum cost maximum flow algorithm is used to obtain the target node path from the directed graph; the total cost corresponding to the target node path is the smallest and the total flow corresponding to the target node path is the largest;
[0128] A target transport device is allocated to each first transport task from among the transport devices according to the target node path.
[0129] In an exemplary embodiment of the present application, in a directed graph, there is a first connection edge between a source node and each transport device, there is a second connection edge between each transport device and the starting point, there is a third connection edge between the starting point and the end point, there is a fourth connection edge between the end point and the sink node, the flow upper limit corresponding to the fourth connection edge is positive infinity, and the cost corresponding to the fourth connection edge is 0, and the device further includes:
[0130] A difference calculation unit (not shown) is used to calculate the difference between the sum of the number of first transport tasks and second transport tasks corresponding to each target transport equipment and the upper limit of the number of tasks, as the flow upper limit of the corresponding first connection; wherein the cost corresponding to the first connection is 0.
[0131] The cost determination unit (not shown) is used to determine the distance as the cost corresponding to the second edge; wherein the flow rate corresponding to the second edge has an upper limit of positive infinity.
[0132] The quantity calculation unit (not shown) is used to calculate the number of total transportation tasks corresponding to the starting point and the end point, and the total transportation tasks include at least one of the first transportation task and the second transportation task; wherein the cost corresponding to the third connection is 0.
[0133] It should be noted that, although several modules or units of the equipment for task distribution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present application, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of a module or unit described above can be further divided into being embodied by multiple modules or units.
[0134] Since the various functional modules of the task allocation device of the example embodiment of the present application correspond to the steps of the example embodiment of the task allocation method described above, for details not disclosed in the embodiment of the device of the present application, please refer to the embodiment of the task allocation method described above in the present application.
[0135] As another aspect, the present application also provides a computer-readable medium, which may be included in the electronic device described in the above embodiment; or may exist independently without being assembled into the electronic device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by an electronic device, the electronic device implements the method described in the above embodiment.
[0136] It should be noted that the computer-readable medium shown in the present application may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present application, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.
[0137] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the above-mentioned module, program segment or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.
[0138] The units involved in the embodiments described in this application may be implemented by software or hardware, and the units described may also be set in a processor. The names of these units do not, in some cases, constitute limitations on the units themselves.
[0139] 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 modification, use or adaptation of the present application, which follows the general principles of the present application and includes 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.
[0140] 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 task allocation method, characterized in that: include: Acquire at least one first transportation task to be assigned; Obtaining the distance between each transport device and the starting point of each first transport task in the at least one first transport task, and obtaining the allocated second transport tasks corresponding to each transport device; Allocate a target transport device for each first transport task from the transport devices according to the distance and the number of the second transport tasks, so that the sum of the distances between the starting points of at least one first transport task and the corresponding target transport device is minimized, and the sum of the numbers of the first transport tasks and the second transport tasks corresponding to each target transport device is less than or equal to the upper limit of the number of tasks; Wherein, allocating a target transport device to each first transport task from among the transport devices according to the distance and the number of the second transport tasks comprises: Determine the starting point and the end point in the task information of each of the first transport tasks; the task information includes the item transport details corresponding to the first transport task, and the item transport details include the item name and precautions of the item to be transported; A directed graph is generated by using the starting point, the end point, the transportation equipment, the source node and the sink node as directed graph nodes; wherein the source node is connected to the transportation equipment, the transportation equipment is connected to the starting point, the starting point is connected to the end point, and the end point is connected to the sink node; Using the minimum cost maximum flow algorithm, a target node path is obtained from the directed graph; wherein the target node path has the smallest total cost and the largest total flow; The estimated completion times corresponding to the first transport tasks are obtained, and a target transport device is allocated to each of the first transport tasks from the transport devices according to the estimated completion times and the target node paths.
2. The method according to claim 1, characterized in that In the directed graph, there is a first edge between the source node and each of the transport devices, and the method further includes: Calculate the difference between the sum of the number of first transport tasks and the second transport tasks corresponding to each target transport device and the upper limit of the number of tasks as the corresponding flow upper limit of the first connection; wherein the cost corresponding to the first connection is 0.
3. The method according to claim 1, characterized in that In the directed graph, there is a second edge between each of the transport equipment and the starting point, and the method further includes: The distance is determined as the cost corresponding to the second edge; wherein the flow rate corresponding to the second edge is upper bounded to positive infinity.
4. The method according to claim 1, characterized in that: In the directed graph, there is a third edge between the starting point and the end point, and the method further includes: Calculate the number of total transportation tasks corresponding to the starting point and the end point, where the total transportation tasks include at least one of the first transportation task and the second transportation task; wherein the cost corresponding to the third edge is 0.
5. The method according to claim 1, characterized in that In the directed graph, there is a fourth edge between the end point and the sink node, the flow upper limit corresponding to the fourth edge is positive infinity, and the cost corresponding to the fourth edge is 0.
6. The method according to any one of claims 1 to 5, characterized in that: Acquiring the distance between each transport device and the starting point of each first transport task in the at least one first transport task includes: Generate a route between each of the transport devices and a starting point of each of the at least one first transport task according to a route generation rule; The length corresponding to the route is calculated, and the length is determined as the distance between each of the transport equipment and the starting point.
7. A task allocation device, characterized in that: include: A transport task acquisition unit, used to acquire at least one first transport task to be assigned; A distance acquisition unit, used to acquire the distance between each transport device and the starting point of each first transport task in the at least one first transport task, and acquire the allocated second transport task corresponding to each transport device; a task allocation unit, configured to allocate a target transport device to each of the first transport tasks from the transport devices according to the distance and the number of the second transport tasks, so that the sum of the distances between the starting points of the at least one first transport task and the corresponding target transport device is minimized, and the sum of the numbers of the first transport tasks and the second transport tasks corresponding to each of the target transport devices is less than or equal to an upper limit value of the number of tasks; The task allocation unit allocates a target transport device to each of the first transport tasks from the transport devices according to the distance and the number of the second transport tasks, including: Determine the starting point and the end point in the task information of each of the first transport tasks; the task information includes the item transport details corresponding to the first transport task, and the item transport details include the item name and precautions of the item to be transported; A directed graph is generated by using the starting point, the end point, the transportation equipment, the source node and the sink node as directed graph nodes; wherein the source node is connected to the transportation equipment, the transportation equipment is connected to the starting point, the starting point is connected to the end point, and the end point is connected to the sink node; Using the minimum cost maximum flow algorithm, a target node path is obtained from the directed graph; wherein the target node path has the smallest total cost and the largest total flow; The estimated completion times corresponding to the first transport tasks are obtained, and a target transport device is allocated to each of the first transport tasks from the transport devices according to the estimated completion times and the target node paths.
8. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.
9. An electronic device, characterized in that: include: processor; as well as A memory, configured to store executable instructions of the processor; The processor is configured to perform the method of any one of claims 1 to 6 by executing the executable instructions.
