A method, device and electronic equipment for dispatching vehicles between floors of a multi-story shuttle garage

Abstract

The present application discloses a method, device and electronic equipment for dispatching vehicles between floors of a multi-story shuttle garage, and relates to the field of warehouse logistics management technology. It includes: obtaining storage layer information of the entire warehouse, the storage layer information of the entire warehouse includes the number of tasks on each floor and the number of vehicles on each floor; selecting the storage layer with the largest number of tasks per vehicle as the transfer-in layer; selecting the storage layer with the smallest number of tasks per vehicle as the transfer-out layer; the transfer-in layer and the transfer-out layer must satisfy that the number of tasks per vehicle after the transfer-out layer minus 1 vehicle is still less than the number of tasks per vehicle after the transfer-in layer is increased by 1 vehicle, and a layer change task is generated according to the transfer-in layer and the transfer-out layer. The present application rationally adjusts the number of vehicles on each floor according to the distribution of tasks and the distribution of vehicles, minimizes the number of layer changes and the time spent on layer changes, and improves work efficiency.

Description

Technical Field

[0001] The present application relates to the technical field of warehousing logistics management, and in particular to a method, device and electronic equipment for dispatching vehicles between floors of a multi-story shuttle garage. Background Art

[0002] At present, the commonly used scenario of stereoscopic warehouse is a multi-layer shuttle stereoscopic warehouse system composed of shelves, shuttle cars or shuttle boards, in-and-out elevators and layer-changing elevators. Its main feature is that in the actual operation process, the tasks of each layer are not evenly distributed, and the tasks between layers will vary greatly. Each layer is equipped with a certain number of shuttle cars. Therefore, after a period of operation, the number of tasks between layers will vary greatly. In order to solve this problem, the cars between layers will be dynamically allocated so that the number of shuttle cars roughly matches the number of tasks (that is, more cars are needed for layers with more tasks). Summary of the invention

[0003] Based on this, it is necessary to provide a method, device and electronic equipment for dispatching vehicles between floors of a multi-story shuttle garage in response to the above-mentioned technical problems.

[0004] In a first aspect, the present application provides a method for dispatching vehicles between floors of a multi-story shuttle garage, comprising:

[0005] Obtaining storage layer information of the entire warehouse, wherein the storage layer information of the entire warehouse includes the number of tasks and the number of vehicles in each layer;

[0006] Select the storage layer with the largest number of tasks per vehicle as the loading layer;

[0007] Select the storage layer with the smallest number of tasks per vehicle as the call-out layer;

[0008] The transfer-in layer and the transfer-out layer must satisfy that the average number of tasks per vehicle after subtracting 1 vehicle from the transfer-out layer is still less than the average number of tasks per vehicle after adding 1 vehicle to the transfer-in layer, and a layer change task is generated according to the transfer-in layer and the transfer-out layer.

[0009] In one of the embodiments, if the called-out layer is a layer with no tasks but with vehicles, the number of tasks per vehicle after subtracting 1 vehicle from the called-out layer is set to zero.

[0010] In one of the embodiments, the storage layer with the largest number of tasks per vehicle is selected as the transfer-in layer, including: eliminating the storage layers whose average number of tasks per vehicle and the number of vehicles meet the first preset condition from the entire library storage layer to obtain a first layer set, and selecting the storage layer with the largest number of tasks per vehicle from the first layer set as the transfer-in layer; the first preset condition means: the average number of tasks per vehicle is greater than or equal to the lowest threshold of the average number of tasks per vehicle and less than or equal to the highest threshold of the average number of tasks per vehicle, and the number of vehicles is greater than the lowest threshold of the number of vehicles in the layer and less than the highest threshold of the number of vehicles in the layer.

[0011] In one of the embodiments, the layer with the largest number of tasks per vehicle is selected as the incoming layer, including, if the storage layer includes a layer with tasks but no vehicles, dividing the total number of tasks of the storage layer by a preset coefficient as the average number of tasks per vehicle of the layer with tasks but no vehicles.

[0012] In one embodiment, the selecting the layer with the largest number of tasks per vehicle as the input layer includes, if the storage layer includes a layer with tasks but no vehicle, selecting the layer with no vehicle with the largest number of tasks, and comparing the number of tasks of the layer with the largest number of tasks per vehicle with the number of tasks per vehicle per layer;

[0013] If the number of tasks of the vehicle-free layer with the largest number of tasks is greater than the average number of tasks per vehicle of the layer with the largest number of tasks per vehicle, the vehicle-free layer with the largest number of tasks is selected as the transfer-in layer;

[0014] If the number of tasks of the vehicle-free layer with the largest number of tasks is less than the average number of tasks per vehicle of the layer with the largest average number of tasks per vehicle, the layer with the largest average number of tasks per vehicle is selected as the transfer-in layer;

[0015] If the number of tasks of the vehicle-free layer with the largest number of tasks is equal to the number of tasks per vehicle of the layer with the largest number of tasks per vehicle, then one of them can be selected as the transfer-in layer.

[0016] In one embodiment, selecting the storage layer with the smallest number of tasks per vehicle as the call-out layer includes removing the storage layers whose average number of tasks per vehicle and number of vehicles meet the second preset condition from the entire library storage layer to obtain a second layer set, and selecting the storage layer with the smallest number of tasks per vehicle as the call-out layer from the second layer set;

[0017] The second preset condition refers to: the number of tasks per vehicle is greater than or equal to the minimum threshold of the number of tasks per vehicle, less than or equal to the maximum threshold of the number of tasks per vehicle, and the number of vehicles is greater than the minimum threshold of the number of vehicles in the storage layer. In one embodiment, the storage layer with the smallest number of tasks per vehicle is selected as the call-out layer, including, if the storage layer includes a layer with no tasks but vehicles, the layer with no tasks but vehicles is selected as the call-out layer.

[0018] In one of the embodiments, if the storage layer includes multiple layers with no tasks but with vehicles, the layer with no tasks but with vehicles closest to the call-in layer is used as the call-out layer.

[0019] In one embodiment, a layer switching task is generated according to the call-in layer and the call-out layer data, including that the call-in layer and the call-out layer must satisfy that the difference in the average number of tasks per vehicle between the two layers is greater than or equal to a task threshold.

[0020] In one embodiment, the scheduling method includes calculating the planned number of vehicles at each level, where the planned number of vehicles at each level is equal to the number of tasks at each level divided by the average number of tasks for the entire warehouse.

[0021] In one of the embodiments, the actual number of vehicles in the call-out layer must be greater than the planned number of vehicles in the layer, otherwise the layer cannot be used as the call-out layer.

[0022] In a second aspect, the present application further provides a vehicle dispatching device between floors of a multi-story shuttle garage, the device comprising:

[0023] An acquisition module is used to acquire storage layer information of the entire warehouse, wherein the storage layer information of the entire warehouse includes the number of tasks and the number of vehicles in each layer;

[0024] The selection module is used to select the storage layer with the largest number of tasks per vehicle as the call-in layer; and select the storage layer with the smallest number of tasks per vehicle as the call-out layer;

[0025] A comparison module is used to compare the transfer-in layer and the transfer-out layer to ensure that the average number of tasks per vehicle in the transfer-out layer after subtracting one vehicle is still less than the average number of tasks per vehicle in the transfer-in layer after adding one vehicle;

[0026] The task generation module is used to generate layer change tasks according to the call-in layer and the call-out layer.

[0027] In a third aspect, the present application further provides an electronic device, including:

[0028] processor, memory, and bus;

[0029] The processor and the memory communicate with each other via the bus;

[0030] The memory stores program instructions that can be executed by the processor, and the processor can execute the method described above by calling the program instructions. DETAILED DESCRIPTION

[0031] In order to make the purpose, technical solution and advantages of the present application more clear, the present application is further described in detail below in conjunction with the embodiments. It should be understood that the specific embodiments described here are only used to explain the present application and are not used to limit the present application.

[0032] The multi-storey shuttle garage is designed with multiple storage layers to make full use of the warehouse space and improve the storage density. Each storage layer is provided with shelves and multiple cargo spaces. The shelves are provided with tracks for shuttle vehicles to travel. The multi-storey shuttle garage is also provided with a layer-changing elevator for the shuttle vehicles. Some vertical warehouses are provided with cargo elevators in addition to the layer-changing elevators for the shuttle vehicles. The existing shuttle garages are divided into two types, one is a material box shuttle garage, and the other is a pallet shuttle garage. The inter-layer vehicle scheduling method of the present application is applicable to both material box shuttle garages and pallet shuttle garages. Shuttle vehicles are divided into four-way vehicles and two-way vehicles. The following embodiments are described using a four-way vehicle as an example.

[0033] A method for dispatching vehicles between floors of a multi-story shuttle garage, comprising:

[0034] Get the storage layer information of the entire warehouse, which includes the number of tasks and vehicles on each layer. A storage layer with tasks refers to a storage layer with outbound tasks, inbound tasks, or both outbound and inbound tasks. The tasks here can also be tasks to transfer goods to cargo locations. In short, a storage layer that requires shuttle vehicles to transport goods is a storage layer with tasks. During a certain operation period, all storage layers may have transport tasks, or some storage layers may have transport tasks.

[0035] Select the storage layer with the largest number of tasks per vehicle as the loading layer;

[0036] Select the storage layer with the smallest number of tasks per vehicle as the call-out layer;

[0037] The transfer-in layer and the transfer-out layer must satisfy that the average number of tasks per vehicle after subtracting 1 vehicle from the transfer-out layer is still less than the average number of tasks per vehicle after adding 1 vehicle to the transfer-in layer, and the layer change task is generated according to the transfer-in layer and the transfer-out layer. This application makes reasonable adjustments to the number of vehicles on each layer based on the distribution of tasks and vehicles, minimizes the number of layer changes and the time spent on layer changes, and improves work efficiency.

[0038] In one embodiment, if the call-out layer is a layer with no tasks but vehicles, the average number of tasks per vehicle after deducting one vehicle from the call-out layer is set to zero. This prevents the layer from being determined as a call-out layer when there is only one shuttle vehicle in the layer with no tasks but vehicles. After calling out one shuttle vehicle, the number of vehicles and tasks will be zero, and the number of tasks per vehicle will be zero. If the number of tasks is divided by the number of vehicles, zero divided by zero will equal infinity. Therefore, for the layer with no tasks but vehicles, the average number of tasks per vehicle after calling out one vehicle is set to zero.

[0039] Eliminate the storage layers whose average number of tasks per vehicle and number of vehicles meet the first preset condition from the entire storage layer to obtain a first layer set, and select the storage layer with the largest average number of tasks per vehicle from the first layer set as the transfer-in layer;

[0040] When selecting a transfer-in layer, set the first preset condition, and remove the storage layers that do not need to add vehicles from all storage layers with tasks according to the first preset condition, and then obtain the first layer set, and then select the storage layer with the largest number of tasks per vehicle from the first layer set as the transfer-in layer. The number of tasks per vehicle is obtained by dividing the number of tasks of the storage layer by the number of vehicles in the layer.

[0041] Eliminate the storage layers whose average number of tasks per vehicle and number of vehicles meet the second preset condition from the entire storage layer to obtain a second layer set, and select the storage layer with the smallest average number of tasks per vehicle from the second layer set as the call-out layer;

[0042] When selecting a call-out layer, set a second preset condition, and from all storage layers with tasks, eliminate the storage layers that do not need to reduce vehicles according to the second preset condition, and then obtain the second layer set, and then select the storage layer with the smallest number of tasks per vehicle from the second layer set as the call-out layer.

[0043] Generate a layer-changing task based on the call-in layer and the call-out layer. After selecting the call-in layer and the call-out layer, call a vehicle in the call-out layer into the call-in layer. Return and re-obtain the storage layer information of the entire warehouse, which includes the number of tasks and the number of vehicles in each layer; re-select the call-in layer and the call-out layer.

[0044] In one embodiment, the first preset condition refers to: the average number of tasks per vehicle is greater than or equal to the lowest threshold of the average number of tasks per vehicle and less than or equal to the highest threshold of the average number of tasks per vehicle, and the number of vehicles in the storage layer is greater than the lowest threshold of the number of vehicles in the layer and less than the highest threshold of the number of vehicles in the layer.

[0045] Set the minimum threshold and maximum threshold of the average vehicle task. Specifically, the minimum threshold and maximum threshold of the average vehicle task of each storage layer can be the same or different. That is to say, each storage layer in the entire repository can set different minimum thresholds and maximum thresholds, or the minimum threshold and maximum threshold of each layer in the entire repository can be the same. Set the minimum threshold and maximum threshold of the number of vehicles in each layer. Specifically, the minimum threshold and maximum threshold of the number of vehicles in each storage layer can be the same or different. That is to say, each storage layer in the entire repository can set different minimum thresholds and maximum thresholds, or the minimum threshold and maximum threshold of each layer in the entire repository can be the same.

[0046] The number of tasks per vehicle is greater than or equal to the minimum threshold of the average number of tasks per vehicle and less than or equal to the maximum threshold of the average number of tasks per vehicle, and the number of vehicles is greater than the minimum threshold of the number of vehicles per layer and less than the maximum threshold of the number of vehicles per layer. Such a storage layer is considered to have a matching number of vehicles and tasks, and no additional vehicles need to be transferred in.

[0047] The step of selecting the layer with the largest number of tasks per vehicle as the transfer-in layer includes: if the storage layer includes a layer with tasks but no vehicles, dividing the total number of tasks of the storage layer by a preset coefficient as the number of tasks per vehicle for the layer without vehicles. There may be a layer without vehicles in the storage layer, that is, there is a storage layer with tasks but no vehicles. Storage layers with tasks but no vehicles will definitely have vehicles transferred in. The vehicle scheduling method of this embodiment selects only one transfer-in layer and one transfer-out layer to perform the layer-changing work each time, so a vehicle preset coefficient is set for the layer without vehicles, for example, the preset coefficient is set to 1.1 or 1, and the number of tasks of the layer without vehicles is divided by the preset coefficient as the number of tasks per vehicle for the layer without vehicles. In this way, the number of tasks per vehicle is calculated for all storage layers in the first layer set, and the number of tasks per vehicle for all storage layers in the first layer set is compared, and the storage layer with the largest number of tasks per vehicle is selected as the transfer-in layer.

[0048] In one of the embodiments, the layer with the largest number of tasks per vehicle is selected from the first layer set as the input layer, including, if the first layer set includes a vehicle-free layer, selecting the vehicle-free layer with the largest number of tasks, and comparing the number of tasks of the vehicle-free layer with the largest number of tasks with the average number of tasks per vehicle of the layer with the largest number of tasks per vehicle; this embodiment can also be understood as setting the preset coefficient to 1.

[0049] If the number of tasks of the vehicle-free layer with the largest number of tasks is greater than the average number of tasks per vehicle of the layer with the largest number of tasks per vehicle, the vehicle-free layer with the largest number of tasks is selected as the transfer-in layer;

[0050] If the number of tasks of the vehicle-free layer with the largest number of tasks is less than the average number of tasks per vehicle of the layer with the largest average number of tasks per vehicle, the layer with the largest average number of tasks per vehicle is selected as the transfer-in layer;

[0051] If the number of tasks of the vehicle-free layer with the largest number of tasks is equal to the number of tasks per vehicle of the layer with the largest number of tasks per vehicle, then one of them can be selected as the transfer-in layer.

[0052] The second preset condition refers to: the number of tasks per vehicle is greater than or equal to the minimum threshold of the number of tasks per vehicle, less than or equal to the maximum threshold of the number of tasks per vehicle, and the number of vehicles is greater than the minimum threshold of the number of vehicles per layer. Specifically, the minimum threshold of the number of vehicles per layer for a layer with vehicles but no tasks can be set to zero, and the minimum threshold of the number of vehicles per layer for a layer with vehicles and tasks should be set to at least 1. In this way, vehicles in a layer with vehicles but no tasks can be dispatched out. When there is only one shuttle car in a layer with vehicles but no tasks, since the minimum threshold of the number of vehicles per layer is zero, the only remaining shuttle car can also be dispatched out.

[0053] The layer-changing task is generated according to the data of the call-in layer and the call-out layer, including that the call-in layer and the call-out layer must satisfy that the average number of tasks per vehicle after the call-out layer minus 1 vehicle is still less than the average number of tasks per vehicle after the call-in layer is increased by 1 vehicle, otherwise the layer-changing task is not generated. The limitation of this condition can completely avoid the problem of cyclic layer-changing. In the prior art, if the layer is changed only when the difference in the average number of tasks of the shuttle vehicles between layers exceeds a fixed threshold, the fixed threshold cannot guarantee that the problem of cyclic layer-changing is completely avoided, that is, after the shuttle vehicle is called out from the i-th layer and enters the j-th layer, it is recalculated and found that it needs to be called out from the j-th layer and called into the i-th layer again. In complex situations, there will be a cyclic layer-changing problem consisting of multiple layers of call-in and call-out. The present application sets the layer-changing task to be generated only when the average number of tasks per vehicle after the out-of-layer reduces one vehicle is still smaller than the average number of tasks per vehicle after the in-layer increases one vehicle. This can effectively avoid cyclic layer changing because the in-layer and the out-of-layer no longer meet this condition when changing layers. Therefore, there will be no problem of the out-of-layer becoming a new in-layer, the in-layer becoming a new out-of-layer, and the shuttle vehicle cyclically transferring in and out between the two storage layers.

[0054] In one of the embodiments, a storage layer with the smallest number of tasks per vehicle is selected as the call-out layer, including, if the storage layer includes a layer with vehicles but no tasks, using the layer with vehicles but no tasks as the call-out layer.

[0055] In one of the embodiments, if the storage layer includes multiple layers with no tasks but with vehicles, the layer with no tasks but with vehicles closest to the call-in layer is used as the call-out layer.

[0056] A layer-changing task is generated according to the data of the call-in layer and the call-out layer, including that the call-in layer and the call-out layer must satisfy that the difference in the number of tasks per vehicle between the two layers is greater than or equal to the task threshold. If the difference in the number of tasks per vehicle between the call-in layer and the call-out layer is lower than the task threshold, no layer-changing task is generated. It is understandable that when the difference in the number of tasks per vehicle between the call-in layer and the call-out layer is lower than the task threshold, the difference in the number of tasks that each vehicle needs to handle between the two layers is not large, and is within the task range that the shuttle vehicle can afford. At this time, the layer-changing scheduling of the vehicle will not increase the efficiency of the entire warehouse, so there is no need to change the layer. Therefore, when the difference in the number of tasks per vehicle between the call-in layer and the call-out layer is lower than the task threshold, no layer-changing task is generated.

[0057] The scheduling method includes calculating the planned number of vehicles at each layer, where the planned number of vehicles at each layer is equal to the number of tasks at each layer divided by the average number of tasks for the entire warehouse. The planned number of vehicles at each layer is obtained by averaging the tasks of the entire warehouse to the vehicles in the entire warehouse, and then calculating the planned number of vehicles at each layer in geometric proportion to the number of tasks at each layer. In actual calculation, the number of tasks at each layer can be divided by the average number of tasks for the vehicles in the entire warehouse to obtain the planned number of vehicles at each layer.

[0058] In one embodiment, the actual number of vehicles of the call-out layer must be greater than the planned number of vehicles of the layer, otherwise the layer cannot be used as the call-out layer. The actual number of vehicles of the selected call-out layer is compared with the planned number of vehicles. If the actual number of vehicles is greater than the planned number of vehicles, the layer is determined as the call-out layer. If the actual number of vehicles is not greater than the planned number of vehicles, the layer cannot be determined as the call-out layer.

[0059] For ease of understanding, this application provides the following examples:

[0060] There are 4 storage layers in total in the library A. First, obtain the storage layer information. The results are obtained from bottom to top.

[0061] The number of tasks in each layer of the storage layer T = [10,40,60,33], and the total number of tasks T0 = 143.

[0062] The number of cars on each layer V = [1,2,2,3], and the total number of cars V0 = 8;

[0063] The minimum number of shuttles per layer is set to SV = [1,1,1,1], and the maximum number of shuttles per layer is set to XV = [3,3,3,3];

[0064] The average number of tasks per car per layer T` = [10,20,30,11], the average number of tasks per car in the entire warehouse T`0 = 143 / 8 = 17.875;

[0065] The planned number of shuttles per layer H = [0.56, 2.24, 3.36, 1.85];

[0066] The lowest threshold of tasks per vehicle is TL = 3, and the highest threshold of tasks per vehicle is TU = 20;

[0067] The task threshold of the difference between the average number of tasks for vehicles in the transfer-in layer and the transfer-out layer is set to th = 3;

[0068] The method process is as follows:

[0069] Step 1: First, select the transfer-in layer. The maximum number of tasks per layer and car is the third layer, with an average of 30 tasks per car. The third layer does not meet the first preset condition. It meets the requirement that the planned number of cars 3.36 is greater than the actual number of cars 2, so the transfer-in layer is the third layer; therefore, the transfer-in layer is the third layer, and Lr = 3;

[0070] Step 2: Calculate the transfer layer. The layer with the smallest average number of tasks per car is the 1st layer, but the minimum number of cars in the 1st layer is 1, which meets the second preset condition. The transfer layer cannot be the 1st layer, so the only way is to find the 4th layer with the smallest average number of tasks per car from the 2nd, 3rd, and 4th layers. The average number of tasks per car on the 4th layer minus 1 car is 16.5, which is still less than the average number of tasks per car on the 3rd layer after adding 1 car, which is 20. Therefore, the transfer layer is determined to be the 4th layer, and Ls = 4;

[0071] Step 3: The average task difference between the 3rd and 4th floors is greater than the task threshold th = 3; therefore, a floor-changing task is generated, and a car is transferred from the 4th floor to the 3rd floor.

[0072] One of the embodiments of the present application further provides an electronic device, including:

[0073] processor, memory, and bus;

[0074] The processor and the memory communicate with each other via the bus;

[0075] The memory stores program instructions that can be executed by the processor, and the processor can execute the above method by calling the program instructions. The present application also provides an inter-layer vehicle dispatching device for a multi-layer shuttle garage, characterized in that the device includes:

[0076] An acquisition module is used to acquire storage layer information of the entire warehouse, wherein the storage layer information of the entire warehouse includes the number of tasks and the number of vehicles in each layer;

[0077] The selection module is used to select the storage layer with the largest number of tasks per vehicle as the call-in layer; and select the storage layer with the smallest number of tasks per vehicle as the call-out layer;

[0078] A comparison module is used to compare the transfer-in layer and the transfer-out layer to ensure that the average number of tasks per vehicle in the transfer-out layer after subtracting one vehicle is still less than the average number of tasks per vehicle in the transfer-in layer after adding one vehicle;

[0079] The task generation module is used to generate layer change tasks according to the call-in layer and the call-out layer.

[0080] In one embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the above method when executing the computer program.

[0081] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties.

[0082] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., but are not limited to this.

[0083] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0084] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A method for dispatching vehicles between floors of a multi-story shuttle garage, characterized in that: include: Obtaining storage layer information of the entire warehouse, wherein the storage layer information of the entire warehouse includes the number of tasks and the number of vehicles in each layer; Select the storage layer with the largest number of tasks per vehicle as the loading layer; Select the storage layer with the smallest number of tasks per vehicle as the call-out layer; The transfer-in layer and the transfer-out layer must satisfy that the average number of tasks per vehicle after subtracting 1 vehicle from the transfer-out layer is still less than the average number of tasks per vehicle after adding 1 vehicle to the transfer-in layer, and a layer change task is generated according to the transfer-in layer and the transfer-out layer.

2. The scheduling method according to claim 1, characterized in that: If the called-out layer is a layer with no tasks but with vehicles, the average number of tasks per vehicle after subtracting 1 vehicle from the called-out layer is set to zero.

3. The scheduling method according to claim 1, characterized in that: Selecting the storage layer with the largest number of tasks per vehicle as the transfer-in layer, including removing the storage layers whose average number of tasks per vehicle and the number of vehicles meet the first preset condition from the entire library storage layer to obtain a first layer set, and selecting the storage layer with the largest number of tasks per vehicle as the transfer-in layer from the first layer set; The first preset condition refers to: the average number of tasks per vehicle is greater than or equal to the lowest threshold of the average number of tasks per vehicle and is less than or equal to the highest threshold of the average number of tasks per vehicle, and the number of vehicles is greater than the lowest threshold of the number of vehicles per layer and less than the highest threshold of the number of vehicles per layer in the storage layer.

4. The scheduling method according to claim 1, characterized in that: The step of selecting the layer with the largest number of tasks per vehicle as the incoming layer includes, if the storage layer includes a layer with tasks but no vehicles, dividing the total number of tasks of the storage layer by a preset coefficient as the number of tasks per vehicle in the layer without vehicles.

5. The scheduling method according to claim 1, characterized in that: The step of selecting the layer with the largest number of tasks per vehicle as the transfer-in layer comprises: if the storage layer includes multiple layers with tasks but no vehicles, selecting the layer with the largest number of tasks but no vehicles, and comparing the number of tasks of the layer with the largest number of tasks but no vehicles with the number of tasks per vehicle per layer; If the number of tasks of the vehicle-free layer with the largest number of tasks is greater than the average number of tasks per vehicle of the layer with the largest number of tasks per vehicle, the vehicle-free layer with the largest number of tasks is selected as the transfer-in layer; If the number of tasks of the vehicle-free layer with the largest number of tasks is less than the average number of tasks per vehicle of the layer with the largest average number of tasks per vehicle, the layer with the largest average number of tasks per vehicle is selected as the transfer-in layer; If the number of tasks of the vehicle-free layer with the largest number of tasks is equal to the number of tasks per vehicle of the layer with the largest number of tasks per vehicle, then one of them can be selected as the transfer-in layer.

6. The scheduling method according to claim 1, characterized in that: Selecting the storage layer with the smallest number of tasks per vehicle as the call-out layer, including removing the storage layers whose average number of tasks per vehicle and number of vehicles meet the second preset condition from the entire library storage layer to obtain a second layer set, and selecting the storage layer with the smallest number of tasks per vehicle as the call-out layer from the second layer set; The second preset condition refers to: the average number of tasks per vehicle is greater than or equal to the minimum threshold of the average number of tasks per vehicle, less than or equal to the maximum threshold of the average number of tasks per vehicle, and the number of vehicles is greater than the storage layer with the minimum threshold of the number of vehicles per layer.

7. The scheduling method according to claim 1, characterized in that: The storage layer with the smallest number of tasks per vehicle is selected as the call-out layer, including, if the storage layer includes a layer with vehicles but no tasks, using the layer with vehicles but no tasks as the call-out layer.

8. The scheduling method according to claim 6, characterized in that: If the second layer set includes multiple layers with vehicles but no tasks, the layer with vehicles but no tasks closest to the transferred-in layer is used as the transferred-out layer.

9. The scheduling method according to claim 1, characterized in that: A layer-changing task is generated according to the call-in layer and the call-out layer data, including that the call-in layer and the call-out layer must satisfy that the difference in the average number of tasks per vehicle between the two layers is greater than or equal to a task threshold.

10. The scheduling method according to claim 1, characterized in that: The scheduling method includes calculating the planned number of vehicles at each layer, where the planned number of vehicles at each layer is equal to the number of tasks at each layer divided by the average number of tasks for the entire warehouse; the actual number of vehicles at the transfer-out layer must be greater than the planned number of vehicles at the layer, otherwise the layer cannot be used as a transfer-out layer.

11. A vehicle dispatching device between floors of a multi-story shuttle garage, characterized in that: The device comprises: An acquisition module is used to acquire storage layer information of the entire warehouse, wherein the storage layer information of the entire warehouse includes the number of tasks and the number of vehicles in each layer; The selection module is used to select the storage layer with the largest number of tasks per vehicle as the call-in layer; and select the storage layer with the smallest number of tasks per vehicle as the call-out layer; A comparison module is used to compare the transfer-in layer and the transfer-out layer to ensure that the average number of tasks per vehicle in the transfer-out layer after subtracting one vehicle is still less than the average number of tasks per vehicle in the transfer-in layer after adding one vehicle; The task generation module is used to generate layer change tasks according to the call-in layer and the call-out layer.

12. An electronic device, characterized in that: include: processor, memory, and bus; The processor and the memory communicate with each other via the bus; The memory stores program instructions executable by the processor, and the processor can execute the method according to any one of claims 1 to 10 by calling the program instructions.