Multi-AGV optimal energy saving control scheduling method and system and storage medium
By using the combination of grid grid diagram model, particle swarm and simulated annealing algorithm in the intelligent storage system, the problems of high energy consumption and low efficiency of multi-AGV are solved, and the optimal energy control scheduling of multi-AGV is achieved, reaching 15% energy saving and efficiency improvement.
Patent Information
- Application Number
- CN202411518899.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-10-29
- Publication Date
- 2024-11-26
- Estimated Expiration
- Not applicable · inactive patent
Smart Images

Figure CN119026781A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of intelligent manufacturing, and the present invention relates to a multi-AGV optimal energy conservation and scheduling method, system and storage medium. Background Art
[0002] Traditional warehousing systems usually use a combination of mechanical transmission and manpower. On the one hand, they have high energy consumption and high costs, which are not in line with the current national strategy of green development. On the other hand, they are inefficient and have a high error rate, which is not suitable for future development trends. With the development of electronic information, artificial intelligence and other technologies, intelligent technologies such as robots and AGVs have been rapidly applied and developed in the field of warehousing and logistics, which have improved logistics efficiency to a certain extent. However, there are still problems such as low intelligence and poor flexibility and adaptability. Therefore, intelligent warehousing still has great development prospects in the future, and many problems need to be further studied. Due to the complexity of the workshop environment, timely material transportation is the key to ensure the smooth progress of production. Therefore, the use of computer intelligence methods to realize intelligent warehousing scheduling has become one of the current research hotspots. Summary of the invention
[0003] The purpose of the present invention is to provide a multi-AGV optimal energy saving scheduling method, system and storage medium. Aiming at the optimal energy saving scheduling problem of multiple AGVs in an intelligent warehousing system, the present invention first uses a grid network diagram to model the intelligent warehousing system, designs an optimization objective function for the optimal energy saving scheduling, and designs an intelligent optimization method that integrates a particle swarm algorithm and a simulated annealing algorithm, thereby improving the deficiency of the particle swarm algorithm that is prone to falling into a local optimal solution, realizing the optimal energy saving scheduling of multiple AGVs in intelligent warehousing, saving energy and improving efficiency.
[0004] The technical solution to achieve the purpose of the present invention is: A multi-AGV optimal energy conservation and scheduling method comprises the following steps: S01: constructing a target optimization function according to the optimization goal, wherein the optimization goal is to shorten the path of multiple AGVs as a whole when transporting products of the same weight within the same time; S02: Improve the particle swarm algorithm through simulated annealing algorithm, including: S21: Initialize the particle swarm algorithm and simulated annealing algorithm, update the position and velocity of particles in the particle swarm algorithm, and calculate the value of the target optimization function; S22: Calculate the difference between the target optimization function value of the particles obtained in the previous iteration. If the difference is less than 0, accept the current particle swarm iteration result; if the difference is not less than 0, iteratively calculate the temperature value of the simulated annealing algorithm, calculate the probability value according to the temperature value of the simulated annealing algorithm, decide whether to accept the current particle swarm iteration result according to the probability value, and update the global optimal value; S23: If the maximum number of iterations or the set target is reached, the iteration process ends and the corresponding optimization result is obtained.
[0005] In the preferred technical solution, the target optimization function is: , in, , are the coefficients, , For products, , are the indexes of products and AGVs respectively, is the total quantity of products that need to be shipped, is the total number of AGVs involved in transportation, , are the total number of products and AGVs respectively, Indicates the weight of the product. Indicates the path that the AGV runs. is the path length, Represents the index of a path. Indicates the running time of AGV on a path.
[0006] In the preferred technical solution, the path length The calculation formula is: , in, Indicated on two shelves , The path nodes between them, S is the shelf set, Represents the index of the path node, The bi-norm represents the distance between two shelves.
[0007] In the preferred technical solution, the method of initializing the particle swarm algorithm and the simulated annealing algorithm in step S21 includes: Particle initialization is performed based on Sine chaotic mapping, and the iterative calculation formula is:
[0008] in, is the iterative sequence value, is the number of iterations, is the system parameter.
[0009] In the preferred technical solution, the method for calculating the temperature value of the simulated annealing algorithm in step S22 includes: Set the initial temperature of the simulated annealing algorithm : , in, is the number of shelves, Indicates two shelves , The minimum distance between , is the index of the shelf; The updated calculation formula of the simulated annealing algorithm temperature is:
[0010] in, is the temperature attenuation coefficient, is the number of iterations.
[0011] In the preferred technical solution, the temperature attenuation coefficient calculation function of the simulated annealing algorithm is: .
[0012] in, is the control coefficient, is the number of iterations, is the minimum attenuation parameter.
[0013] In the preferred technical solution, the probability in step S22 is The calculation formula is: , in, is the algorithm iteration number, is the fitness difference of particles after two consecutive iterations of the particle swarm algorithm, is the temperature of the simulated annealing algorithm.
[0014] The present invention also discloses a multi-AGV optimal energy conservation and scheduling system, comprising: A target optimization function construction module is used to construct a target optimization function according to an optimization target, wherein the optimization target is to transport products of the same weight within the same time, and the path of multiple AGVs as a whole is as short as possible; The optimization module based on the hybrid algorithm of particle swarm and simulated annealing improves the particle swarm algorithm through the simulated annealing algorithm, including: S21: Initialize the particle swarm algorithm and simulated annealing algorithm, update the position and velocity of particles in the particle swarm algorithm, and calculate the value of the target optimization function; S22: Calculate the difference between the target optimization function value of the particles obtained in the previous iteration. If the difference is less than 0, accept the current particle swarm iteration result; if the difference is not less than 0, iteratively calculate the temperature value of the simulated annealing algorithm, calculate the probability value according to the temperature value of the simulated annealing algorithm, decide whether to accept the current particle swarm iteration result according to the probability value, and update the global optimal value; S23: If the maximum number of iterations or the set target is reached, the iteration process ends and the corresponding optimization result is obtained.
[0015] In the preferred technical solution, the target optimization function is: .
[0016] in, , are coefficients, , For products, , are the indexes of products and AGVs respectively, is the total quantity of products that need to be transported, is the total number of AGVs involved in transportation, , are the total number of products and AGVs respectively, Indicates the weight of the product. Indicates the path that the AGV runs. is the path length, Represents the index of a path. Indicates the running time of AGV on a path.
[0017] The present invention further discloses a computer storage medium on which a computer program is stored. When the computer program is executed, the above-mentioned multi-AGV optimal energy conservation and scheduling method is implemented.
[0018] Compared with the prior art, the present invention has the following significant advantages: Aiming at the optimal energy-saving scheduling of multiple AGVs in intelligent warehousing systems, the present invention first uses a grid diagram to model the intelligent warehousing system, designs an optimization objective function for the optimal energy-saving scheduling, and designs an intelligent optimization method that integrates particle swarm and simulated annealing algorithms. This improves the deficiency of the particle swarm algorithm that is prone to falling into local optimal solutions, and ultimately realizes the optimal energy-saving scheduling of multiple AGVs in intelligent warehousing, achieving the purpose of saving energy and improving efficiency. It has a broad application market space and economic value. BRIEF DESCRIPTION OF THE DRAWINGS
[0019] Figure 1 This is a flow chart of the multi-AGV optimal energy conservation and scheduling method of this embodiment; Figure 2 This is the warehouse layout grid diagram of this embodiment; Figure 3 This is the distribution diagram of the Sine chaotic map in this embodiment; Figure 4 is the image of the temperature decay function of this embodiment ( , ); Figure 5 This is the improved particle swarm algorithm workflow diagram of this embodiment; Figure 6 This is a comparison of the energy saving and scheduling experiments of multiple AGVs in the intelligent warehousing of this embodiment. DETAILED DESCRIPTION
[0020] The principle of the present invention is as follows: the present invention first uses a grid network diagram to model the intelligent warehousing system, designs an optimization objective function for optimal energy saving scheduling, and designs an intelligent optimization method that integrates particle swarm and simulated annealing algorithms, improves the deficiency of the particle swarm algorithm that is prone to fall into local optimal solutions, and finally realizes the optimal energy saving scheduling of multiple AGVs in intelligent warehousing, achieving the purpose of saving energy and improving efficiency.
[0021] Embodiment 1:
[0022] like Figure 1 As shown, a multi-AGV optimal energy conservation scheduling method includes the following steps: S01: constructing a target optimization function according to the optimization goal, wherein the optimization goal is to shorten the path of multiple AGVs as a whole when transporting products of the same weight within the same time; S02: Improve the particle swarm algorithm through simulated annealing algorithm, including: S21: Initialize the particle swarm algorithm and simulated annealing algorithm, update the position and velocity of particles in the particle swarm algorithm, and calculate the value of the target optimization function; S22: Calculate the difference between the target optimization function value of the particles obtained in the previous iteration. If the difference is less than 0, accept the current particle swarm iteration result; if the difference is not less than 0, iteratively calculate the temperature value of the simulated annealing algorithm, calculate the probability value according to the temperature value of the simulated annealing algorithm, decide whether to accept the current particle swarm iteration result according to the probability value, and update the global optimal value; S23: If the maximum number of iterations or the set target is reached, the iteration process ends and the corresponding optimization result is obtained.
[0023] In a preferred embodiment, the objective optimization function is: , in, , are coefficients, , For products, , are the indexes of products and AGVs respectively, is the total quantity of products that need to be shipped, is the total number of AGVs involved in transportation, , are the total number of products and AGVs respectively, Indicates the weight of the product. Indicates the path that the AGV runs. is the path length, Represents the index of a path. Indicates the running time of AGV on a path.
[0024] In a preferred embodiment, the path length The calculation formula is:
[0025] in, Indicated on two shelves , The path nodes between them, S is the shelf set, Represents the index of the path node, The bi-norm represents the distance between two shelves.
[0026] In a preferred embodiment, the method of initializing the particle swarm algorithm and the simulated annealing algorithm in step S21 includes: Particle initialization is performed based on Sine chaotic mapping, and the iterative calculation formula is: , in, is the iterative sequence value, is the number of iterations, is the system parameter.
[0027] In a preferred embodiment, the method for calculating the temperature value of the simulated annealing algorithm in step S22 includes: Set the initial temperature of the simulated annealing algorithm: , in, is the number of shelves, Indicates two shelves , The minimum distance between , is the index of the shelf; The updated calculation formula of the simulated annealing algorithm temperature is: , in, is the temperature attenuation coefficient, is the number of iterations.
[0028] In a preferred embodiment, the temperature attenuation coefficient calculation function of the simulated annealing algorithm is: , in, is the control coefficient, is the number of iterations, is the minimum attenuation parameter.
[0029] In a preferred embodiment, the probability in step S22 is The calculation formula is: , in, is the algorithm iteration number, is the fitness difference of particles after two consecutive iterations of the particle swarm algorithm, is the temperature of the simulated annealing algorithm.
[0030] In another embodiment, a computer storage medium stores a computer program, which implements the above-mentioned multi-AGV optimal energy conservation and scheduling method when executed.
[0031] The specific optimization method adopts the above-mentioned multi-AGV optimal energy conservation and scheduling method, which will not be repeated here.
[0032] In another embodiment, a multi-AGV optimal energy conservation and scheduling system includes: A target optimization function construction module is used to construct a target optimization function according to an optimization target, wherein the optimization target is to transport products of the same weight within the same time, and the path of multiple AGVs as a whole is as short as possible; The optimization module based on the hybrid algorithm of particle swarm and simulated annealing improves the particle swarm algorithm through the simulated annealing algorithm, including: S21: Initialize the particle swarm algorithm and simulated annealing algorithm, update the position and velocity of particles in the particle swarm algorithm, and calculate the value of the target optimization function; S22: Calculate the difference between the target optimization function value of the particles obtained in the previous iteration. If the difference is less than 0, accept the current particle swarm iteration result; if the difference is not less than 0, iteratively calculate the temperature value of the simulated annealing algorithm, calculate the probability value according to the temperature value of the simulated annealing algorithm, decide whether to accept the current particle swarm iteration result according to the probability value, and update the global optimal value; S23: If the maximum number of iterations or the set target is reached, the iteration process ends and the corresponding optimization result is obtained.
[0033] Specifically, the workflow of the multi-AGV optimal energy conservation and scheduling system is described below by taking a preferred embodiment as an example, which specifically includes the following steps: Step 1: Establish a multi-AGV scheduling problem model for intelligent warehousing.
[0034] As a safe and efficient intelligent transportation equipment, Automated Guided Vehicle (AGV) has been widely used in warehouses, workshops, etc. How to efficiently and scientifically dispatch AGVs is a very important issue in intelligent warehousing systems. In intelligent warehousing systems, the objects to be dispatched usually include products, AGVs, shelves, etc. In order to achieve efficient AGV dispatching, the present invention first establishes an intelligent warehousing multi-AGV dispatching model.
[0035] Define the product set as AGV set , the shelf is , , , are the number of products, AGVs, and shelves respectively. The multi-AGV scheduling work in intelligent warehousing can be described as the process in which AGV moves a certain product from one shelf to another according to the scheduling instructions. According to the above description, the path of an AGV when working It can be expressed as: (1), The above formula shows that AGV is on two shelves , Shipping products between process, in which , are the indexes of products and AGVs respectively, , The index of the shelf. length The calculation formula is as follows: (2), in Indicated on two shelves , The path nodes between Represents the index of the path node, The bi-norm represents the distance between two shelves.
[0036] The layout of a warehouse can be represented using a grid diagram, such as Figure 2 As shown, the rectangle in the figure represents the shelf, and the solid line in the example represents two shelves. , The warehouse can be abstracted into an area composed of grids, and the grids can be used to represent the nodes on the path.
[0037] Due to the complexity of multi-AGV scheduling in intelligent warehousing systems, it is necessary to select appropriate indicators as optimization targets based on the characteristics of the scheduling problem. The present invention aims to construct an optimal energy-saving scheduling method, which requires that the shorter the path of multi-AGV as a whole is, the shorter the weight of the product is. This problem can be converted into the case that the more weight of the product is carried per unit time and per unit distance, the less energy is consumed. Therefore, the present invention establishes an optimization objective function, as shown in formula (3).
[0038] (3), Formula (3) consists of two parts. The first part is the energy conservation scheduling optimization, and the second part is the total operation time optimization. , are the coefficients of the two parts, , For products, is the index of the product, is the total quantity of products that need to be transported, is the total number of AGVs involved in transportation, , are the total number of products and AGVs respectively, Indicates the weight of the product. Indicates the path that the AGV runs. is the path length, Represents the index of a path. represents the running time of AGV on a path. The above formula is a multi-objective optimization function, which can be obtained by , The direction of control optimization is energy saving priority and running time priority.
[0039] Step 2: Optimization based on the hybrid algorithm of particle swarm and simulated annealing.
[0040] The particle swarm algorithm is an intelligent algorithm designed by simulating the predation behavior of bird flocks. It searches in the solution space by setting multiple particles. Each particle is affected by other particles during the search process. These particles have the ability to remember the optimal solution they have experienced. As the calculation evolves, the particles will eventually converge at an optimal point. The mathematical description of the standard particle swarm algorithm is shown in formula (4).
[0041] (4)
[0042] in represents the number of iterations, is the inertia weight, is the particle index, is the index of a dimension in the particle, is the particle velocity vector, Indicates Particle dimensional velocity vector, is the individual learning factor, is the group learning factor, , Is the interval The random number in is used to increase the randomness of the search. Indicates Particle The historical best position found by the search, represents the optimal position in the entire particle group, No. Particle Wei Zai The position at the iteration. In each iteration, the inertia weight and the particle position are updated using the following formula: (5), in , denote the maximum and minimum inertia weights, respectively, Indicates the maximum number of iterations.
[0043] The simulated annealing algorithm is derived from the solid annealing principle in physics. During the physical annealing process, when the temperature of the solid is very high, the internal energy is large, and the particles inside the solid are in a disordered motion state. When the temperature slowly decreases, the internal energy of the solid decreases, and the movement of the particles tends to be orderly. If the temperature decreases slowly enough, the particles will maintain a state of equilibrium at each temperature. Finally, when the solid is at room temperature, the internal energy reaches a minimum, and the particles are most stable at this time. The simulated annealing algorithm starts from the initial temperature. As the temperature decreases, the solution of the objective function tends to be stable. However, this stable solution may be a local optimal solution. Therefore, when a poor solution is reached, the algorithm will accept the poor solution with a certain probability, thereby jumping out of the local optimal solution to find the global optimal solution of the objective function.
[0044] The standard particle swarm algorithm has defects such as poor local search ability and easy to fall into local extreme values. To solve this problem, the present invention integrates the particle swarm algorithm with the simulated annealing algorithm according to the characteristics of the intelligent warehousing multi-AGV system: Step 21: Particle initialization based on Sine chaos map Chaotic mapping is used to generate chaotic sequences, Sine chaotic mapping, and its iterative calculation formula is: (6), in, is the iterative sequence value, is the number of iterations, is the system parameter. Figure 3 The figure shows the distribution diagram of Sine chaotic mapping, from which we can see that it has good randomness, so it is conducive to the generation of initial particles of the particle swarm algorithm and achieves better results.
[0045] Step 22: Improve the particle swarm algorithm using simulated annealing algorithm The present invention improves the particle swarm algorithm through a simulated annealing algorithm. The workflow of the improved algorithm is as follows: first, the particle swarm algorithm and the simulated annealing algorithm are initialized, and then the particle position, speed and other properties are updated in the particle swarm algorithm, the target optimization function value is calculated, and then the difference in the target optimization function value between the particles obtained in the previous iteration is calculated. If the difference is less than 0, the current particle swarm iteration result is accepted; if the difference is not less than 0, the temperature value of the simulated annealing algorithm is iteratively calculated, and the probability value is calculated based on the temperature value of the simulated annealing algorithm. According to the probability value, it is decided whether to accept the current particle swarm iteration result, and the global optimal value is updated. If the maximum number of iterations is reached or the target is set, the iterative process ends and the corresponding optimization result is obtained. The workflow of the improved particle swarm algorithm is as follows: Figure 5 shown.
[0046] The simulated annealing algorithm is derived from the solid annealing principle in physics. During the physical annealing process, as the temperature slowly decreases, the movement of solid particles tends to be orderly. Finally, when the solid is at room temperature, the internal energy reaches the minimum, and the particles are most stable at this time. The simulated annealing algorithm can accept a poor solution with a certain probability, thereby jumping out of the local optimal solution, so it can suppress the shortcomings of the particle swarm algorithm in terms of convergence accuracy and easy to fall into local oscillation.
[0047] According to the analysis of the multi-AGV product transportation process in the intelligent warehousing system, the initial temperature of the simulated annealing algorithm is set As shown in formula (7), is the number of shelves, Indicates the minimum distance between two shelves. , The index of the shelf.
[0048] (7), The updated calculation of the simulated annealing algorithm temperature is shown in formula (8).
[0049] (8), in is the temperature attenuation coefficient, is the number of iterations.
[0050] At the same time, according to the characteristics of the intelligent storage system and the long-term experimental results, the temperature attenuation coefficient calculation function of the simulated annealing algorithm is set as shown in the following formula, where is the control coefficient, is the number of iterations, is the minimum attenuation parameter. According to the experimental results, The value range is , The value range is can achieve better results, Figure 4 Shown , The graph of the temperature decay function.
[0051] (9), In order to escape from the local optimal solution, the simulated annealing algorithm will Accept the worse solution, probability The calculation of is shown in formula (10), where is the algorithm iteration number, is the fitness difference of particles after two consecutive iterations of the particle swarm algorithm.
[0052] (10), Step 23: Acquire the locations of multiple AGVs in smart warehousing.
[0053] In order to complete the transportation of multiple AGVs in the intelligent warehousing system, it is necessary to be able to obtain the real-time position, speed and other information of each AGV, so multiple systems need to be used in conjunction. The present invention can obtain the status information of AGVs in real time from systems such as MES, ERP, cloud computing, and edge computing, complete the iterative optimization of the algorithm, and thus complete the multi-AGV system multi-intelligent scheduling, achieving the purpose of energy saving and efficiency improvement.
[0054] The improved particle swarm algorithm was experimented and compared with the traditional algorithm and the standard particle swarm algorithm. The results are as follows: Figure 6 As shown, it can be seen that the improved particle swarm algorithm in the present invention has a faster convergence speed and better scheduling results, and can effectively prevent the algorithm from falling into a local optimal solution. According to calculations, the present invention can effectively save the energy consumption of multiple AGV systems because of the combined effect of the targeted energy saving scheduling function and the improved intelligent optimization algorithm. Through simulation, it is found that the average saving rate can reach about 15%, which effectively improves the energy saving effect.
[0055] The above embodiments are preferred implementation modes of the present invention, but the implementation modes of the present invention are not limited to the above embodiments. Any other changes, modifications, substitutions, combinations, and simplifications made without departing from the spirit and principles of the present invention shall be equivalent replacement modes and shall be included in the protection scope of the present invention.
Claims
1. A multi-AGV optimal energy conservation and scheduling method, characterized in that: The following steps are involved: S01: constructing a target optimization function according to the optimization goal, wherein the optimization goal is to shorten the path of multiple AGVs as a whole when transporting products of the same weight within the same time; S02: Improve the particle swarm algorithm through simulated annealing algorithm, including: S21: Initialize the particle swarm algorithm and simulated annealing algorithm, update the position and velocity of particles in the particle swarm algorithm, and calculate the value of the target optimization function; S22: Calculate the difference between the target optimization function value of the particles obtained in the previous iteration. If the difference is less than 0, accept the current particle swarm iteration result; if the difference is not less than 0, iteratively calculate the temperature value of the simulated annealing algorithm, calculate the probability value according to the temperature value of the simulated annealing algorithm, decide whether to accept the current particle swarm iteration result according to the probability value, and update the global optimal value; S23: If the maximum number of iterations or the set target is reached, the iteration process ends and the corresponding optimization result is obtained.
2. The multi-AGV optimal energy conservation and scheduling method according to claim 1 is characterized in that: The objective optimization function is: , in, , are coefficients, , For products, , are the indexes of products and AGVs respectively, is the total quantity of products that need to be transported, is the total number of AGVs involved in transportation, , are the total number of products and AGVs respectively, Indicates the weight of the product. Indicates the path that the AGV runs. is the path length, Represents the index of a path, Indicates the running time of AGV on a path.
3. The multi-AGV optimal energy conservation and scheduling method according to claim 2 is characterized in that: path length The calculation formula is: , in, Indicated on two shelves , The path nodes between them, S is the shelf set, Represents the index of the path node, The bi-norm represents the distance between two shelves.
4. The multi-AGV optimal energy conservation and scheduling method according to claim 1 is characterized in that: The method of initializing the particle swarm algorithm and the simulated annealing algorithm in step S21 includes: Particle initialization is performed based on Sine chaotic mapping, and the iterative calculation formula is: , in, is the iterative sequence value, is the number of iterations, is the system parameter.
5. The multi-AGV optimal energy conservation and scheduling method according to claim 1 is characterized in that: The method for calculating the temperature value of the simulated annealing algorithm in step S22 includes: Set the initial temperature of the simulated annealing algorithm : , in, is the number of shelves, Indicates two shelves , The minimum distance between , is the index of the shelf; The updated calculation formula of the simulated annealing algorithm temperature is: , in, is the temperature attenuation coefficient, is the number of iterations.
6. The multi-AGV optimal energy conservation and scheduling method according to claim 5 is characterized in that: The calculation function of the temperature attenuation coefficient of the simulated annealing algorithm is: , in, is the control coefficient, is the number of iterations, is the minimum attenuation parameter.
7. The multi-AGV optimal energy conservation and scheduling method according to claim 1 is characterized in that: In step S22, the probability The calculation formula is: , in, is the algorithm iteration number, is the fitness difference of particles after two consecutive iterations of the particle swarm algorithm, is the temperature of the simulated annealing algorithm.
8. A multi-AGV optimal energy conservation and scheduling system, characterized in that: include: A target optimization function construction module is used to construct a target optimization function according to an optimization target, wherein the optimization target is to transport products of the same weight within the same time, and the path of multiple AGVs as a whole is as short as possible; The optimization module based on the hybrid algorithm of particle swarm and simulated annealing improves the particle swarm algorithm through the simulated annealing algorithm, including: S21: Initialize the particle swarm algorithm and simulated annealing algorithm, update the position and velocity of particles in the particle swarm algorithm, and calculate the value of the target optimization function; S22: Calculate the difference between the target optimization function value of the particles obtained in the previous iteration. If the difference is less than 0, accept the current particle swarm iteration result; if the difference is not less than 0, iteratively calculate the temperature value of the simulated annealing algorithm, calculate the probability value according to the temperature value of the simulated annealing algorithm, decide whether to accept the current particle swarm iteration result according to the probability value, and update the global optimal value; S23: If the maximum number of iterations or the set target is reached, the iteration process ends and the corresponding optimization result is obtained.
9. The multi-AGV optimal energy conservation and scheduling system according to claim 8 is characterized in that: The objective optimization function is: , in, , are coefficients, , For products, , are the indexes of products and AGVs respectively, is the total quantity of products that need to be transported, is the total number of AGVs involved in transportation, , are the total number of products and AGVs respectively, Indicates the weight of the product. Indicates the path that the AGV runs. is the path length, Represents the index of a path, Indicates the running time of AGV on a path.
10. A computer storage medium having a computer program stored thereon, characterized in that: When the computer program is executed, the multi-AGV optimal energy conservation and scheduling method described in any one of claims 1-7 is implemented.
Citation Information
Patent Citations
AGV optimization scheduling method based on simulated annealing particle swarm
CN104331749A
Improved quantum-behaved particle swarm optimization algorithm-based multi-region economic dispatch method
CN105976052A
Method and system for optimally dispatching cascade reservoirs on basis of quantum-behaved particle swarm algorithms
CN106355292A
AGV scheduling method based on ant colony and genetic algorithm
CN111860754A
Multi-AGV task allocation method based on improved particle swarm optimization
CN114240076A
Cited By
Data security intelligent protection method and device based on deep learning
CN121077722A
