Scheduling method, system and equipment for transport vehicles in warehouse pool based on equalization strategy and medium

Abstract

The invention provides a method, a system and equipment for scheduling transport vehicles in a garage pool based on an equalization strategy, and a medium. The method comprises the steps of obtaining information that transport vehicles enter the garage pool; whether idle cranes exist in the storehouses in the storehouse pool or not is judged, and if the idle cranes exist and only one storehouse exists, the position information and the code information of the idle cranes corresponding to the storehouses are sent to the transport vehicle; if there are more than one parking lot with idle cranes, searching from back to front in a historical parking lot queue, and taking the parking lot with no vehicles allocated for the longest time; and if the transport vehicles are allocated to a plurality of warehouses, allocating the warehouse with the highest priority in the warehouse plan. The utilization rate of the transport vehicle in the garage pool can be improved, and the waiting time is shortened. And the work efficiency of the wharf is optimized by dynamically adjusting task allocation.

Description

Technical Field

[0001] The present invention belongs to the technical field of loading and unloading of large bags, pulp, round coils and other standard parts at cargo terminals, and in particular relates to a method, system, equipment and medium for dispatching transport vehicles in a warehouse pool based on a balance strategy. Background Art

[0002] The warehouse pool is a place where goods are stored, loaded, unloaded and transported. In the automated operation process of loading, unloading and moving standard parts such as large bags, pulp, and round coils, it is necessary to dispatch the transport vehicles in the warehouse to the most suitable warehouse for loading and unloading operations.

[0003] After the transport vehicle enters the storage pool, it needs to be assigned to the appropriate storage yard and use the clamps in the storage yard to load and unload the goods.

[0004] However, in actual operation, due to the limited number of warehouses and the limited number of clamps provided, if the number of transport vehicles entering the terminal for loading and unloading is less than the number of clamps, the loading and unloading needs of large bags, pulp, round coils and other standard parts can be met. If the number of transport vehicles entering the terminal for loading and unloading is more than the number of clamps, the loading and unloading needs of large bags, pulp, round coils and other standard parts cannot be met. If the idle clamps in the warehouse cannot be reasonably allocated to the incoming transport vehicles, the waiting time will be extended, reducing the efficiency of loading and unloading goods at the terminal. Moreover, if a reasonable priority strategy cannot be formulated, in the process of allocating clamps, the terminal clamps will be further wasted and idle, reducing the efficiency of loading and unloading in the entire warehouse pool. Summary of the invention

[0005] The present invention provides a method for dispatching transport vehicles in a warehouse pool based on a balance strategy. The method can reasonably allocate the operating relationship between cranes and transport vehicles in the warehouse, meet the loading and unloading needs of large bags, pulp, coils and other standard parts at cargo terminals, and improve the loading and unloading efficiency of large bags, pulp, coils and other standard parts.

[0006] The method of transport vehicle scheduling in the warehouse pool based on the equilibrium strategy includes: Obtain information about transport vehicles entering the warehouse pool; Determine whether there is an idle crane in the yard pool. If there is an idle crane and there is only one yard with an idle crane, send the location information and coding information of the idle crane corresponding to the yard to the transport vehicle; If there is more than one depot with idle cranes, search from the back to the front in the historical depot queue and select the depot with the longest time without assigned vehicles; If multiple warehouses have been assigned transport vehicles, the warehouse with the highest priority in the warehouse plan will be used for allocation.

[0007] It should be further explained that the method also includes: If there are no idle cranes in the yard pool, the round strategy and the remaining crane calculation factor are called up, the remaining crane calculation factor is recalculated, and the remaining crane calculation factor is assigned to the idle crane.

[0008] It should be further explained that, in the method, the remaining crane calculation factor is the number of transport vehicles in the warehouse minus the number of cranes in the warehouse.

[0009] It should be further explained that in the method, the round strategy is configured as the number of transport vehicles in the warehouse pool divided by the number of cranes in the warehouse, rounded down and then added to one; When multiple storage sites compete in the storage site pool, the number of rounds is the minimum number of rounds of all competing storage sites.

[0010] It should be further explained that, in the method, the cranes in the warehouse are allocated in a weighted manner according to the number of cranes in the warehouse pool and the number of transport vehicles in the warehouse pool; in, Establish transport vehicle loading and unloading tasks based on the transport vehicle's urgency, cargo type and handling difficulty, and assess the priority of transport vehicle loading and unloading tasks; Calculate the weight of each crane in different transport vehicle loading and unloading tasks and storage yards.

[0011] It should be further explained that in the method, the warehouse address is encoded for each warehouse in the warehouse pool, and the crane address information of each crane is set; Obtain the warehouses with idle cranes, the transport vehicles to be allocated to the warehouses, and the non-idle crane yards; Based on the warehouse with idle cranes and the transport vehicles to be assigned to the warehouse, the standard parts loading and unloading task relationship between the warehouse with idle cranes and the transport vehicles to be assigned to the warehouse is matched by combining the bipartite graph matching algorithm; The warehouse address code of the idle crane yard and the corresponding crane address information are sent to the transport vehicle to be assigned to the warehouse yard.

[0012] It is further necessary to explain that the current crane usage status of each warehouse is obtained: Get the number of cranes currently in use and the task progress of each crane; Based on the task progress and estimated completion time, predict the number of idle cranes in the future preset time period; Receive information about transport vehicles entering the warehouse pool and match idle cranes according to the priority of standard parts loading and unloading tasks.

[0013] The present application also provides a transport vehicle scheduling system in a warehouse pool based on a balance strategy, the system comprising: Information acquisition module, used to obtain information about transport vehicles entering the storage pool; The crane status judgment module is used to judge whether there are idle cranes in the storage yard pool; The yard allocation module is used to send the location information and coding information of the corresponding idle crane in the yard to the transport vehicle if there is an idle crane in only one yard; If there is more than one warehouse with idle cranes, search from the back to the front in the historical warehouse queue and select the warehouse with the longest time without assigned vehicles; If multiple warehouses have been assigned transport vehicles, the warehouse with the highest priority in the warehouse plan will be used for allocation.

[0014] According to another embodiment of the present application, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the method for scheduling transport vehicles within a warehouse pool based on a balancing strategy when executing the program.

[0015] According to another embodiment of the present application, a storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps of the method for scheduling transport vehicles within a warehouse pool based on a balancing strategy are implemented.

[0016] It can be seen from the above technical solutions that the present invention has the following advantages: The method for dispatching transport vehicles in a warehouse pool provided by the present invention obtains the priority information of the warehouses, compares the priorities of the warehouses, and finds the warehouse with the highest priority. The current transport vehicle is allocated to the warehouse with the highest priority. It can be seen that this embodiment ensures the efficiency and rationality of warehouse allocation and meets the needs of high-priority customers.

[0017] The present invention can reasonably allocate transport vehicles and cranes by calculating the number of rounds, thus avoiding waste and idleness of dock cranes. The round strategy also enables the dispatching system to more accurately grasp the resource situation in the warehouse, thereby making more efficient dispatching decisions. By balancing the needs of transport vehicles and cranes, the loading and unloading processing efficiency in the entire warehouse pool can be improved.

[0018] The present invention ensures balanced allocation among warehouses by setting the priority of historical warehouse queues and the order of operation of the planned cargo positions in the yards. It can efficiently handle the use of multiple warehouses. It also allocates warehouses according to the order of operation of the planned cargo positions in the yards, thereby improving the operation efficiency and accuracy. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to more clearly illustrate the technical solution of the present invention, the accompanying drawings required for use in the description will be briefly introduced below. Obviously, the accompanying drawings in the following description are only some embodiments of the present invention. For ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without paying creative work.

[0020] Figure 1 This is a flow chart of the method for dispatching transport vehicles within the warehouse pool; Figure 2 Schematic diagram of the transport vehicle scheduling system within the warehouse pool based on the equilibrium strategy. DETAILED DESCRIPTION

[0021] The method for dispatching transport vehicles in the warehouse pool provided by the application is to use the warehouse cranes in the warehouse pool in a balanced manner according to the loading and unloading needs of standard parts at the terminal. The application takes into account the number of cranes, the number of operating transport vehicles in the warehouse pool, the operating efficiency of the cranes in the warehouse, the historical selection records of the warehouse, and the planned operation sequence of the cargo space, etc., with the aim of improving the utilization rate of transport vehicles in the warehouse pool and reducing waiting time.

[0022] The storage yard pool of the present application has multiple storage yards, and the storage yards are equipped with multiple cranes.

[0023] The in-yard transport vehicle involved in the present application is a transport vehicle operating in a warehouse.

[0024] When executing the scheduling process, this application first determines the selectable warehouse and selects the crane in the warehouse.

[0025] Specifically, when performing loading and unloading of standard parts at the dock, all the storage yards in the configured storage yard plan in the current operation line are obtained, and the transport vehicles are dispatched according to the idle or non-idle status of the cranes in the storage yards.

[0026] In order to ensure that the selected yards are evenly selected in the yard pool, the selected yards can be recorded as the historical yard queue. Combined with the yards of the current operation line, how many cranes are working, how many cranes are idle, and comprehensive scheduling is carried out according to the status of each yard of the terminal.

[0027] The specific steps of the method for dispatching transport vehicles in a storage pool will be described in detail below. For the purpose of illustration rather than limitation, specific details such as specific system structures and technologies are provided to facilitate a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application can also be implemented in other embodiments without these specific details.

[0028] The term "comprising" is used in the method for dispatching transport vehicles in the storage pool provided by the present application to indicate the existence of the described features, wholes, steps, operations, elements and / or components, but does not exclude the existence or addition of one or more other features, wholes, steps, operations, elements, components and / or their collections. The terms "comprising", "including", "having" and their variations all mean "including but not limited to", unless otherwise specifically emphasized.

[0029] The phrases such as "one embodiment" or "some embodiments" described in the present application mean that the specific features, structures or characteristics described in the embodiment are included in one or more embodiments of the present application. Therefore, the phrases such as "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments" etc. that appear in different places in the present application do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways.

[0030] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0031] See also Figure 1 The figure is a flow chart of a method for dispatching transport vehicles in a warehouse pool based on a balanced strategy in a specific embodiment, and the method includes: S101: Obtaining information on transport vehicles entering the storage pool.

[0032] In some embodiments, the acquired information includes the type of transport vehicle, the type and quantity of the goods, the estimated time of arrival of the vehicle at the storage pool, the location of the storage pool where the goods need to be stored or retrieved, and the like.

[0033] S102: Determine whether there is an idle crane in the yard pool.

[0034] When judging whether there are idle cranes in the storage yard pool, the working status and location information of the cranes can be obtained in real time through real-time monitoring equipment such as cameras and sensors installed in the storage yard. The system can automatically identify whether the crane is working or idle, and transmit this information to the central control room or management system in real time.

[0035] For this embodiment, the existing crane management system can also be used to track the working status and allocation of each crane. The crane management system can record the crane's operation plan, actual operation time, idle time and other information, and update the crane's usage status in real time based on this information.

[0036] In some cases, crane information is obtained and confirmed manually. For example, a crane operator can report to the central control room via a handheld device or a wireless intercom when the crane is idle, confirming that the crane is currently idle.

[0037] S1031: If there is an idle crane and there is only one idle crane in the warehouse, the location information and coding information of the idle crane corresponding to the warehouse are sent to the transport vehicle.

[0038] The coding information of this embodiment is mainly encoded for cranes to form coding information for each crane. The coding can be based on manual settings by the user. Each crane has unique coding information to meet current crane usage requirements.

[0039] In some embodiments, the status of each crane in the storage yard pool can be monitored by the host computer. The host computer can record the usage status of the crane in each storage yard, and the usage status can involve idle, non-idle, etc. By querying the usage status information, it can be determined which storage yards have idle cranes.

[0040] It can be seen that this embodiment ensures that the dispatching system can accurately grasp the status of the cranes, avoiding the situation where some cranes are used intensively, resulting in queues, and some cranes are idle for a long time, which wastes terminal resources. The utilization rate of cranes is improved, ensuring that transport vehicles can load and unload efficiently.

[0041] S1041: If there is more than one warehouse with idle cranes, search from the back to the front in the historical warehouse queue and select the warehouse with the longest time without assigned vehicles; In some embodiments, when there are idle cranes in multiple yards of a terminal, cranes can be allocated according to a historical yard queue. The historical yard queue stores the time when each yard last allocated a vehicle. The host computer can start searching from the end of the queue to find the yard that has not allocated a vehicle for the longest time.

[0042] This embodiment achieves balanced crane allocation, avoiding the situation where cranes in some warehouses are overused while cranes in other warehouses are idle, improving the operation efficiency of the entire warehouse pool, and reducing waiting time and crane idleness.

[0043] S1051: If there are multiple warehouses that have been assigned transport vehicles, the warehouse with the highest priority in the warehouse plan is assigned.

[0044] In this embodiment, the host computer receives the warehouse plan set by the user, and the warehouse plan may involve the priority information of each warehouse. When the host computer detects that there are multiple warehouses that have not been assigned a transport vehicle, it will make a decision based on the priority information of the warehouse. The priority can be based on the urgency of the warehouse, the type of goods, the type of goods on the transport vehicle, etc.

[0045] In some specific embodiments, the host computer obtains the priority information of the warehouses, compares the priorities of the warehouses, and finds the warehouse with the highest priority. The current transport vehicle is allocated to the warehouse with the highest priority. It can be seen that this embodiment ensures the efficiency and rationality of warehouse allocation and meets the needs of high-priority customers.

[0046] In some embodiments, if there are no idle cranes in the yard pool, the round strategy and the remaining crane calculation factor are called up, the remaining crane calculation factor is recalculated, and the remaining crane calculation factor is assigned to the idle crane.

[0047] Among them, the remaining crane calculation factor is the number of transport vehicles in the warehouse minus the number of cranes in the warehouse.

[0048] In some specific embodiments, the purpose of the method is to enable cranes in the warehouse to obtain operations in a balanced manner. When the number of transport vehicles is less than the number of cranes in the warehouse, the transport vehicles are evenly distributed to the warehouse with idle cranes.

[0049] This embodiment takes into account that multiple cranes in the warehouse can work together to operate a transport vehicle. In this embodiment, a remaining crane calculation factor is configured. The remaining crane calculation factor refers to the number of transport vehicles in the warehouse minus the number of cranes in the warehouse.

[0050] When the number of transport vehicles is greater than the number of cranes in the warehouse, there will be no idle cranes, and the transport vehicles need to wait outside the warehouse for idle cranes to appear.

[0051] In order to select a suitable waiting yard, this embodiment configures a round strategy. The round strategy is based on the number of transport vehicles in the yard divided by the number of cranes in the yard, rounded down and then added to one.

[0052] Specifically, the number of transport vehicles V and the number of cranes in the warehouse can be obtained and set as C. The number of transport vehicles V is divided by the number of cranes C, and the result is rounded down, that is, the largest integer not greater than the number is taken, and the result is recorded as R.

[0053] Finally, add 1 to R, and the result is the number of rounds in the warehouse, which is set as T. That is, T = (V / C) + 1.

[0054] The above calculation process of this embodiment reflects the supply and demand relationship between transport vehicles and cranes in the warehouse, and balances the demand between the two by adjusting the number of rounds. In this way, by calculating the number of rounds, transport vehicles and cranes can be reasonably allocated to avoid waste and idleness of dock cranes. The round strategy also enables the scheduling system to more accurately grasp the resource situation in the warehouse, so as to make more efficient scheduling decisions. By balancing the demand for transport vehicles and cranes, the loading and unloading processing efficiency in the entire warehouse pool can be improved.

[0055] For this embodiment, when multiple warehouses compete, the number of rounds is the minimum number of rounds of all competing warehouses. At this time, the remaining crane calculation factor is equal to the transport vehicles in the warehouse multiplied by the rounds minus the number of cranes in the warehouse.

[0056] The calculation method of the remaining crane calculation factor in this embodiment is to define the crane demand of each warehouse within a specific time. It can be configured by the user according to factors such as the warehouse's workload, cargo type, loading and unloading efficiency, etc., and the specific configuration method is set manually.

[0057] Determine the number of cranes currently available and their allocation. This may include cranes that are currently operating, cranes that are idle, and cranes that will soon be available (such as cranes that are under repair but will soon be completed). Using the data on crane demand and supply, users can calculate the crane utilization rate for each yard. This can be the ratio of the number of cranes actually in use to the total number of cranes required, taking into account factors such as crane utilization efficiency, waiting time, etc.

[0058] Finally, a remaining crane calculation factor is calculated based on the crane utilization rate and other relevant factors (such as the priority of the warehouse, historical operation status, future operation forecast, etc.). This factor can be a numerical value, indicating the abundance or shortage of crane resources in the warehouse at present or in the future.

[0059] The formula may be similar to: Remaining crane calculation factor = f(crane demand, crane supply, crane utilization, other relevant factors).

[0060] Here, f is a function defined according to the specific situation and may contain linear, nonlinear or more complex relationships.

[0061] The round strategy calculation rules in this embodiment are as follows: Calculate the round numbers of multiple competing warehouses. Find the warehouses with the remaining crane calculation factor greater than 0. When there are multiple warehouses with the remaining crane calculation factor greater than 0, give priority to dispatching trailers to the warehouses that have not been dispatched for a long time according to the historical warehouse queue. When there are multiple warehouses that do not appear in the historical warehouse queue, select the warehouse with the highest priority according to the yard plan cargo position operation order configured in the operation line.

[0062] In some embodiments, the round strategy calculation rule can calculate the number of rounds according to the above calculation process.

[0063] This embodiment searches and selects the warehouses whose remaining crane calculation factors are greater than 0. Here, according to the definition of the remaining crane calculation factors, the warehouses whose remaining crane calculation factors are greater than 0 can be selected. When there are multiple warehouses whose remaining crane calculation factors are greater than 0, the warehouses that have not been assigned trailers for a long time are given priority for dispatching vehicles according to the historical warehouse queue.

[0064] When there are multiple yards that do not appear in the historical yard queue, the yard with the highest priority is selected for vehicle dispatch according to the yard plan cargo location operation sequence configured in the operation line.

[0065] In this way, the historical warehouse queue and the priority setting of the yard planning position operation sequence ensure the balanced allocation between warehouses. It can efficiently handle the use of multiple warehouses. It also allocates warehouses according to the yard planning position operation sequence to improve the efficiency and accuracy of the operation.

[0066] In some embodiments, the method for dispatching transport vehicles within a storage pool further includes: Obtain the current crane usage status of each warehouse.

[0067] This embodiment can obtain the number of cranes currently in use in each warehouse in real time based on the host computer. This includes the number, location, current task and other information of each crane. In this embodiment, the number of cranes currently in use and the task progress of each crane are also obtained; Based on the task progress and estimated completion time, predict the number of idle cranes in the future preset time period; Receive information about transport vehicles entering the warehouse pool and match idle cranes according to the priority of standard parts loading and unloading tasks.

[0068] This embodiment monitors the task progress of each crane, obtains the completed workload, remaining workload and estimated completion time. According to the task progress and estimated completion time, the number of cranes that will be idle in the future preset time period is estimated. The scheduling of transport vehicles and the allocation of cranes can be planned in advance. Avoid crane idleness and improve loading and unloading efficiency.

[0069] In the process of matching idle cranes, this embodiment selects the cranes that will be idle in the current or future preset time period according to the predicted number of idle cranes in the future. The selected idle cranes are prioritized based on priority sorting, crane model, performance, task completion efficiency and other factors. According to the needs of the transport vehicle and the priority of the standard parts loading and unloading task, the most suitable crane is selected from the prioritized idle cranes for matching. It ensures that the transport vehicle obtains a suitable and efficient crane to improve the operation efficiency.

[0070] In an exemplary embodiment, a yard with idle cranes, a yard transport vehicle to be assigned, and a non-idle crane yard are obtained.

[0071] The idle crane parking lot may include information such as the codes or numbers of the idle cranes, as well as the location information of the idle cranes.

[0072] This embodiment determines the standard parts loading and unloading task matching association between the idle cranes and the standard parts loading and unloading tasks to be assigned based on the idle crane storage yard, the transport vehicles to be assigned in the storage yard, and the number of non-idle cranes.

[0073] When allocating idle crane yards and standard parts loading and unloading tasks, the allocation can be based on the current position of the idle crane and the position of the transport vehicle, and the matching relationship between the idle crane and the standard parts loading and unloading tasks can be obtained by taking into account the shortest distance. The pairing process can match the idle crane with the standard parts loading and unloading tasks to be allocated based on the bipartite graph matching algorithm. In this way, the distance between the idle crane yard and the transport vehicle can be minimized, and fast loading and unloading can be achieved.

[0074] It should be understood that the order of execution of the steps in the above embodiment does not necessarily mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present invention.

[0075] The following is an embodiment of a transport vehicle scheduling system within a yard pool based on a balanced strategy provided in an embodiment of the present disclosure. This system and the transport vehicle scheduling methods within a yard pool in the above-mentioned embodiments belong to the same inventive concept. For details not fully described in the embodiment of the transport vehicle scheduling system within a yard pool based on a balanced strategy, please refer to the embodiment of the transport vehicle scheduling method within the yard pool mentioned above.

[0076] like Figure 2 As shown, the system includes: Information acquisition module, used to obtain information about transport vehicles entering the storage pool; The crane status judgment module is used to judge whether there is an idle crane in the warehouse pool. If there is an idle crane and there is only one warehouse, the location information and coding information of the idle crane corresponding to the warehouse are sent to the transport vehicle; The yard allocation module is used to search from the back to the front in the historical yard queue when there is more than one yard with idle cranes, and select the yard with the longest time without assigned vehicles; If multiple warehouses have been assigned transport vehicles, the warehouse with the highest priority in the warehouse plan will be used for allocation.

[0077] The present application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, the steps of a method for scheduling transport vehicles within a warehouse pool based on a balancing strategy are implemented.

[0078] Electronic devices are intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. Electronic devices may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the embodiments of the present application described and / or claimed herein.

[0079] The processor may be implemented using at least one of an application specific integrated circuit (ASIC), a digital signal processor (DSP), a digital signal processing device (DSPD), a programmable logic device (PLD), a field programmable gate array (FPGA), a processor, a controller, a microcontroller, a microprocessor, and an electronic unit designed to perform the functions described herein, and in some cases, such an implementation may be implemented in a controller. For software implementation, implementations such as processes or functions may be implemented with separate software modules that allow execution of at least one function or operation. The software code may be implemented by a software application (or program) written in any appropriate programming language, and the software code may be stored in a memory and executed by a controller.

[0080] The present application also provides a storage medium, in which a program product capable of implementing the above method of the present specification is stored. In some possible implementations, various aspects of the present disclosure may also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary implementations of the present disclosure described in the above "Exemplary Method" section of the present specification.

[0081] The above description of the disclosed embodiments enables one skilled in the art to implement or use the present invention. Various modifications to these embodiments will be apparent to one skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A method for dispatching transport vehicles in a warehouse pool based on a balanced strategy, characterized in that the method include: Obtain information about transport vehicles entering the warehouse pool; Determine whether there is an idle crane in the yard pool. If there is an idle crane and there is only one yard with an idle crane, send the location information and coding information of the idle crane corresponding to the yard to the transport vehicle; If there is more than one depot with idle cranes, search from the back to the front in the historical depot queue and select the depot with the longest time without assigned vehicles; If multiple warehouses have been assigned transport vehicles, the warehouse with the highest priority in the warehouse plan will be used for allocation.

2. The method for dispatching transport vehicles in a warehouse pool based on a balanced strategy according to claim 1 is characterized in that: The method also includes: If there are no idle cranes in the yard pool, the round strategy and the remaining crane calculation factor are called up, the remaining crane calculation factor is recalculated, and the remaining crane calculation factor is assigned to the idle crane.

3. The method for dispatching transport vehicles in a warehouse pool based on a balanced strategy according to claim 2 is characterized in that: In the method, the remaining crane calculation factor is the number of transport vehicles in the warehouse minus the number of cranes in the warehouse.

4. The method for dispatching transport vehicles in a warehouse pool based on a balanced strategy according to claim 2 is characterized in that: In the method, the round strategy is configured as the number of transport vehicles in the warehouse pool divided by the number of cranes in the warehouse, rounded down and added to one; When multiple storage sites compete in the storage site pool, the number of rounds is the minimum number of rounds of all competing storage sites.

5. The method for dispatching transport vehicles in a warehouse pool based on a balanced strategy according to claim 1, characterized in that: In the method, cranes in the warehouse are allocated in a weighted manner according to the number of cranes in the warehouse pool and the number of transport vehicles in the warehouse pool; in, Establish transport vehicle loading and unloading tasks based on the transport vehicle's urgency, cargo type and handling difficulty, and assess the priority of transport vehicle loading and unloading tasks; Calculate the weight of each crane in different transport vehicle loading and unloading tasks and storage yards.

6. The method for dispatching transport vehicles in a warehouse pool based on a balanced strategy according to claim 5 is characterized in that: In the method, the address of each storage yard in the storage yard pool is encoded, and the crane address information of each crane is set; Obtain the warehouses with idle cranes, the transport vehicles to be allocated to the warehouses, and the non-idle crane yards; Based on the warehouse with idle cranes and the transport vehicles to be assigned to the warehouse, the standard parts loading and unloading task relationship between the warehouse with idle cranes and the transport vehicles to be assigned to the warehouse is matched by combining the bipartite graph matching algorithm; The warehouse address code of the idle crane yard and the corresponding crane address information are sent to the transport vehicle to be assigned to the warehouse yard.

7. The method for dispatching transport vehicles in a warehouse pool based on a balanced strategy according to claim 3 is characterized in that: The method also includes: Obtain the current crane usage status of each warehouse: Get the number of cranes currently in use and the task progress of each crane; Based on the task progress and estimated completion time, predict the number of idle cranes in the future preset time period; Receive information about transport vehicles entering the warehouse pool and match idle cranes according to the priority of standard parts loading and unloading tasks.

8. A transport vehicle dispatching system in a warehouse pool based on a balance strategy, characterized in that: The system is used to implement the method for dispatching transport vehicles in a warehouse pool based on a balanced strategy as described in any one of claims 1 to 7; the system includes: Information acquisition module, used to obtain information about transport vehicles entering the storage pool; The crane status judgment module is used to judge whether there are idle cranes in the storage yard pool; The yard allocation module is used to send the location information and coding information of the corresponding idle crane in the yard to the transport vehicle if there is an idle crane in only one yard; If there is more than one warehouse with idle cranes, search from the back to the front in the historical warehouse queue and select the warehouse with the longest time without assigned vehicles; If multiple warehouses have been assigned transport vehicles, the warehouse with the highest priority in the warehouse plan will be used for allocation.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the steps of the method for scheduling transport vehicles within a warehouse pool based on a balancing strategy as described in any one of claims 1 to 7 are implemented.

10. A storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method for scheduling transport vehicles within a warehouse pool based on a balancing strategy as described in any one of claims 1 to 7 are implemented.

Images