Task scheduling method for four-way shuttle vehicle type intensive warehousing system

By establishing a mathematical model of task execution time and a whale optimization algorithm that integrates multi-strategy, the problem of low efficiency of coordinated scheduling between multiple elevators and shuttle vehicles in a four-way shuttle intensive storage system is solved, and efficient coordination between equipment and task scheduling is achieved. Intelligentization improves the overall operational efficiency of the warehousing system.

CN118907720AActive Publication Date: 2024-11-08NANJING UNIV OF SCI & TECH

Patent Information

Application Number
CN202410556822.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-05-07
Publication Date
2024-11-08
Estimated Expiration
2044-05-07

AI Technical Summary

Technical Problem

The existing four-way shuttle intensive storage system has low efficiency in the coordinated scheduling of multiple elevators and shuttle vehicles, and cannot fully utilize the coordinated advantages between equipment, resulting in low operating efficiency.

Method used

By establishing a mathematical model of task execution time for the elevator and shuttle, combining whale optimization algorithm with multi-strategy fusion, dynamically adjusting the operation sequence and equipment combination, and optimizing the scheduling strategy to achieve efficient collaboration between equipment.

Benefits of technology

It significantly reduces waiting and idle time between equipment, improves operating efficiency and speed, realizes intelligence and efficiency of task scheduling, and improves the overall operational efficiency of the warehousing system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118907720A_ABST
    Figure CN118907720A_ABST
Patent Text Reader

Abstract

The invention provides a task scheduling method for a four-way shuttle vehicle type intensive warehousing system. The task scheduling method comprises the steps that an elevator task execution time mathematical model and a warehouse-in and warehouse-out task execution time mathematical model are established, and a multi-strategy fusion whale optimization algorithm is used for solving the operation sorting problem of multiple elevators and shuttle vehicles. The scheduling time, the operation time and the waiting time of the elevator and the shuttle vehicle are calculated, and the total time of operation is optimized through the target function. A multi-strategy fusion whale optimization algorithm is introduced, and the algorithm combines multiple intelligent optimization strategies to obtain the optimal operation time of all warehouse-in and warehouse-out tasks. The operation efficiency and the resource utilization rate of the warehousing system can be obviously improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the category of task scheduling algorithms in the field of four-way shuttle type intensive storage, and specifically relates to a task scheduling method for a four-way shuttle type intensive storage system. Background Art

[0002] In recent years, the logistics system has gradually developed in the direction of automation, and there have been automated warehousing systems such as stacking warehouses and shuttle storage systems. These automated warehouses have outstanding advantages such as large capacity, low labor costs, strong turnover, and strong environmental adaptability, and have been widely used. The four-way shuttle intensive storage system is an emerging and efficient automated warehousing system. The system uses intensive storage to effectively improve the storage space utilization rate of the warehouse and greatly reduce the storage cost. At the same time, it makes full use of automated warehousing equipment such as elevators and shuttles, greatly reducing personnel input, labor costs and management costs. At the same time, the intensive storage system completes the task of entering and leaving the warehouse of materials through automated picking equipment, and can realize a variety of automated warehousing functions through flexible storage configuration, promoting the process of transformation from automated warehousing to intelligentization.

[0003] The scheduling strategy of storage equipment usually takes the shortest total operation time, the minimum energy consumption and the balance of equipment operation as the goals, taking into account the constraints such as operation process, equipment quantity and task priority, and uses intelligent optimization algorithm to calculate the mathematical model of multi-objective and multi-constraint, and solves to obtain an efficient scheduling solution. At present, the dynamic scheduling method is the main scheduling form of automated warehouses, and the main research methods include traditional analysis methods, simulation and modeling, intelligent optimization methods and hybrid optimization methods. Among them, although the mathematical solution method can accurately calculate the optimal task scheduling results, its calculation time is too long and the calculation amount is too large, which is not applicable in the actual operation scheduling of the storage system. At present, intelligent search algorithms are more often used to solve NP problems, such as genetic algorithms, simulated annealing, ant colony algorithms, etc. Although the dynamic scheduling strategy can solve the disturbance problem, the model has good robustness and can even complete the real-time scheduling problem, it cannot coordinate the coordination problem between the elevator and the shuttle workshop, which will waste the flexibility advantage of the coordination of multiple equipment in dense storage. Summary of the invention

[0004] The purpose of the present invention is to provide a task scheduling method for a four-way shuttle dense storage system, aiming at the problem of coordinated scheduling of multiple elevators and shuttles in dense storage, so as to improve the storage operation efficiency.

[0005] The technical solution to achieve the purpose of the present invention is:

[0006] A task scheduling method for a four-way shuttle type dense storage system, comprising:

[0007] S1. Establishing a mathematical model of the execution time of the elevator task: Establishing a mathematical model of the time in which the elevator first delivers the goods to the cargo location layer where the shuttle car is located, and then delivers the goods and the shuttle car to the cargo location target layer; establishing a mathematical model of the time in which the elevator first carries the shuttle car working in coordination and then goes to the in-and-out layer to obtain the goods and delivers them to the target cargo location layer; and establishing a mathematical model of the time in which the elevator delivers the nearest idle shuttle car to the cargo location target layer during the coordinated outbound operation, and then the shuttle car goes to the target cargo location to take out the goods and then completes the outbound task through the elevator;

[0008] S2. Establishing a mathematical model for the objective function expression of the execution time of the in-and-out task: Based on the mathematical model of the shuttle task execution time and the mathematical model of the elevator task execution time obtained in S1, the total execution time of the shuttle and elevator tasks in different modes is obtained respectively, and then the mathematical model of the in-and-out task execution time is obtained;

[0009] S3. According to the goal of minimizing the overall warehousing and warehousing operation time of all tasks in the order, the whale optimization algorithm with multi-strategy fusion is used to solve the operation sorting problem of multiple elevators and shuttle vehicles.

[0010] Compared with the prior art, the present invention has the following significant advantages:

[0011] (1) By calculating and optimizing the scheduling time and operation time of the elevator and shuttle, efficient coordination of equipment operations can be achieved: The present invention establishes a mathematical model of the task execution time of the elevator and shuttle, takes into account the scheduling time and waiting time under various working modes, and optimizes the time efficiency of collaborative operations. Compared with traditional technologies, this method can significantly reduce the waiting and idle time between equipment and improve the efficiency and speed of the overall operation.

[0012] (2) By introducing the whale optimization algorithm that integrates multiple strategies, it is possible to achieve intelligent and efficient task scheduling: The whale optimization algorithm adopted by the present invention integrates multiple optimization strategies, including nonlinear convergence factor strategy, adaptive weight strategy and random difference mutation strategy, etc., which provides an effective solution for solving complex multi-objective and multi-constraint optimization problems. This algorithm can effectively improve the solution speed and accuracy, and achieve intelligent and efficient task scheduling.

[0013] (3) By dynamically adjusting the operation sequence of the elevator and shuttle and selecting the cooperative vehicle with the shortest operation time, the scheduling efficiency can be significantly improved: the present invention uses the whale optimization algorithm to dynamically select the optimal elevator and shuttle combination for each inbound and outbound task and adjust the operation sequence, which not only reduces the mutual interference between tasks, but also optimizes the working route of the equipment. By reducing the moving distance and waiting time of the equipment, the operation efficiency is directly improved, thereby improving the overall operational efficiency of the warehousing system without increasing additional resource investment. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] Figure 1 It is a flowchart of the whale optimization algorithm integrating multiple strategies;

[0015] Figure 2 It is the Gantt chart for scheduling elevator and shuttle tasks. DETAILED DESCRIPTION

[0016] The present invention is further described below in conjunction with the accompanying drawings and specific embodiments.

[0017] Combination Figure 1 The present invention provides a task scheduling method for a four-way shuttle type intensive storage system, comprising the following steps:

[0018] S1, establish the mathematical model of the hoist task execution time t1, t2, t3;

[0019] In the storage system, for the jth elevator L j , the node where the current position is located is P j , the coordinates are (P jx ,P jy ,P jz ), P lj Indicates the elevator in and out position (x j ,y j ,z j ), P ji The node representing the entrance of the shelf layer where the i-th task target executed by the j-th elevator is located has the coordinates (P jix ,P jiy ,P jiz ), S ji represents the start time of the jth elevator to perform the i-th task. The total number of shuttles is N, C k represents the kth shuttle, P k Indicates the exit and entrance position of the jth elevator on the cargo layer where the kth shuttle is currently located, and the coordinates are (P kx ,P ky, P kz ), P C(i-1) 、E k(i-1) They represent the coordinates and time when the kth shuttle completed the previous task. For the i-th task performed by the j-th elevator, a shuttle needs to be selected to perform the task and make the collaborative completion time the shortest.

[0020] When the elevator and shuttle car work together to complete the warehousing task, there are two working modes. After calculating the scheduling time of the shuttle car, when selecting the shuttle car for collaborative operation, it is necessary to consider the shuttle car with the shortest operating time in the two working modes, so that it can work with the elevator to complete the warehousing task.

[0021] (1) The elevator first transports the goods to the cargo layer where the shuttle is located, and then transports the goods and the shuttle to the target cargo layer. In this working mode, the minimum call time t1 required for the j-th elevator to perform the i-th task and call the elevator collaborative operation is expressed as

[0022] In the above formula, V L Indicates the running speed of the elevator, D L (P j ,P lj ) represents the travel distance from the current position of the jth elevator to the storage position, D L (P lj ,P k ) represents the walking distance from the storage location of the jth elevator to the current cargo layer where the kth shuttle is located, D L (P k ,P ji ) represents the travel distance from the cargo level where the k-th shuttle is currently located to the level where the j-th elevator is performing the i-th task.

[0023] (2) The elevator first carries the shuttle car for collaborative work and then goes to the in-and-out layer to obtain the goods and transport them to the target cargo layer. In this mode, the minimum call time t2 required for the j-th elevator to perform the i-th task and call the shuttle car for collaborative work is expressed as

[0024] In the above formula, V L Indicates the running speed of the elevator, D L (P j ,P k ) represents the travel distance from the current position of the jth elevator to the current cargo layer of the kth shuttle, D L (P k ,P lj ) represents the travel distance from the current cargo layer of the kth shuttle to the storage location of the jth elevator, D L (P lj ,P ji ) represents the travel distance from the level where the j-th elevator performs the i-th task to the elevator storage position.

[0025] In the above two working modes, after the elevator reaches the cargo layer where the kth shuttle car is located, k The waiting times for the locations are:

[0026]

[0027] In the above two equations, E k(i-1) represents the time when the kth shuttle completed its previous task, D C (PC(i-1) ,P k ) represents the travel distance of the k-th shuttle from the position after the previous task is completed to the position of the j-th elevator on the floor where the k-th shuttle is located, D L (P j ,P k ) represents the travel distance from the current position of the jth elevator to the current cargo layer of the kth shuttle, D L (P j ,P ji ) represents the walking distance from the current position of the jth elevator to the layer where the i-th task target is executed, S ji represents the starting time when the jth elevator performs the i-th task, V C Indicates the running speed of the four-way shuttle, V L Indicates the operating speed of the elevator.

[0028] During the collaborative outbound operation, the nearest idle shuttle can only be transported to the target cargo location layer by the elevator. After the shuttle takes out the goods from the target cargo location, the outbound task is completed by the elevator. T3 represents the minimum call time required for the j-th elevator to perform the i-th task and call the shuttle for collaborative operation:

[0029]

[0030] In the above formula, D L (P C(i-1) ,P k ) represents the travel distance of the jth elevator from the level where the previous task was completed to the cargo level where the kth shuttle is currently located, D L (P k ,P ji ) represents the travel distance of the jth elevator from the current cargo layer where the kth shuttle is located to the target node sitting layer where the i-th task is performed, D C (P C(i-1) ,P k ) represents the travel distance of the k-th shuttle from the position after the previous task is completed to the position of the j-th elevator on the floor where the k-th shuttle is located, V C Indicates the running speed of the four-way shuttle, V L Indicates the operating speed of the elevator

[0031] After the elevator reaches the cargo layer where the kth shuttle car is located, k The waiting times for the locations are:

[0032]

[0033] In the above formula, E k(i-1) represents the time when the kth shuttle completed its previous task, DC (P C(i-1) ,P k ) represents the travel distance of the k-th shuttle from the position after the previous task is completed to the position of the j-th elevator on the floor where the k-th shuttle is located, D L (P j ,P k ) represents the travel distance from the jth elevator to the cargo layer where the kth shuttle is currently located, S ji represents the starting time when the jth elevator performs the i-th task, V C Indicates the running speed of the four-way shuttle, V L Indicates the operating speed of the elevator.

[0034] S2, establish a mathematical model for the objective function expression of the execution time of the in-and-out task;

[0035] (1) The elevator performs the warehousing task. The time for the shuttle to perform task i includes the time from the current position to the current layer entrance, the time to change layers following the elevator scheduling, and the time to reach the target cargo position after receiving the goods from the entrance. If the kth shuttle is selected to complete the warehousing task in collaboration, the operation time of the jth elevator and the kth shuttle to complete the i-th warehousing task can be expressed as:

[0036] t in L ji =min(t1,t2)

[0037]

[0038] In the above formula, D L (P k ,P ji ) represents the travel distance of the jth elevator from the current cargo layer where the kth shuttle car is located to the elevator storage position, D C (P C(i-1) ,P k ) represents the travel distance of the k-th shuttle from the position after the previous task is completed to the position of the j-th elevator on the floor where the k-th shuttle is located, D C (P k ,P ji ) represents the travel distance of the kth shuttle from the jth elevator position of the current cargo layer to the target node of the i-th task target, D L (P k ,P lj ) represents the travel distance from the current cargo layer of the kth shuttle to the storage location of the jth elevator, D L (P lj ,P ji) represents the walking distance from the level where the j-th elevator performs the i-th task to the elevator storage position, V C Indicates the running speed of the four-way shuttle, V L Indicates the operating speed of the elevator.

[0039] (2) The elevator performs the outbound task. When performing the outbound task, if there is no free shuttle car available at the outbound cargo layer, the elevator is required to transport the shuttle car to the outbound cargo layer. The operation time for the jth elevator to select the shuttle car to complete the i-th outbound task is:

[0040]

[0041] The time it takes for the kth shuttle to complete the i-th task is:

[0042]

[0043] In the above formula, D L (P k ,P ji ) represents the travel distance of the jth elevator from the current cargo layer of the kth shuttle to the outbound location of the i-th task elevator, D C (P j(i-1) ,P k ) represents the travel distance of the Kth shuttle from the last mission target node to the exit position of the jth elevator on the current cargo layer, D C (P ji ,P k ) represents the travel distance of the kth shuttle from the exit position of the jth elevator at the current cargo layer to the entrance node of the shelf layer where the i-th task target is executed by the jth elevator, V C Indicates the running speed of the four-way shuttle, V L Indicates the operating speed of the elevator.

[0044] (3) The sum of the execution time of all elevator tasks can be obtained by using the execution time of the jth elevator task in the above formula, and we get The value of .

[0045]

[0046] The sum of the execution time of all shuttle tasks can be obtained by using the execution time of the kth shuttle task in the above formula, and we can get The value of .

[0047]

[0048] The collaborative scheduling process of multiple elevators and shuttles is to first assign task queues to the elevators, then sort the tasks of the elevators, and then select the collaborative shuttle to complete the tasks. The overall optimization goal of collaborative scheduling is to minimize the total time for the equipment to complete the operation, so the objective function is defined as:

[0049]

[0050] They are the total time for all elevators and shuttles to perform tasks, which are obtained by adding the time for the elevators to perform in-and-out tasks and the time for the shuttles to perform tasks.

[0051] S3. According to the goal of minimizing the overall operation time of all tasks in the order, the whale optimization algorithm with multi-strategy fusion is used to solve the operation sorting problem of multiple elevators and shuttles, which specifically includes the following steps:

[0052] (1) Coding:

[0053] In order to sort multiple tasks in an order and select elevators and shuttles, a three-segment coding structure based on natural number coding is designed. The first segment is the task number main coding layer, which encodes all tasks in the order with natural numbers, i.e., 1, 2, ..., T, to determine the order of all tasks in the order. The second segment is the elevator coding layer, which uses natural numbers from 1 to M to represent the elevators with corresponding numbers, and is used to select elevators for different tasks. The third segment is the shuttle coding layer, which uses natural numbers from 1 to N to represent the shuttles with corresponding numbers, and is used to select shuttles for different tasks.

[0054] (2) Initialize the population based on Tent chaos map:

[0055] Tent mapping mathematical expression:

[0056] Where: x k' ∈(0,1) is the chaos value, k' is the chaos sequence number, is the control parameter, and is set to 0.5. The specific steps are:

[0057] (a) Randomly generate m initial sequences of dimension n, where the variable value of each dimension is (0,1);

[0058] (b) Generate chaotic sequence based on Tent mapping;

[0059] (c) Map the chaotic sequence to the variable value range and finally obtain the initial population based on Tent mapping.

[0060] (3) Encoding conversion:

[0061] The solution space of the whale optimization algorithm is a continuous space, while the scheduling problem is a discrete problem. Therefore, it is necessary to map the solution of the continuous space to the discrete solution space and convert the codes of task sorting, elevator selection, and shuttle selection. The ascending order value (ROV) rule is used for task sorting, and the ascending order value (ROV) rule is used for elevator selection.

[0062] The solution space conversion of the machine and the shuttle car is carried out as follows:

[0063] Where: m(i) is the continuously encoded gene value; z(i) is the number of elevators or shuttles; u(i) is the obtained discrete gene value; δ is the upper limit of the number of elevators or shuttles.

[0064] (4) Decoding and fitness calculation:

[0065] Decode the discrete three-segment code, whose structure represents the execution order of tasks in the order, the selection of elevators and shuttles, and the tasks are matched one by one with elevators and shuttles during decoding. The total time for the elevator and shuttle to complete the operation is taken as the fitness, and the fitness (total time) is calculated using the whale optimization algorithm. The whale position update uses continuous genes, and the fitness calculation is first converted into discrete genes and decoded before calculation. The whale optimization algorithm (WOA) is divided into three stages: encirclement and prey hunting, spiral update, and prey search. In order to improve the convergence and optimization capabilities of the whale optimization algorithm, nonlinear convergence factor strategy, adaptive weight strategy, and random differential mutation strategy are introduced. The specific process is as follows: Figure 1 As shown, the three-stage update strategy model is as follows:

[0066] Encirclement and predation stage: X(t+1)=w·X p (t)-A·|C·X p (t)-X(t)|

[0067] Where: t is the current number of iterations, X p (t) is the optimal solution of the current iteration, X(t) is the position of the current whale iteration; X(t+1) is the position of the next whale iteration, A and C are coefficient vectors, w is the introduced adaptive weight strategy value, and:

[0068]

[0069] Where: max_iter is the maximum number of iterations, r1 and r2 are randomly generated numbers in [0,1]; a is a variable. As the number of iterations changes, a nonlinear convergence factor strategy is introduced. The specific relationship is as follows:

[0070]

[0071] Where: t is the current number of iterations, max_iter is the maximum number of iterations.

[0072] Spiral update phase: X(t+1)=|C·X p (t)-X(t)|·e bl ·cos(2πl)+w·X p (t)

[0073] Where: b is a constant; l is a random number between [-1,1].

[0074] In order to determine whether to execute the spiral update phase or the encirclement and predation phase, a random probability p is introduced, and the value range of p is [0,1]. Its mathematical model is:

[0075]

[0076] Prey search phase: X(t+1)=X rand (t)-A·|C·X rand (t)-X(t)|

[0077] Where: X rand is a randomly selected position vector.

[0078] In order to further improve the search ability of whale optimization, a random difference mutation strategy is introduced:

[0079] X(t+1)=r1×(X p (t)-X(t))+r2×(X'(t)-X(t))

[0080] Where r1 and r2 are random numbers in [0,1], and X'(t) is a randomly selected individual in the population.

[0081] (5) Determine the number of iterations and output the result:

[0082] Determine whether the final number of iterations reaches the set value of the whale optimization algorithm. If it reaches the set maximum number of iterations, output the minimum value of the final task time, and draw a Gantt chart based on the start time of each task shuttle and elevator. Figure 2 As shown; if the maximum number of iterations is not reached, the iteration continues.

[0083] Table 1 is a list of inbound and outbound tasks in this implementation example, where the storage system shelf specifications are 9 rows, 19 columns, and 4 layers, and the length, width, and height of each cargo space are all 1m. The system is configured with 3 elevators and 12 shuttles, with 3 shuttles distributed on each shelf. The average operating speed of the elevator is 2m / s, and the average operating speed of the shuttle is 1m / s.

[0084] Table 1 List of inbound and outbound tasks

[0085]

[0086] Based on the inbound and outbound task cargo locations and elevator location information in the order, elevator tasks are allocated. The position coordinates (x, y) of the three elevators are (0, 3), (0, 6), and (0, 9), respectively. The above scheduling case is used as the data basis for the elevator task allocation test to allocate elevator operation tasks. Table 2 shows the results of the elevator task allocation plan.

[0087] Table 2 Hoist task allocation scheme

[0088]

[0089] Based on the task set of each elevator after the in-and-out task allocation, the whale optimization algorithm with multi-strategy fusion is called to conduct a collaborative scheduling test of the elevator and the shuttle. The task scheduling algorithm results give the order and start time of the tasks performed by each elevator and shuttle, and the Gantt chart of the scheduling plan is obtained. The total time to complete all tasks is 60.5 time units.

[0090] The above examples are only used to further illustrate the technical content of the present invention, so that readers can understand it more easily, but they do not mean that the implementation of the present invention is limited to this. Any technical extension or re-creation made according to the present invention is protected by the present invention. The protection scope of the present invention shall be subject to the claims.

Claims

1. A task scheduling method for a four-way shuttle-type dense storage system, characterized in that: include: S1. Establishing a mathematical model of the execution time of the elevator task: Establishing a mathematical model of the time in which the elevator first delivers the goods to the cargo location layer where the shuttle car is located, and then delivers the goods and the shuttle car to the cargo location target layer; establishing a mathematical model of the time in which the elevator first carries the shuttle car working in coordination and then goes to the in-and-out layer to obtain the goods and delivers them to the target cargo location layer; and establishing a mathematical model of the time in which the elevator delivers the nearest idle shuttle car to the cargo location target layer during the coordinated outbound operation, and then the shuttle car goes to the target cargo location to take out the goods and then completes the outbound task through the elevator; S2. Establishing a mathematical model for the objective function expression of the execution time of the in-and-out task: Based on the mathematical model of the shuttle task execution time and the mathematical model of the elevator task execution time obtained in S1, the total execution time of the shuttle and elevator tasks in different modes is obtained respectively, and then the mathematical model of the in-and-out task execution time is obtained; S3. According to the goal of minimizing the overall warehousing and warehousing operation time of all tasks in the order, the whale optimization algorithm with multi-strategy fusion is used to solve the operation sorting problem of multiple elevators and shuttle vehicles.

2. The task scheduling method for a four-way shuttle-type intensive storage system according to claim 1 is characterized in that: The three mathematical models established by S1 are: Where t1 is the minimum call time required for the jth elevator to perform the i-th task and call the elevator collaborative operation under the working mode that the elevator first transports the goods to the cargo layer where the shuttle is located, and then transports the goods and the shuttle to the cargo target layer. V L Indicates the running speed of the elevator, D L (P j ,P lj ) represents the travel distance from the current position of the jth elevator to the storage position, D L (P lj ,P k ) represents the walking distance from the storage location of the jth elevator to the current cargo layer where the kth shuttle is located, D L (P k ,P ji ) represents the walking distance from the current cargo layer where the k-th shuttle car is located to the layer where the j-th elevator is performing the i-th task; t2 is the minimum call time required for the j-th elevator to perform the i-th task and call the shuttle car for collaborative operation under the working mode that the elevator first carries the collaborative shuttle car and then goes to the in-and-out layer to obtain the goods and transports them to the target cargo layer, V L Indicates the running speed of the elevator, D L (P j ,P k ) represents the travel distance from the current position of the jth elevator to the current cargo layer of the kth shuttle, D L (P k ,P lj ) represents the travel distance from the current cargo layer of the kth shuttle to the storage location of the jth elevator, D L (P lj ,P ji ) represents the walking distance from the level where the j-th elevator performs the i-th task to the elevator entry position; t3 is the minimum calling time required for the j-th elevator to perform the i-th task and call the shuttle for collaborative operation in the collaborative outbound operation mode, in which the nearest idle shuttle is transported to the target cargo location by the elevator, and then the shuttle takes out the goods from the target cargo location and completes the outbound task by the elevator.

3. The task scheduling method for a four-way shuttle-type intensive storage system according to claim 2 is characterized in that: in: t'1, t'2 are respectively the elevator first transports the goods to the cargo layer where the shuttle is located, and then transports the goods and the shuttle to the target cargo layer; the elevator first carries the shuttle working in coordination and then goes to the in-and-out layer to obtain the goods and transports them to the target cargo layer. After the elevator in the two modes reaches the cargo layer where the kth shuttle is located, at P k Waiting time for the location, E k(i-1) represents the time when the kth shuttle completed its previous task, D C (P C(i-1) ,P k ) represents the travel distance of the k-th shuttle from the position after the previous task is completed to the position of the j-th elevator on the floor where the k-th shuttle is located, D L (P j ,P k ) represents the travel distance from the current position of the jth elevator to the current cargo layer of the kth shuttle, D L (P j ,P ji ) represents the walking distance from the current position of the jth elevator to the layer where the i-th task target is executed, S ji represents the starting time when the jth elevator performs the i-th task, V C Indicates the running speed of the four-way shuttle, V L represents the operating speed of the elevator; t'3 is the time when the elevator transports the nearest idle shuttle to the target cargo location during the collaborative outbound operation, and then the shuttle takes out the goods from the target cargo location and completes the outbound task through the elevator. In the outbound task mode, after the elevator reaches the cargo location where the kth shuttle is located, in P k The waiting time for the location is, E k(i-1) represents the time when the kth shuttle completed its previous task, D C (P C(i-1) ,P k ) represents the travel distance of the k-th shuttle from the position after the previous task is completed to the position of the j-th elevator on the floor where the k-th shuttle is located, D L (P j ,P k ) represents the travel distance from the jth elevator to the cargo layer where the kth shuttle is currently located, S ji represents the starting time when the jth elevator performs the i-th task, V C Indicates the running speed of the four-way shuttle, V L Indicates the operating speed of the elevator.

4. The task scheduling method for a four-way shuttle-type intensive storage system according to claim 2 is characterized in that: The operation time of the elevator and shuttle car established by S2 to perform the warehousing task is: t in L ji =min(t1,t2) Among them, t in L ji ,t in C ki are the operation time of the jth elevator and the kth shuttle to complete the i-th warehousing task, D L (P k ,P ji ) represents the travel distance of the jth elevator from the current cargo layer where the kth shuttle car is located to the elevator storage position, D C (P C(i-1) ,P k ) represents the travel distance of the k-th shuttle from the position after the previous task is completed to the position of the j-th elevator on the floor where the k-th shuttle is located, D C (P k ,P ji ) represents the travel distance of the kth shuttle from the jth elevator position of the current cargo layer to the target node of the i-th task target, D L (P k ,P lj ) represents the travel distance from the current cargo layer of the kth shuttle to the storage location of the jth elevator, D L (P lj ,P ji ) represents the walking distance from the level where the j-th elevator performs the i-th task to the elevator storage position, V C Indicates the running speed of the four-way shuttle, V L Indicates the operating speed of the elevator.

5. The task scheduling method for a four-way shuttle-type intensive storage system according to claim 2 is characterized in that: The operation time of the elevator and shuttle car established by S2 to perform the outbound task is: Among them, t out L ji ,t out C ki are the operation time of the jth elevator and the kth shuttle to complete the i-th outbound task, D L (P k ,P ji ) represents the travel distance of the jth elevator from the current cargo layer of the kth shuttle to the outbound location of the i-th task elevator, D C (P j(i-1) ,P k ) represents the travel distance of the Kth shuttle from the last mission target node to the exit position of the jth elevator on the current cargo layer, D C (P ji ,P k ) represents the travel distance of the kth shuttle from the exit position of the jth elevator at the current cargo layer to the entrance node of the shelf layer where the i-th task target is executed by the jth elevator, V C Indicates the running speed of the four-way shuttle, V L Indicates the operating speed of the elevator.

6. According to the task scheduling method of the four-way shuttle-type intensive storage system of claim 1, the mathematical model of the objective function expression of the execution time of the in-and-out task specifically includes: According to the task execution time of the jth elevator, the sum of the task execution time of all elevators is obtained, and Value According to the execution time of the kth shuttle task, the sum of the execution time of all shuttle tasks is obtained, and Value t in L ji ,t in C ki are the operation time of the jth elevator and the kth shuttle to complete the i-th warehousing task; t out L ji ,t out C ki are the operating time of the jth elevator and the kth shuttle to complete the i-th outbound task; the objective function is defined as: They are the total time for all elevators and shuttle vehicles to perform tasks.

7. The task scheduling method for a four-way shuttle-type intensive storage system according to claim 1 is characterized in that: S3 specifically includes: (1) Coding: The first section is the main coding layer for the task number; the second section is the elevator coding layer; the third section is the shuttle coding layer; (2) Initialize the population based on Tent chaotic map; (3) Code conversion: Convert the codes of task sorting, elevator selection, and shuttle selection to obtain discrete gene values; (4) Decoding and fitness calculation: Decode the discrete three-segment code, take the total time for the elevator and shuttle to complete the operation as the fitness, and use the whale optimization algorithm to calculate the fitness; (5) Determine the number of iterations and output the results: By determining whether the final number of iterations reaches the set value of the whale optimization algorithm, the task list of the elevator and the shuttle car is obtained.

8. The task scheduling method for a four-way shuttle-type intensive storage system according to claim 7 is characterized in that: Encoding conversion includes: For the solution space conversion of the elevator and shuttle car, the following method is used: Where: m(i) is the continuously encoded gene value; z(i) is the number of elevators or shuttles; u(i) is the obtained discrete gene value; δ is the upper limit of the number of elevators or shuttles.

9. The task scheduling method for a four-way shuttle-type intensive storage system according to claim 7 is characterized in that: Determine the number of iterations and output the results including: Determine whether the final number of iterations reaches the set value of the whale optimization algorithm. If it reaches the set maximum number of iterations, output the minimum value of the final task time, and draw a Gantt chart based on the start time of each task shuttle and elevator; if it does not reach the set maximum number of iterations, continue to iterate.

Citation Information

Patent Citations

  • Task scheduling method of multilayer shuttle vehicle automatic warehousing system

    CN103955818A

  • Task scheduling method of cross-layer cross-lane shuttle vehicle storage system

    CN111674795A

  • Configuration scheme and task scheduling method for multiple elevators of three-dimensional warehouse

    CN112070412A

  • Fault early warning method for double-fed fan main shaft

    CN112734130A

  • Three-dimensional movement mechanism for six-directional shuttle bus and stereoscopic storage rack

    CN113291726A

Cited By

  • Multi-team collaborative job scheduling method and system based on improved whale optimization algorithm

    CN120746247A

  • Multi-shift team collaborative job scheduling method and system based on improved whale optimization algorithm

    CN120746247B