Turbine blade assembly sequence optimization method, device, equipment, medium and product

Abstract

The embodiment of the invention provides an assembly sequence optimization method, device and equipment for turbine blades, a medium and a product, and relates to the technical field of engines. The method comprises the steps that the engine rotating speed, the assembling radius and blade information of a blade to be assembled are obtained; wherein the blade information comprises the blade number, the blade mass of each blade to be assembled and the blade number of each blade to be assembled; if the number of the blades is an even number, constructing a first initial blade sequence for the to-be-assembled blades according to the sequence of the weights of the blades from light to heavy; constructing a first initial assembly sequence based on the first initial blade sequence and the blade information; and the first initial assembly sequence is optimized based on a random sequence, the engine rotating speed, the assembly radius and the blade information, and a first optimal assembly sequence is obtained. The resultant force of centrifugal force generated when the whole turbine blade rotates is minimum, and the stability and reliability of turbine operation are effectively improved.

Description

Technical Field

[0001] The embodiments of the present invention relate to the field of engine technology, and more specifically, the embodiments of the present invention relate to a method, apparatus, equipment, medium and product for optimizing the assembly sequence of turbine blades. Background Technology

[0002] Small aero engines are characterized by their small size and high rotational speed. Therefore, the blades of their compressors or turbines generate very large centrifugal forces when rotating. In theoretical design, each blade is usually assumed to have the same weight, so the net centrifugal force generated by the blades when the disk is full is theoretically zero. However, due to errors in the blade manufacturing process, each blade will have slight deviations in weight and shape. When all the installed blades are unevenly weighted within a certain range, the centrifugal force generated at high speed will intensify rotor vibration. If the vibration is very severe, it can lead to rubbing and blade breakage. Therefore, sorting blades of different weights during assembly is a crucial step before final assembly. For a disk with n blades, there are n! possible arrangements of the blades. Considering removing duplicate circular arrangements, there are still (n-1)! For small aero engines, a single-stage rotor can typically accommodate more than 20 blades, resulting in trillions of possible blade arrangements. Therefore, it is necessary to find a suitable method to quickly arrange the blades of a single-stage rotor according to their weight to minimize the resultant centrifugal force generated during rotation. Summary of the Invention

[0003] In this context, embodiments of the present invention aim to provide a method, apparatus, device, medium, and product for optimizing the assembly sequence of turbine blades.

[0004] In a first aspect of the present invention, a method for optimizing the assembly sequence of turbine blades is provided, comprising: The engine speed, assembly radius, and blade information of the blades to be assembled are obtained; wherein, the blade information includes the number of blades, the blade mass of each blade to be assembled, and the blade number of each blade to be assembled. If the number of blades is even, the blades to be assembled are arranged in order of increasing weight to form a first initial blade sequence. Based on the first initial blade sequence and the blade information, a first initial assembly sequence is constructed; The first initial assembly sequence is optimized based on the random number sequence, the engine speed, the assembly radius, and the blade information to obtain the first optimal assembly sequence.

[0005] In one embodiment of this implementation, the method further includes: If the number of blades is odd, then determine the average mass of the blades to be assembled; Determine the absolute value of the mass difference between the mass of each blade to be assembled and the average mass; The blade to be assembled corresponding to the absolute value of the smallest mass difference is determined as the first blade to be assembled. The blades to be assembled, other than the first blade to be assembled, are designated as the second blade to be assembled. The second initial blade sequence is constructed by arranging the blades to be assembled in order of increasing blade mass; Based on the second initial blade sequence, the blade information, and the first blade to be assembled, a second initial assembly sequence is constructed; wherein, the first blade to be assembled is the first blade to be assembled in the second initial assembly sequence; The second initial assembly sequence is optimized based on the random number sequence, the engine speed, the assembly radius, and the blade information to obtain the second optimal assembly sequence; wherein the first blade to be assembled is the first blade to be assembled in the second optimal assembly sequence.

[0006] In one embodiment of this implementation, constructing the first initial assembly sequence based on the first initial blade sequence and the blade information includes: Two target blades to be assembled in the first initial blade sequence are moved to the pre-constructed first initial assembly sequence; wherein the blade mass of any one of the target blades to be assembled is greater than the blade mass of the remaining blades to be assembled in the first initial blade sequence. Determine whether the first initial blade sequence is an empty sequence, and obtain the determination result; If the judgment result indicates that the first initial blade sequence is an empty sequence, then the current first initial assembly sequence is determined as the final first initial assembly sequence; If the judgment result indicates that the first initial blade sequence is not an empty sequence, then the first and second adjusted blades to be assembled are taken from the first initial blade sequence; and the first and second adjusted blades to be assembled are added to the first initial assembly sequence to obtain the current first initial assembly sequence; and the step of judging whether the first initial blade sequence is an empty sequence and obtaining the judgment result is performed. Wherein, the blade mass of the first adjusted blade to be assembled is greater than the blade mass of the remaining blades to be assembled in the first initial blade sequence, the blade mass of the second adjusted blade to be assembled is greater than the blade mass of the remaining blades to be assembled in the first initial blade sequence, and the blade mass of the first adjusted blade to be assembled is greater than the blade mass of the second adjusted blade to be assembled.

[0007] In one embodiment of this implementation, adding the first and second blades to be adjusted and assembled to the first initial assembly sequence to obtain the current first initial assembly sequence includes: The first initial assembly sequence is divided into a first initial assembly subsequence and a second initial assembly subsequence; wherein the number of blades in the first initial assembly subsequence and the number of blades in the second initial assembly subsequence are the same, the first initial assembly subsequence is the first half of the first initial assembly sequence, and the second initial assembly subsequence is the second half of the first initial assembly sequence. Determine the total mass of the first blades to be assembled in the first initial assembly sub-sequence; Determine the total mass of the second blades of the blades to be assembled contained in the second initial assembly sub-sequence; The total mass of the first blade is compared with the total mass of the second blade to obtain the mass comparison result; If the quality comparison result indicates that the total mass of the first blade is the same as the total mass of the second blade, then the blades to be assembled in the first initial assembly sub-sequence and the blades to be assembled in the second initial assembly sub-sequence are adjusted to obtain the adjusted first initial assembly sub-sequence and second initial assembly sub-sequence; and the steps from determining the total mass of the first blades to be assembled in the first initial assembly sub-sequence to comparing the total mass of the first blade with the total mass of the second blade to obtain the quality comparison result are executed. If the mass comparison result indicates that the total mass of the first blade is greater than the total mass of the second blade, then the first blade to be adjusted and assembled is added to the middle position of the first initial assembly sequence, and the second blade to be adjusted and assembled is added to the beginning position of the first initial assembly sequence to obtain the current first initial assembly sequence. If the quality comparison result indicates that the total mass of the first blade is less than the total mass of the second blade, then the first blade to be adjusted and assembled is added to the middle position of the first initial assembly sequence, and the second blade to be adjusted and assembled is added to the end of the first initial assembly sequence to obtain the current first initial assembly sequence.

[0008] In one embodiment of this implementation, adjusting the blades to be assembled in the first initial assembly sub-sequence and the blades to be assembled in the second initial assembly sub-sequence to obtain adjusted first and second initial assembly sub-sequences includes: The first blade to be assembled in the first initial assembly sub-sequence is moved to the end of the second initial assembly sub-sequence, and the first blade to be assembled in the second initial assembly sub-sequence is moved to the end of the first initial assembly sub-sequence, thus obtaining the adjusted first initial assembly sub-sequence and second initial assembly sub-sequence.

[0009] In one embodiment of this implementation, optimizing the first initial assembly sequence based on a random number sequence, the engine speed, the assembly radius, and the blade information to obtain a first optimal assembly sequence includes: Randomly generate the number of optimization attempts; Based on the number of optimizations, a random number sequence is generated; wherein the number of random elements contained in the random number sequence is the same as the number of optimizations, and each random element contained in the random number sequence corresponds to a blade to be assembled in the first initial assembly sequence; The optimal centrifugal force resultant force for the first initial assembly sequence is determined based on the engine speed, the assembly radius, and the blade information. Determine whether there are any unextracted random elements in the random number sequence, and obtain the element determination result; If the element judgment result indicates that there are no unextracted random elements in the random number sequence, then the current first initial assembly sequence is determined as the first optimal assembly sequence. If the element determination result indicates that there is an unextracted random element in the random number sequence, then an unextracted random element is extracted from the random number sequence, and a first target blade to be assembled corresponding to the unextracted random element is determined from the first initial assembly sequence, and a second target blade to be assembled corresponding to the first target blade to be assembled is determined from the first initial assembly sequence; wherein, a preset number of blades to be assembled are spaced apart between the first target blade to be assembled and the second target blade to be assembled. The first target blade to be assembled is swapped with the second target blade to be assembled to obtain the current first initial assembly sequence; The current centrifugal force resultant force of the current first initial assembly sequence is determined based on the engine speed, the assembly radius, and the blade information. If the current centrifugal force is less than or equal to the optimal centrifugal force, then the optimal centrifugal force is updated to the current centrifugal force, and the step of determining whether there are any unextracted random elements in the random number sequence is executed to obtain the element determination result. If the current centrifugal force is greater than the optimal centrifugal force, then the step of determining whether there are any unextracted random elements in the random sequence and obtaining the element determination result is performed.

[0010] In a second aspect of the present invention, a turbine blade assembly sequence optimization apparatus is provided, comprising: The acquisition unit is used to acquire engine speed, assembly radius, and blade information of the blade to be assembled; wherein, the blade information includes the number of blades, the blade mass of each blade to be assembled, and the blade number of each blade to be assembled. The first building unit is used to build a first initial blade sequence by assembling the blades to be assembled in order of blade weight from lightest to heaviest if the number of blades is even. The second construction unit is used to construct a first initial assembly sequence based on the first initial blade sequence and the blade information; An optimization unit is used to optimize the first initial assembly sequence based on a random number sequence, the engine speed, the assembly radius, and the blade information to obtain a first optimal assembly sequence.

[0011] In a third aspect of the present invention, a computing device is provided, the computing device comprising: at least one processor, a memory, and an input / output unit; wherein the memory is used to store a computer program, and the processor is used to invoke the computer program stored in the memory to execute the method described in any one aspect.

[0012] In a fourth aspect of the present invention, a computer-readable storage medium is provided, comprising instructions which, when executed on a computer, cause the computer to perform the method described in any one of the first aspects.

[0013] In a fifth aspect of the present invention, a computer program product is provided, comprising a computer program that, when executed by a processor, implements the method described in any one of the first aspects.

[0014] The turbine blade assembly sequence optimization method, apparatus, equipment, medium, and product according to embodiments of the present invention can, by acquiring detailed information on engine speed, assembly radius, and blades to be assembled, and when the number of blades is even, first construct a first initial blade sequence based on the blades to be assembled from lightest to heaviest mass, then construct a first initial assembly sequence based on this, and finally optimize it using parameters such as random number sequences to obtain a first optimal assembly sequence. This optimization method fully considers factors such as blade mass distribution and engine operating parameters. Through a carefully designed optimization process, it can ensure that the centrifugal forces generated by each blade are coordinated and balanced when the assembled turbine blades rotate, ultimately minimizing the resultant force of the centrifugal forces generated by the turbine blades as a whole during rotation. This effectively improves the stability and reliability of turbine operation and reduces the risk of failure caused by centrifugal force imbalance. Attached Figure Description

[0015] The above and other objects, features, and advantages of exemplary embodiments of the present invention will become readily apparent from the following detailed description taken in conjunction with the accompanying drawings. Several embodiments of the invention are illustrated in the drawings by way of example and not limitation, wherein: Figure 1 This is a flowchart illustrating a method for optimizing the assembly sequence of turbine blades according to an embodiment of the present invention. Figure 2 This is a schematic diagram of a blade weighing device according to an embodiment of the present invention; Figure 3 This is a schematic diagram of another blade weighing device provided in an embodiment of the present invention; Figure 4 This is a schematic diagram of another blade weighing device provided in an embodiment of the present invention; Figure 5a This is a schematic diagram of the installation of a turbine blade according to an embodiment of the present invention; Figure 5b This is a schematic diagram of another turbine blade installation provided in an embodiment of the present invention; Figure 6 This is a schematic diagram of the structure of a turbine blade assembly sequence optimization device according to an embodiment of the present invention; Figure 7 A schematic diagram of the structure of a medium according to an embodiment of the present invention is shown. Figure 8 A schematic diagram of the structure of a computing device according to an embodiment of the present invention is shown.

[0016] In the accompanying drawings, the same or corresponding reference numerals indicate the same or corresponding parts. Detailed Implementation

[0017] The principles and spirit of the invention will now be described with reference to several exemplary embodiments. It should be understood that these embodiments are given merely to enable those skilled in the art to better understand and implement the invention, and are not intended to limit the scope of the invention in any way. Rather, these embodiments are provided to make this disclosure more thorough and complete, and to fully convey the scope of this disclosure to those skilled in the art.

[0018] Those skilled in the art will recognize that embodiments of the present invention can be implemented as a system, apparatus, device, method, or computer program product. Therefore, this disclosure can be specifically implemented in the following forms: entirely hardware, entirely software (including firmware, resident software, microcode, etc.), or a combination of hardware and software.

[0019] According to embodiments of the present invention, a method, apparatus, equipment, medium, and product for optimizing the assembly sequence of turbine blades are proposed.

[0020] It should be noted that the number of any elements in the accompanying drawings is for illustrative purposes only and not as a limitation, and any naming is for distinction only and has no limiting meaning.

[0021] The principles and spirit of the present invention will be explained in detail below with reference to several representative embodiments.

[0022] Example 1 The following is for reference. Figure 1 , Figure 1 This is a flowchart illustrating a method for optimizing the assembly sequence of turbine blades according to an embodiment of the present invention. It should be noted that the embodiments of the present invention can be applied to any applicable scenario.

[0023] Figure 1 The flowchart of the turbine blade assembly sequence optimization method provided in one embodiment of the present invention, shown below, includes: Step S101: Obtain engine speed, assembly radius, and blade information of the blade to be assembled.

[0024] In this embodiment of the application, the blade information includes the number of blades, the blade mass of each blade to be assembled, and the blade number (1~n) of each blade to be assembled.

[0025] For example, weigh and number n blades to be assembled in the same stage, and number them from 1 to n according to their weight from lightest to heaviest (which can be considered as an initial blade sorting), to determine the engine speed N and the assembly radius R.

[0026] Please refer to the following: Figures 2-4 The blade weighing device includes a box with one open end, a dust cover, a tiltable weighing pan, a controller, and a calculation module. The box is equipped with an output end.

[0027] The tiltable weighing pan is housed inside the chamber, with a dust cover over the opening to prevent dust from entering the device. A weight sensor is located at the bottom of the tiltable weighing pan and is connected to the calculation module.

[0028] In use, the device is started, and the blades are numbered and placed sequentially on the tilting weighing pan for weighing. After each weighing, the weight sensor transmits the data to the calculation module. After weighing, the tilting weighing pan rotates at a certain angle to allow the blades to slide off the weighing pan. Then the tilting weighing pan is returned to its original position for the next weighing. After all the blades have been weighed, the controller starts the calculation module to optimize the blade assembly sequence. The optimization of the calculation module adopts the aforementioned blade assembly sequence optimization method. The results are then output through the output terminal, which can be connected to a computer to output electronic drawings or connected to a printer to output paper drawings.

[0029] Step S102: If the number of blades is even, the blades to be assembled are arranged in order of increasing weight to form a first initial blade sequence.

[0030] Step S103: Based on the first initial blade sequence and the blade information, construct the first initial assembly sequence.

[0031] In this embodiment of the application, the first initial assembly sequence is pos_final=[].

[0032] For example, from the initial sequence of first blades, blades numbered n-1 and n are placed into pos_final=[], ensuring that the heavier blade is on the left. At this point, pos_final=[n, n-1] contains two elements (which can be considered as selecting two blades to be mounted opposite each other on the wheel, such as...). Figure 5a or Figure 5b (As shown).

[0033] As an optional implementation, step S103, which constructs the first initial assembly sequence based on the first initial blade sequence and the blade information, may include: Two target blades to be assembled in the first initial blade sequence are moved to the pre-constructed first initial assembly sequence; wherein the blade mass of any one of the target blades to be assembled is greater than the blade mass of the remaining blades to be assembled in the first initial blade sequence. Determine whether the first initial blade sequence is an empty sequence, and obtain the determination result; If the judgment result indicates that the first initial blade sequence is an empty sequence, then the current first initial assembly sequence is determined as the final first initial assembly sequence; If the judgment result indicates that the first initial blade sequence is not an empty sequence, then the first and second adjusted blades to be assembled are taken from the first initial blade sequence; and the first and second adjusted blades to be assembled are added to the first initial assembly sequence to obtain the current first initial assembly sequence; and the step of judging whether the first initial blade sequence is an empty sequence and obtaining the judgment result is performed. Wherein, the blade mass of the first adjusted blade to be assembled is greater than the blade mass of the remaining blades to be assembled in the first initial blade sequence, the blade mass of the second adjusted blade to be assembled is greater than the blade mass of the remaining blades to be assembled in the first initial blade sequence, and the blade mass of the first adjusted blade to be assembled is greater than the blade mass of the second adjusted blade to be assembled.

[0034] In this implementation method, two target blades with greater mass are moved to a pre-constructed sequence. Subsequently, larger first and second blades with greater mass are continuously added to the sequence from the remaining blades. This approach prioritizes the larger blades, gradually distributing them rationally within the assembly sequence. This results in a more balanced distribution of centrifugal force during the rotation of the assembled blades, which facilitates subsequent optimization, reduces the resultant centrifugal force generated by the turbine blades during rotation, and improves the safety and stability of turbine operation.

[0035] Optionally, adding the first and second blades to be adjusted and assembled to the first initial assembly sequence to obtain the current first initial assembly sequence may include: The first initial assembly sequence is divided into a first initial assembly subsequence and a second initial assembly subsequence; wherein the number of blades in the first initial assembly subsequence and the number of blades in the second initial assembly subsequence are the same, the first initial assembly subsequence is the first half of the first initial assembly sequence, and the second initial assembly subsequence is the second half of the first initial assembly sequence. Determine the total mass of the first blades to be assembled in the first initial assembly sub-sequence; Determine the total mass of the second blades of the blades to be assembled contained in the second initial assembly sub-sequence; The total mass of the first blade is compared with the total mass of the second blade to obtain the mass comparison result; If the quality comparison result indicates that the total mass of the first blade is the same as the total mass of the second blade, then the blades to be assembled in the first initial assembly sub-sequence and the blades to be assembled in the second initial assembly sub-sequence are adjusted to obtain the adjusted first initial assembly sub-sequence and second initial assembly sub-sequence; and the steps from determining the total mass of the first blades to be assembled in the first initial assembly sub-sequence to comparing the total mass of the first blade with the total mass of the second blade to obtain the quality comparison result are executed. If the mass comparison result indicates that the total mass of the first blade is greater than the total mass of the second blade, then the first blade to be adjusted and assembled is added to the middle position of the first initial assembly sequence, and the second blade to be adjusted and assembled is added to the beginning position of the first initial assembly sequence to obtain the current first initial assembly sequence. If the quality comparison result indicates that the total mass of the first blade is less than the total mass of the second blade, then the first blade to be adjusted and assembled is added to the middle position of the first initial assembly sequence, and the second blade to be adjusted and assembled is added to the end of the first initial assembly sequence to obtain the current first initial assembly sequence.

[0036] This implementation method divides the initial assembly sequence into two sub-sequences of equal numbers. By comparing the total mass, blades are precisely added and adjusted based on the different results. If the total mass of the two sub-sequences is the same, further adjustments are made to ensure balance; if they are different, blades are added according to specific rules to ensure a reasonable distribution of the heavier blades. This effectively balances the mass distribution of the blades in the assembly sequence, allowing the centrifugal forces of each part to coordinate with each other, creating favorable conditions for subsequent optimization, and ultimately reducing the resultant force of centrifugal force when the turbine blades rotate, thus improving the stability and reliability of turbine operation.

[0037] Optionally, adjusting the blades to be assembled in the first initial assembly sub-sequence and the blades to be assembled in the second initial assembly sub-sequence to obtain the adjusted first and second initial assembly sub-sequences may include: The first blade to be assembled in the first initial assembly sub-sequence is moved to the end of the second initial assembly sub-sequence, and the first blade to be assembled in the second initial assembly sub-sequence is moved to the end of the first initial assembly sub-sequence, thus obtaining the adjusted first initial assembly sub-sequence and second initial assembly sub-sequence.

[0038] This implementation method involves exchanging the positions of the first blades to be assembled in the first and second initial assembly sub-sequences, a simple and efficient operation. This exchange disrupts the original mass distribution of the sub-sequences, further optimizing the blade arrangement while maintaining the same total mass in both sub-sequences, resulting in a more balanced and reasonable mass distribution. This helps to ensure a more uniform distribution of centrifugal force during rotation of the subsequently constructed assembly sequence, effectively reducing the resultant centrifugal force during turbine blade rotation, improving the overall stability and safety of the turbine operation, and extending its service life.

[0039] For example, the steps of constructing a first initial assembly sequence based on a first initial blade sequence and blade information may include: A. Divide pos_final into two groups, pos_final1 and pos_final2, from the middle position. At this time, pos_final1=[n] and pos_final2=[n-1]; B. Select leaf n-4 and leaf n-3 from the first initial leaf sequence (leaf n-1 and n are missing at this time). Compare the total weight of the leaves in group pos_final1 and group pos_final2. If the total weight of group pos_final1 is greater than that of group pos_final2, then leaf n-4 is placed at the beginning of group pos_final and leaf n-3 is placed in the middle of group pos_final, forming a new group pos_final, pos_final=[n-4,n,n-3,n-1]. C. If the total weight of group pos_final1 is less than that of group pos_final2, then blade n-4 is placed at the end of pos_final and blade n-3 is placed in the middle of pos_final, forming a new group pos_final, pos_final=[n,n-3,n-1,n-4]; D. If the weights of groups pos_final1 and pos_final2 are equal, swap the first element of groups pos_final1 and pos_final2 and place them at the end of the array respectively. Recompare the total weights of groups pos_final1 and pos_final2 and insert the blades according to the principles of B and C. If the total weights of groups pos_final1 and pos_final2 are still the same after all elements have been swapped, then force the blades to be inserted according to the principle of step B (or step C).

[0040] Repeat steps A through D in sequence, inserting two leaves into pos_final each time, until all leaves have completed the allocation of their position sequences.

[0041] Step S104: Optimize the first initial assembly sequence based on the random number sequence, the engine speed, the assembly radius, and the blade information to obtain the first optimal assembly sequence.

[0042] As an optional implementation, step S104, which optimizes the first initial assembly sequence based on a random number sequence, the engine speed, the assembly radius, and the blade information to obtain the first optimal assembly sequence, may include: Randomly generate the number of optimization attempts; Based on the number of optimizations, a random number sequence is generated; wherein the number of random elements contained in the random number sequence is the same as the number of optimizations, and each random element contained in the random number sequence corresponds to a blade to be assembled in the first initial assembly sequence; The optimal centrifugal force resultant force for the first initial assembly sequence is determined based on the engine speed, the assembly radius, and the blade information. Determine whether there are any unextracted random elements in the random number sequence, and obtain the element determination result; If the element judgment result indicates that there are no unextracted random elements in the random number sequence, then the current first initial assembly sequence is determined as the first optimal assembly sequence. If the element determination result indicates that there is an unextracted random element in the random number sequence, then an unextracted random element is extracted from the random number sequence, and a first target blade to be assembled corresponding to the unextracted random element is determined from the first initial assembly sequence, and a second target blade to be assembled corresponding to the first target blade to be assembled is determined from the first initial assembly sequence; wherein, a preset number of blades to be assembled are spaced apart between the first target blade to be assembled and the second target blade to be assembled. The first target blade to be assembled is swapped with the second target blade to be assembled to obtain the current first initial assembly sequence; The current centrifugal force resultant force of the current first initial assembly sequence is determined based on the engine speed, the assembly radius, and the blade information. If the current centrifugal force is less than or equal to the optimal centrifugal force, then the optimal centrifugal force is updated to the current centrifugal force, and the step of determining whether there are any unextracted random elements in the random number sequence is executed to obtain the element determination result. If the current centrifugal force is greater than the optimal centrifugal force, then the step of determining whether there are any unextracted random elements in the random sequence and obtaining the element determination result is performed.

[0043] In this implementation method, optimization iterations and sequences are randomly generated, with random elements corresponding to blades to determine the initial optimal centrifugal force resultant force. By continuously assessing the extraction of random elements, elements are extracted and their corresponding blades are swapped, and the current centrifugal force resultant force is recalculated. If it is less than or equal to the optimal value, it is updated, and this process is repeated. This method leverages randomness to comprehensively explore possible assembly sequences. By combining engine parameters and blade information, it gradually finds assembly sequences with smaller centrifugal force resultant forces, effectively improving the balance of turbine blade rotation, reducing the risk of failures caused by centrifugal force imbalance, and ensuring stable turbine operation.

[0044] In this embodiment of the application, a preset number of blades are spaced between the first target blade to be assembled and the second target blade to be assembled. The preset number can be calculated as follows:

[0045] Where x represents the preset quantity and n represents the number of blades to be assembled.

[0046] For example, define the number of random optimizations m, generate a random sequence [i,j,k,...], and the array contains m elements, each element representing the position of a blade in the current pos_final. After sequentially swapping the i-th (j,k) blade in the current pos_final sequence with the blade 180° away from it, calculate the centrifugal force resultant force. If it is less than the centrifugal force resultant force before the swap, a new pos_final sequence is formed. If the centrifugal force resultant force increases or remains unchanged, the pos_final sequence remains unchanged. Repeat the process of swapping the blades represented by the elements in the random sequence to obtain the optimized pos_final sequence.

[0047] Alternatively, the following optimization methods can also be used to optimize the first initial assembly sequence: 1) Genetic Algorithm: In leaf sorting applications, the arrangement of a single leaf is treated as a "chromosome" (individual). Multiple distinct arrangements (populations) are randomly generated. The resultant centrifugal force of each arrangement is calculated; the smaller the resultant centrifugal force, the higher the fitness.

[0048] The specific implementation method is as follows: 1.1 Read the number of blades, engine speed, and assembly radius; 1.2 Fix the angle position according to the number of blades; 1.3 Calculate the resultant force of pos_final; 1.4 Define the adaptive function fit_function for the genetic algorithm, which is related to the leaf quality and position; 1.5 Set genetic parameters, including population size pop_size, number of generations max_gen, crossover probability pc, and mutation probability pm.

[0049] 1.6 Simulate biological genetics. Within the number of iterations, each iteration selects the leaf with the best fitness as the parent based on the fitness, performs sequential crossover with pc probability, and performs exchange mutation with pm probability to obtain a new leaf assembly state and calculate the new fitness score. 1.7 Based on the set number of breeding generations of the population, the optimized leaf assembly sequence is obtained.

[0050] The advantages of this method are: strong global search capability, effectively escaping local optima and finding approximate optimal solutions.

[0051] 2) Simulated Annealing Algorithm Simulated annealing algorithm originates from the metal annealing process. It simulates the cooling process, initially accepting poor solutions with a certain probability to avoid getting trapped in local optima. As the "temperature" decreases, it gradually stabilizes and eventually finds the global optimum. It is an efficient and general probabilistic optimization algorithm.

[0052] In the application of leaf sorting, starting from an initial solution (arrangement), a neighboring solution is randomly generated (such as swapping two leaves), and according to the "Metropolis criterion", a solution worse than the current solution is accepted with a certain probability, thus giving the opportunity to escape local optima.

[0053] The specific implementation method is as follows: 2.1 Read the number of blades, engine speed, and assembly radius; 2.2 Fix the angle position according to the number of blades; 2.3 Calculate the resultant force of pos_final; 2.4 Define the cost function cost_function for the simulated annealing algorithm, which is related to the blade mass and position; 2.5 Set the simulated annealing parameters, including the initial temperature T_init, cooling rate cooling_rate, number of iterations per temperature iter_per_temp, and minimum temperature T_min; 2.6 Simulated annealing cycle: Within the number of iterations, two blades are randomly swapped in each iteration to obtain a new blade assembly state, and a new cost function cost_function is calculated. 2.7 Based on the Metropolis criterion, if the cost of the new state is lower, then accept the new state; otherwise, establish a probability p function (related to T) and make another acceptance decision. 2.8 Cooling T by using the cooling rate (Cooling_rate); 2.9 The optimized blade assembly sequence was obtained by slowly cooling down to the minimum temperature.

[0054] Advantages: Simple principle, easy to program, and good global search performance.

[0055] 3) Particle Swarm Optimization Algorithm Particle swarm optimization (PSO) simulates the social behavior of flocks of birds or schools of fish. Each "particle" represents a solution (a leaf sequence) and updates its position by tracking its own historical best and the group's historical best, collaboratively searching for the global optimum.

[0056] The specific implementation method is as follows: 3.1 Read the number of blades, engine speed, and assembly radius; 3.2 Fix the angle position according to the number of blades; 3.3 Calculate the resultant force of pos_final; 3.4 Define the particle swarm optimization algorithm fitness function part_function, which is related to the blade mass and position; 3.5 Set the particle swarm parameters, including the particle swarm size paticle_size, the number of particle moves max_iter, the individual factor c1, and the global factor c2; 3.6 Simulate particle movement in space, represent velocity by exchanging sequences, update position by exchanging operations, randomly exchange two blades within the number of iterations to obtain a new blade assembly state, and calculate the new fitness; 3.7 Record the individual optimal position and the overall optimal position; 3.8 Based on the set number of moves, the optimized blade assembly sequence is obtained.

[0057] Advantages: Fewer key parameters, high parallel efficiency, and the ability to remember historical optimal positions makes the search more directional. 4) Ant Colony Algorithm Ant colony optimization (ACO) is a method that simulates the foraging path optimization of ants. Ants communicate using pheromones and collaboratively search the solution space. Higher pheromone concentrations along a path increase its attractiveness, and this positive feedback mechanism ultimately leads to the discovery of the optimal path. It excels at solving combinatorial optimization problems and is suitable for path optimization problems such as those involving a traveling salesman; its underlying principles can also be applied to sorting algorithms.

[0058] Specific implementation method: 4.1 Read the number of blades, engine speed, and assembly radius; 4.2 Fix the angle position according to the number of blades; 4.3 Calculate the resultant force of pos_final; 4.4 Define the ant colony algorithm path function path_function, which is related to the quality and position of the leaf; 4.5 Set ant colony parameters, including ant colony size ant_size, maximum number of pathfinding attempts max_search, pheromone importance factor coe_alpha, heuristic pheromone importance factor coe_beta, pheromone evaporation coefficient rho, and pheromone constant q; 4.6 Simulate ants finding the optimal path. Within the number of pathfinding attempts, each ant starts from a random leaf and selects the next leaf according to probability (related to pheromones) until all leaves are visited. Calculate the path distance and release pheromones. 4.7 Update pheromones based on path length; shorter paths result in stronger pheromones. 4.8 Based on the set number of pathfinding attempts, record the best path to obtain the optimized blade assembly sequence.

[0059] In this embodiment of the application, the method for calculating the resultant centrifugal force can be as follows: First, we need to give the angular velocity ω (which can be converted from the rotational speed w (unit: rpm)) and the radius r. The angular interval of each blade is 360 / n. The angular velocity ω = ((w / 60) * π * 2). The angle θi corresponding to the i-th blade is i * 360 / n. The mass corresponding to the i-th blade is mi.

[0060] Centrifugal force is decomposed into forces in the x and y directions within an orthogonal two-dimensional coordinate system; The centrifugal force of the i-th blade in the pos_final sequence can be calculated separately: Fxi=r*ω2*mi*cos((θ / 180)*π) Fyi=r*ω2*mi*sin((θ / 180)*π) The centrifugal forces of all the blades can be accumulated to achieve the resultant forces Fx and Fy in the x and y directions; The direction t of the resultant centrifugal force is calculated using the following formula: t = arctan(Fy / Fx) The magnitude of the resultant centrifugal force is:

[0061] As an optional implementation, after step S101, the following steps may also be performed: If the number of blades is odd, then determine the average mass of the blades to be assembled; Determine the absolute value of the mass difference between the mass of each blade to be assembled and the average mass; The blade to be assembled corresponding to the absolute value of the smallest mass difference is determined as the first blade to be assembled. The blades to be assembled, other than the first blade to be assembled, are designated as the second blade to be assembled. The second initial blade sequence is constructed by arranging the blades to be assembled in order of increasing blade mass; Based on the second initial blade sequence, the blade information, and the first blade to be assembled, a second initial assembly sequence is constructed; wherein, the first blade to be assembled is the first blade to be assembled in the second initial assembly sequence; The second initial assembly sequence is optimized based on the random number sequence, the engine speed, the assembly radius, and the blade information to obtain the second optimal assembly sequence; wherein the first blade to be assembled is the first blade to be assembled in the second optimal assembly sequence.

[0062] In this implementation method, an average mass is determined, and the blade with the mass closest to the average is selected as the first blade to be assembled and placed at the top. The remaining blades are then sorted by mass to construct a second initial blade sequence, which in turn constructs a second initial assembly sequence. Subsequently, a second optimal assembly sequence is obtained by optimizing using a random number sequence and relevant parameters, while keeping the position of the first blade to be assembled unchanged. This method can reasonably handle the assembly of odd-numbered blades, resulting in a more balanced mass distribution, effectively reducing the resultant force of centrifugal force during turbine blade rotation, improving the stability and reliability of turbine operation, and reducing vibration and wear problems caused by uneven centrifugal force.

[0063] In this embodiment of the application, when the number of blades is odd, the construction of the second initial assembly sequence is the same as the construction of the first initial assembly sequence in step S103, except that the first blade to be assembled is added to the starting position of the second initial assembly sequence in the last step.

[0064] In this embodiment, the method of optimizing the second initial assembly sequence based on the random number sequence, the engine speed, the assembly radius, and the blade information to obtain the second optimal assembly sequence is the same as the method of optimizing the first initial assembly sequence to obtain the first optimal assembly sequence in step S104. However, when optimizing the second initial assembly sequence, there is no need to adjust the position of the first blade to be assembled. That is, the first blade to be assembled is always at the starting position of the second initial assembly sequence. During the optimization process, a preset number of blades to be assembled are calculated between the first target blade to be assembled and the second target blade to be assembled. The number of blades to be assembled involved in the calculation of the preset number does not include the first blade to be assembled.

[0065] For example, for an odd number of blades, the following processing is required: After step 1 is completed, the average weight of all the blades is calculated. Then, the blade closest to the average weight is taken out, and the remaining blades form an even group of blades. They are still allocated according to the method in step S103 to form the Ex_pos_final sequence (at this time, one blade is missing). The taken-out blade is placed at the beginning of the Ex_pos_final sequence to form the pos_final sequence. At this time, the allocation of all blades is completed. According to step 8, when calculating the centrifugal force, the position of the first blade is taken as 0°, and 0° corresponds to the taken-out blade.

[0066] Therefore, when using the optimization method in step 104, we can define a random optimization number m and generate a random sequence [i,j,k,...]. The array contains m elements, each element representing the position of a blade in Ex_pos_final. We sequentially swap the i-th (j or k) blade in the Ex_pos_final sequence with the blade whose position is opposite to its position in the Ex_pos_final sequence. Then we calculate the centrifugal force resultant force under the pos_final sequence. If it is less than the centrifugal force resultant force before the swap, we form a new pos_final sequence and a new Ex_pos_final (excluding the first blade in the pos_final sequence). If the centrifugal force resultant force is expressed or unchanged, we keep the pos_final sequence and Ex_pos_final sequence unchanged. We sequentially swap the blades represented by the elements in the random sequence to obtain the optimized pos_final sequence.

[0067] For example, a practical demonstration was conducted using 10 blades (weighing 10.1, 10.2, 10.3, 10.4, 10.5, 10.6, 10.7, 10.8, 10.9, and 11 respectively, in g), rotating at 21,000 rpm, with a radius r = 103 mm.

[0068] Under the original sequence, the calculated resultant centrifugal force is 250N.

[0069] 1. Initially sort the blades by weight: The sorted list is: [10.1, 10.2, 10.3, 10.4, 10.5, 10.6, 10.7, 10.8, 10.9, 11.0]; Start sorting: Initially: final_pos = [11.0, 10.9] Iteration 1: Insert [10.8, 10.7] Grouping: g1=[11.0]=11.0, g2=[10.9]=10.9 → sum_g1 > sum_g2 Insertion results: [10.7, 11.0, 10.8, 10.9] Iteration 2: Insert [10.6, 10.5] Grouping: g1=[10.7, 11.0]=21.7, g2=[10.8, 10.9]=21.7 → Equal! After adjusting step D g1=[11.0, 10.80]=21.8, g2=[10.9, 10.7]=21.6→ sum_g1 > sum_g2 Insert according to step B. Insertion results: [10.5, 10.7, 11.0, 10.6, 10.8, 10.9] Iteration 3: Insert [10.4, 10.3] Grouping: g1 = [10.5, 10.7, 11.0] = 32.2 g2=[10.6, 10.8, 10.9]=32.3 → sum_g2 > sum_g1 Insert according to step C. Insertion results: [10.5, 10.7, 11, 10.4, 10.6, 10.8, 10.9, 10.3] Iteration 4: Insert [10.1, 10.2] Grouping: g1 = [10.5, 10.7, 11.0, 10.4] = 41.6 g2=[10.6, 10.8, 10.9, 10.3]=40.6 → sum_g1 > sum_g2 Insert according to step 3, B. Insertion results: [10.1, 10.5, 10.7, 11, 10.2, 10.4, 10.6, 10.8, 10.9, 10.3] The blade assembly sequence is now complete, pos_final=[10.1, 10.5, 10.7, 11, 10.2, 10.4, 10.6, 10.8, 10.9, 10.3]. The calculated resultant centrifugal force at this point is 3.2 N.

[0070] The random pairing and swapping optimization strategy from step 104, or other optimization algorithms, can then be used to optimize the entire blade sequence to minimize the resultant centrifugal force on the blades. Here, the random pairing and swapping optimization from step 104 is used, and the optimization is performed 1000 times. The optimized leaf sequence is pos_final=[11, 10.1, 10.9, 10.2, 10.5, 10.6, 10.3, 10.8, 10.4, 10.7]. At this time, the resultant centrifugal force of the blades is 0.41N.

[0071] In addition, optimizations were made for the 43 turbine blades; please refer to the attached document for further details. Figure 5a and Figure 5b , Figure 5aThis is a schematic diagram of turbine blade installation according to an embodiment of the present invention; wherein, Weight Value represents the mass data of each blade, and the mass data (grams) of 43 turbine blades are as follows: [14.294 14.245 14.245 14.286 14.130 14.270 14.444 14.325 14.256 14.272 14.308 14.364 14.164 14.294 14.268 14.377 13.988 14.227 14.100 14.230 14.010 14.274 14.435 14.325 14.272 14.437 14.015 14.000 14.166 14.078] [14.202 14.179 14.177 14.039 14.108 14.412 14.295 14.260 14.258 14.239 14.239 14.218 13.903], with an angular velocity of 50000 rpm and an assembly radius of 0.013 meters, a first initial assembly sequence is constructed based on the first initial blade sequence and blade information. The total centrifugal force under the distribution of the first initial assembly sequence is 24.7572 N.

[0072] Figure 5b This is a schematic diagram of another turbine blade installation provided in an embodiment of the present invention; Figure 5b China is the counterpart Figure 5a The initial assembly sequence was optimized 50 times to obtain the first optimal assembly sequence. The total centrifugal force under the first optimal assembly sequence distribution was 0.5078 N. It is evident that the total centrifugal force under the first optimal assembly sequence distribution is significantly smaller than that under the first initial assembly sequence distribution.

[0073] This invention minimizes the resultant force of centrifugal force generated by the turbine blades during rotation, effectively improving the stability and reliability of turbine operation and reducing the risk of failure caused by centrifugal force imbalance.

[0074] After introducing the method of exemplary embodiments of the present invention, the following references are made. Figure 6 An exemplary embodiment of the present invention provides a turbine blade assembly sequence optimization apparatus, the apparatus comprising: The acquisition unit 601 is used to acquire engine speed, assembly radius, and blade information of the blade to be assembled; wherein, the blade information includes the number of blades, the blade mass of each blade to be assembled, and the blade number of each blade to be assembled. The first building unit 602 is used to build a first initial blade sequence by assembling the blades to be assembled in order of blade weight from lightest to heaviest if the number of blades is even. The second construction unit 603 is used to construct a first initial assembly sequence based on the first initial blade sequence and the blade information; The optimization unit 604 is used to optimize the first initial assembly sequence based on the random number sequence, the engine speed, the assembly radius, and the blade information to obtain the first optimal assembly sequence.

[0075] This invention minimizes the resultant force of centrifugal force generated by the turbine blades during rotation, effectively improving the stability and reliability of turbine operation and reducing the risk of failure caused by centrifugal force imbalance.

[0076] After introducing the methods and apparatus of exemplary embodiments of the present invention, the following references are made. Figure 7 A computer-readable storage medium according to exemplary embodiments of the present invention will be described, please refer to... Figure 7 The computer-readable storage medium shown is an optical disc 70, on which a computer program (i.e., a program product) is stored. When the computer program is run by a processor, it implements the steps described in the above method implementation, such as obtaining engine speed, assembly radius, and blade information of the blades to be assembled; wherein, the blade information includes the number of blades, the blade mass of each blade to be assembled, and the blade number of each blade to be assembled; if the number of blades is even, the blades to be assembled are arranged in order of blade mass from lightest to heaviest to construct a first initial blade sequence; based on the first initial blade sequence and the blade information, a first initial assembly sequence is constructed; the first initial assembly sequence is optimized based on a random number sequence, the engine speed, the assembly radius, and the blade information to obtain a first optimal assembly sequence; the specific implementation of each step will not be repeated here.

[0077] It should be noted that examples of the computer-readable storage medium may also include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other optical and magnetic storage media, which will not be elaborated here.

[0078] After introducing the methods, apparatus, and media of exemplary embodiments of the present invention, the following references are made. Figure 8 A computing device for optimizing the assembly sequence of turbine blades according to an exemplary embodiment of the present invention.

[0079] Figure 8 A block diagram is shown of an exemplary computing device 80 suitable for implementing embodiments of the present invention, which may be a computer system or a server. Figure 8 The computing device 80 shown is merely an example and should not impose any limitation on the functionality and scope of use of the embodiments of the present invention.

[0080] like Figure 8 As shown, the components of the computing device 80 may include, but are not limited to: one or more processors or processing units 801, system memory 802, and bus 803 connecting different system components (including system memory 802 and processing unit 801).

[0081] The computing device 80 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by the computing device 80, including volatile and non-volatile media, removable and non-removable media.

[0082] System memory 802 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 8021 and / or cache memory 8022. Computing device 80 may further include other removable / non-removable, volatile / non-volatile computer system storage media. By way of example only, ROM 8023 may be used to read and write non-removable, non-volatile magnetic media (…). Figure 8 (Not shown in the image, usually referred to as "hard drive"). Although not shown in... Figure 8 The diagram illustrates that disk drives for reading and writing to removable non-volatile disks (e.g., "floppy disks") and optical disc drives for reading and writing to removable non-volatile optical discs (e.g., CD-ROMs, DVD-ROMs, or other optical media) can be provided. In these cases, each drive can be connected to bus 803 via one or more data media interfaces. System memory 802 may include at least one program product having a set (e.g., at least one) of program modules configured to perform the functions of the embodiments of the present invention.

[0083] A program / utility 8025 having a set (at least one) of program modules 8024 may be stored, for example, in system memory 802, and such program modules 8024 include, but are not limited to, an operating system, one or more application programs, other program modules, and program data, each or some combination of these examples may include an implementation of a network environment. Program modules 8024 typically perform the functions and / or methods described in the embodiments of the present invention.

[0084] The computing device 80 can also communicate with one or more external devices 804 (such as a keyboard, pointing device, display, etc.). This communication can be performed through the input / output (I / O) interface 805. Furthermore, the computing device 80 can also communicate with one or more networks (such as a local area network (LAN), a wide area network (WAN), and / or a public network, such as the Internet) via a network adapter 806. Figure 8 As shown, network adapter 806 communicates with other modules of computing device 80 (such as processing unit 801) via bus 803. It should be understood that, although... Figure 8 As not shown, it can be used in conjunction with computing device 80 with other hardware and / or software modules.

[0085] The processing unit 801 executes various functional applications and data processing by running programs stored in the system memory 802. For example, it acquires engine speed, assembly radius, and blade information of the blades to be assembled. The blade information includes the number of blades, the mass of each blade to be assembled, and the blade number of each blade to be assembled. If the number of blades is even, the blades to be assembled are arranged in ascending order of mass to construct a first initial blade sequence. Based on the first initial blade sequence and the blade information, a first initial assembly sequence is constructed. The first initial assembly sequence is optimized based on a random number sequence, the engine speed, the assembly radius, and the blade information to obtain a first optimal assembly sequence. The specific implementation methods of each step will not be repeated here. It should be noted that although several units / modules or sub-units / sub-modules of the turbine blade assembly sequence optimization device are mentioned in the detailed description above, this division is merely exemplary and not mandatory. In fact, according to embodiments of the present invention, the features and functions of two or more units / modules described above can be embodied in one unit / module. Conversely, the features and functions of one unit / module described above can be further divided into multiple units / modules for embodiment.

[0086] In the description of this invention, it should be noted that the terms "first," "second," and "third" are used for descriptive purposes only and should not be construed as indicating or implying relative importance.

[0087] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0088] In the several embodiments provided by this invention, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. The apparatus embodiments described above are merely illustrative. For example, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. Furthermore, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Additionally, the coupling or direct coupling or communication connection shown or discussed may be through some communication interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

[0089] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0090] In addition, the functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0091] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a processor-executable, non-volatile, computer-readable storage medium. Based on this understanding, the technical solution of this invention, essentially, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0092] Finally, it should be noted that the above-described embodiments are merely specific implementations of the present invention, used to illustrate the technical solutions of the present invention, and not to limit it. The scope of protection of the present invention is not limited thereto. Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that any person skilled in the art can still modify or easily conceive of changes to the technical solutions described in the foregoing embodiments within the technical scope disclosed in the present invention, or make equivalent substitutions for some of the technical features; and these modifications, changes, or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention, and should all be covered within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

[0093] Furthermore, although the operations of the method of the present invention are described in a specific order in the accompanying drawings, this does not require or imply that these operations must be performed in that specific order, or that all the operations shown must be performed to achieve the desired result. Additionally or alternatively, certain steps may be omitted, multiple steps may be combined into one step, and / or one step may be broken down into multiple steps.

[0094] In one exemplary embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps in the above-described method embodiments.

Claims

1. A method for optimizing the assembly sequence of turbine blades, characterized in that, include: The engine speed, assembly radius, and blade information of the blades to be assembled are obtained; wherein, the blade information includes the number of blades, the blade mass of each blade to be assembled, and the blade number of each blade to be assembled. If the number of blades is even, the blades to be assembled are arranged in order of increasing weight to form a first initial blade sequence. Based on the first initial blade sequence and the blade information, a first initial assembly sequence is constructed; The first initial assembly sequence is optimized based on the random number sequence, the engine speed, the assembly radius, and the blade information to obtain the first optimal assembly sequence.

2. The turbine blade assembly sequence optimization method according to claim 1, characterized in that, The method further includes: If the number of blades is odd, then determine the average mass of the blades to be assembled; Determine the absolute value of the mass difference between the mass of each blade to be assembled and the average mass; The blade to be assembled corresponding to the absolute value of the smallest mass difference is determined as the first blade to be assembled. The blades to be assembled, other than the first blade to be assembled, are designated as the second blade to be assembled. The second initial blade sequence is constructed by arranging the blades to be assembled in order of increasing blade mass; Based on the second initial blade sequence, the blade information, and the first blade to be assembled, a second initial assembly sequence is constructed; wherein, the first blade to be assembled is the first blade to be assembled in the second initial assembly sequence; The second initial assembly sequence is optimized based on the random number sequence, the engine speed, the assembly radius, and the blade information to obtain the second optimal assembly sequence; wherein the first blade to be assembled is the first blade to be assembled in the second optimal assembly sequence.

3. The turbine blade assembly sequence optimization method according to claim 2, characterized in that, The step of constructing a first initial assembly sequence based on the first initial blade sequence and the blade information includes: Two target blades to be assembled in the first initial blade sequence are moved to the pre-constructed first initial assembly sequence; wherein the blade mass of any one of the target blades to be assembled is greater than the blade mass of the remaining blades to be assembled in the first initial blade sequence. Determine whether the first initial blade sequence is an empty sequence, and obtain the determination result; If the judgment result indicates that the first initial blade sequence is an empty sequence, then the current first initial assembly sequence is determined as the final first initial assembly sequence; If the judgment result indicates that the first initial blade sequence is not an empty sequence, then the first and second adjusted blades to be assembled are taken from the first initial blade sequence; and the first and second adjusted blades to be assembled are added to the first initial assembly sequence to obtain the current first initial assembly sequence; and the step of judging whether the first initial blade sequence is an empty sequence and obtaining the judgment result is performed. Wherein, the blade mass of the first adjusted blade to be assembled is greater than the blade mass of the remaining blades to be assembled in the first initial blade sequence, the blade mass of the second adjusted blade to be assembled is greater than the blade mass of the remaining blades to be assembled in the first initial blade sequence, and the blade mass of the first adjusted blade to be assembled is greater than the blade mass of the second adjusted blade to be assembled.

4. The turbine blade assembly sequence optimization method according to claim 3, characterized in that, The step of adding the first and second blades to be adjusted and assembled to the first initial assembly sequence to obtain the current first initial assembly sequence includes: The first initial assembly sequence is divided into a first initial assembly subsequence and a second initial assembly subsequence; wherein the number of blades in the first initial assembly subsequence and the number of blades in the second initial assembly subsequence are the same, the first initial assembly subsequence is the first half of the first initial assembly sequence, and the second initial assembly subsequence is the second half of the first initial assembly sequence. Determine the total mass of the first blades to be assembled in the first initial assembly sub-sequence; Determine the total mass of the second blades of the blades to be assembled contained in the second initial assembly sub-sequence; The total mass of the first blade is compared with the total mass of the second blade to obtain the mass comparison result; If the quality comparison result indicates that the total mass of the first blade is the same as the total mass of the second blade, then the blades to be assembled in the first initial assembly sub-sequence and the blades to be assembled in the second initial assembly sub-sequence are adjusted to obtain the adjusted first initial assembly sub-sequence and second initial assembly sub-sequence; and the steps from determining the total mass of the first blades to be assembled in the first initial assembly sub-sequence to comparing the total mass of the first blade with the total mass of the second blade to obtain the quality comparison result are executed. If the mass comparison result indicates that the total mass of the first blade is greater than the total mass of the second blade, then the first blade to be adjusted and assembled is added to the middle position of the first initial assembly sequence, and the second blade to be adjusted and assembled is added to the beginning position of the first initial assembly sequence to obtain the current first initial assembly sequence. If the quality comparison result indicates that the total mass of the first blade is less than the total mass of the second blade, then the first blade to be adjusted and assembled is added to the middle position of the first initial assembly sequence, and the second blade to be adjusted and assembled is added to the end of the first initial assembly sequence to obtain the current first initial assembly sequence.

5. The turbine blade assembly sequence optimization method according to claim 4, characterized in that, The step of adjusting the blades to be assembled in the first initial assembly sub-sequence and the blades to be assembled in the second initial assembly sub-sequence to obtain the adjusted first initial assembly sub-sequence and second initial assembly sub-sequence includes: The first blade to be assembled in the first initial assembly sub-sequence is moved to the end of the second initial assembly sub-sequence, and the first blade to be assembled in the second initial assembly sub-sequence is moved to the end of the first initial assembly sub-sequence, thus obtaining the adjusted first initial assembly sub-sequence and second initial assembly sub-sequence.

6. The method for optimizing the assembly sequence of turbine blades according to any one of claims 1 to 5, characterized in that, The optimization of the first initial assembly sequence based on the random number sequence, the engine speed, the assembly radius, and the blade information to obtain the first optimal assembly sequence includes: Randomly generate the number of optimization attempts; Based on the number of optimizations, a random number sequence is generated; wherein the number of random elements contained in the random number sequence is the same as the number of optimizations, and each random element contained in the random number sequence corresponds to a blade to be assembled in the first initial assembly sequence; The optimal centrifugal force resultant force for the first initial assembly sequence is determined based on the engine speed, the assembly radius, and the blade information. Determine whether there are any unextracted random elements in the random number sequence, and obtain the element determination result; If the element judgment result indicates that there are no unextracted random elements in the random number sequence, then the current first initial assembly sequence is determined as the first optimal assembly sequence. If the element determination result indicates that there is an unextracted random element in the random number sequence, then an unextracted random element is extracted from the random number sequence, and a first target blade to be assembled corresponding to the unextracted random element is determined from the first initial assembly sequence, and a second target blade to be assembled corresponding to the first target blade to be assembled is determined from the first initial assembly sequence; wherein, a preset number of blades to be assembled are spaced apart between the first target blade to be assembled and the second target blade to be assembled. The first target blade to be assembled is swapped with the second target blade to be assembled to obtain the current first initial assembly sequence; The current centrifugal force resultant force of the current first initial assembly sequence is determined based on the engine speed, the assembly radius, and the blade information. If the current centrifugal force is less than or equal to the optimal centrifugal force, then the optimal centrifugal force is updated to the current centrifugal force, and the step of determining whether there are any unextracted random elements in the random number sequence is executed to obtain the element determination result. If the current centrifugal force is greater than the optimal centrifugal force, then the step of determining whether there are any unextracted random elements in the random sequence and obtaining the element determination result is performed.

7. A turbine blade assembly sequence optimization device, characterized in that, include: The acquisition unit is used to acquire engine speed, assembly radius, and blade information of the blade to be assembled; wherein, the blade information includes the number of blades, the blade mass of each blade to be assembled, and the blade number of each blade to be assembled. The first building unit is used to build a first initial blade sequence by assembling the blades to be assembled in order of blade weight from lightest to heaviest if the number of blades is even. The second construction unit is used to construct a first initial assembly sequence based on the first initial blade sequence and the blade information; An optimization unit is used to optimize the first initial assembly sequence based on a random number sequence, the engine speed, the assembly radius, and the blade information to obtain a first optimal assembly sequence.

8. A computing device, characterized in that, The computing device includes: At least one processor, memory, and input / output unit; The memory is used to store computer programs, and the processor is used to call the computer programs stored in the memory to execute the method as described in any one of claims 1 to 6.

9. A computer-readable storage medium comprising instructions, characterized in that, When it is run on a computer, it causes the computer to perform the method as described in any one of claims 1 to 6.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the method of any one of claims 1-6.

Images