Large hydroelectric generator confluence copper ring arrangement optimization method based on random search algorithm and greedy strategy

Abstract

The invention discloses a large hydroelectric generator confluence copper ring arrangement optimization method based on a random search algorithm and a greedy strategy. The method comprises the following steps: step 1, establishing a model of a confluence copper ring arrangement scheme; 2, establishing a spatial information model of the confluence copper ring; step 3, constructing constraint conditions of the confluence copper ring; step 4, establishing an optimization objective function; and 5, optimizing a confluence copper ring arrangement scheme by using a random search algorithm in combination with a greedy strategy. The method effectively solves the problems of low manual arrangement efficiency, serious material waste and the like in a traditional copper ring wiring mode, remarkably improves the copper ring confluence efficiency, and is particularly suitable for large hydroelectric generators with huge structures, complex channels and numerous parallel branches.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of power equipment structure optimization, and in particular to a large hydro-generator copper ring arrangement optimization method based on a random search algorithm and a greedy strategy. BACKGROUND

[0002] With the rapid development of social economy, energy consumption has also increased significantly. The renewable, pollution-free and low-cost advantages of hydroelectric power generation will be further promoted and applied. The copper ring and the stator clip are the key components of the hydro-generator, which are responsible for converging the stator winding current and leading it out. The hydro-generator copper ring arrangement refers to selecting the appropriate clip channel for the copper ring to converge the wire rods of each parallel branch to the corresponding outlet.

[0003] The information required to arrange a copper ring is as follows: (1) the starting position of the copper ring; (2) the copper ring convergence channel; (3) the rotation direction of the copper ring; (4) the outlet position of the copper ring. When the number of parallel branches of the generator is large, combinatorial explosion occurs, which is a combinatorial optimization problem. The number of clip channels available for the copper ring is limited, and most of the schemes cannot meet the space constraint conditions, so it is difficult to find a feasible solution, and it is even more difficult to find an optimal solution. Therefore, it is not practical to use exhaustive search to solve the optimal arrangement scheme of the large hydro-generator copper ring.

[0004] At present, the copper ring arrangement of the generator is manually selected by an all-manual method, which is low in efficiency and high in error rate. Moreover, the slot pitch of the large generator is large, and the manual arrangement scheme will waste a lot of materials. Therefore, the research on the optimal arrangement scheme of the large hydro-generator copper ring has important practical application value for improving production efficiency and improving efficiency. SUMMARY

[0005] In view of the above technical problems, the present application provides a large hydro-generator copper ring arrangement optimization method based on a random search algorithm and a greedy strategy, which establishes a mathematical model of the copper ring and converts the complex spatial information into a mathematical form; the optimal or near-optimal solution is solved by using the random search algorithm combined with the survival of the fittest and the greedy principle to optimize the arrangement scheme of the copper ring. The greedy random search algorithm designed by the method has good effects in optimization ability and convergence speed, and the obtained scheme is very close to the optimal solution.

[0006] The technical scheme adopted by the present application is as follows: The large hydro-generator copper ring arrangement optimization method based on a random search algorithm and a greedy strategy comprises the following steps: Step 1: establishing a model of the copper ring arrangement scheme; Step 2: establishing a spatial information model of the copper ring; Step 3: Construct the constraints for the bus copper ring; Step 4: Establish the optimization objective function; Step 5: Optimize the bus copper ring layout scheme using a random search algorithm combined with a greedy strategy.

[0007] Step 1 includes: 1.1: Define the coordinates, slot number coding direction, and copper ring spacing: Define coordinates: The position of each stator slot is fixed and evenly distributed in the stator core. Since the radial diagram of the generator stator is circular, the stator slot number is used to define the coordinates to represent the position information. Define the slot numbering direction: According to motor manufacturing specifications and standards, the stator slots are numbered clockwise. One stator slot is selected and its coordinate is defined as 0, with the slots numbered 1, 2, ... clockwise. Z -1, Z Indicates the number of stator slots.

[0008] Define the distance the copper winding passes through: The distance the copper passes through is expressed by the number of slots the copper passes through.

[0009] 1.2: Definition of the starting slot number for the copper ring: The coordinate position information of the copper ring is available. Z The coils are grouped, but the relative positions of the bars within each group remain constant. The starting position of the copper ring is defined as... S t [ z ][ i ][ j ],Will Z The starting position of each group is recorded. S t [ z ][ i ][ j [In the middle. When the coordinate position exceeds the defined zero point, that is, the coordinate is greater than...] Z When the value is -1, the coordinate is reset to zero and the count restarts, as shown below: (1); In formula (1): z =1, 2, ..., Z, representing the th... z Group coordinates; i =1, 2, ..., 6, representing the six phases A, B, C, AN, BN, and CN respectively; j =1, 2..., a , respectively representing the 1st, 2nd, ..., of each phase. a One parallel branch; 1.3: Definition of copper ring clamp channel: Each clamp channel hasM layer N In the column, the number of channels for each clamp is... M × N For the first, N Columns, from level 1 to level 2 M The layers are denoted as follows: M ( N -1)+1, M ( N -1)+2,..., MN The copper ring clamp channel is defined as: (2); 1.4: Definition of the direction of rotation of the copper ring: The copper ring can only rotate clockwise or counterclockwise. Clockwise rotation is recorded as 1, and counterclockwise rotation as 0, as shown below: (3); In formula (3): i =1, 2, ..., 6, representing the six phases A, B, C, AN, BN, and CN respectively; j =1, 2..., a , respectively representing the 1st, 2nd, ..., of each phase. a One parallel branch; Indicates the first i Xiangdi j The copper rings of the parallel branches control the direction.

[0010] 1.5: Definition of Copper Ring Arrangement Scheme: For a copper ring bus scheme, four pieces of information need to be determined: the starting slot number, the bus channel, the rotation direction, and the target slot number. A parallel branch requires 6 copper rings. a The number of copper rings required for each parallel branch is 6. a One; the copper ring bus scheme is defined as P [ k ][ l ], as shown below: (4); In equation (4): k =1, 2, 3, 4, representing the starting slot number, confluence channel, rotation direction, and target slot number of the copper ring, respectively; l =1, 2, ..., 6 a , respectively representing the 1st, 2nd, ..., 6th a Root copper ring.

[0011] In step 2, the spatial information is defined as follows: The number of layers of the wire clamp isM The number of columns is N The number of slots is Z Then the entire space can be divided into M × N × Z Each grid can define the entire spatial information as... S p [ m ][ n ][ z The occupancy status of spatial information is represented as follows: (5); In equation (5): m =1, 2, ..., M , respectively representing the 1st, 2nd, ..., th wire clamps M layer; n =1, 2, ..., N , respectively representing the 1st, 2nd, ..., of the wire clamps. N List; z =1, 2, ..., Z , respectively representing the 1st, 2nd, ..., Z One slot.

[0012] In step 3, the constraints are as follows: 1) After arranging the copper rings, the groove needs to be... m The first column of the layer to the second column n The column space information is set to zero, as shown below: (6); In formula (6): Indicates the first z 1 slot in the m Layer n The occupancy status of one channel; It is an index variable, and its value range is [1, ..., ...]. n ]; z 1= P [1][ l ] indicates the first l The starting slot number of the root copper ring; 2) After arranging the copper rings, the groove needs to be... m The first layer n Listed to number N The column space information is set to zero, as shown below: (7); In equation (7): Indicates the first z 2 slots in the m Layer nThe occupancy status of the two channels; n 2 is an index variable, and its value range is [ n , N ]; Z 2= P [4][ l ] indicates the first l The target slot number of the root copper ring.

[0013] 3) Regarding the first l When arranging the copper rings, it should be determined whether the path has already been selected; Let the first l The first copper ring selects the clamp channel. m Layer n The column is calculated using the following formula. S p [ m ][ n ][ z ]: (8); In equation (8), P [1][ l ] is the first l The starting slot number of the root copper ring; P [3][ l ] is the first l The direction of rotation of the copper ring; P [4][ l ] is the first l The target slot number of the root copper ring; for the first l Root copper ring, S p [ m ][ n ][ z The value should be 0.

[0014] In step 4, with 6 a The objective function is to minimize the total distance traversed by the copper core, defined as follows: The distance between a single copper ring is defined as follows: (9); In equation (9), l =1, 2, ..., 6 a , respectively representing the 1st, 2nd, ..., 6th a Root copper ring; Indicates the first l The winding distance of the copper ring.

[0015] The objective function is defined as follows: (10); In equation (10),i =1, 2, ..., 6, representing the six phases A, B, C, AN, BN, and CN respectively; j =1, 2, ..., a , respectively representing the 1st, 2nd, ..., of each phase. a A side road. L t This indicates the total winding distance of all copper rings; Indicates the first i The first phase j The distance of the copper ring around each branch road.

[0016] Step 5 includes the following steps: Step 5.1: Generate the initial population P ; Step 5.2: Calculate the fitness function for each individual; Step 5.3: Eliminate half of the individuals and regenerate them, then update the individuals using probability factors; Step 5.4: Determine if the termination condition is met. If it is, output the optimal solution; otherwise, return to step 5.2.

[0017] Step 5.1 includes the following steps: Step 5.1.1: Define the direction set X 1 = Ø Channel set X 2 = Ø ; Ø This indicates that the set is initialized to an empty set.

[0018] Step 5.1.2: Determine the first... l Check if there is a usable channel on the root copper ring. If yes, proceed to step 5.1.3; otherwise, proceed to step 5.1.1. Step 5.1.3: Based on the available channel matrix A t Randomly select the direction and available channel, and the first l The direction and channel selected for the root copper ring are recorded in... X 1 and X 2 The l One location; Step 5.1.4: Update the available channel matrix A t ; Step 5.1.5: Determine if there are any remaining copper rings. If yes, proceed to step 5.1.2; otherwise, proceed to step 5.1.6. Step 5.1.6: X1 The elements are written in order in P The 3rd line, X 2 The elements are written in order in P The second line.

[0019] Let the population size be NX Repeat the above steps. NX This will generate the initial population and population set. P ={ P 1, P 2, ..., P NX}, P 1, P 2, ..., P NX They represent the 1st, 2nd, ..., th in the population, respectively. NX Individual.

[0020] In step 5.3, the probability factors introduced are as follows: (1) Probability of direction selection p 1, p 1∈[0,1], with p The probability of 1 is selected from the available directions such that the distance of the copper ring is less than 1. Z / 2 direction.

[0021] (2) Channel selection probability p 2, p 2∈[0,1], the distance between the starting point and the ending point is less than Z / 4 copper ring, with p The probability of 2 is randomly selected from the available inner channels.

[0022] To ensure the ergodicity of the initial population, start by... p 1. p 2 is set to 0.5, and then increases linearly with the number of iterations, as shown below: (11); (12); In the above formula, p 11 , p 12 Choose probability values ​​for the initial and final directions, respectively; p 21 , p 22 To select probability values ​​for the initial and final channels, respectively; ger This represents the total number of iterations. iter This represents the current iteration number.

[0023] This invention discloses an optimization method for the arrangement of busbar copper rings in large-scale hydroelectric generators based on a random search algorithm and a greedy strategy. The technical effects are as follows: 1) This invention establishes a mathematical model for the optimal arrangement of generator busbar copper rings, transforming complex spatial information into a mathematical form.

[0024] 2) This invention realizes an automatic generator busbar copper ring arrangement scheme, which makes up for the high error rate of manual busbar arrangement scheme and successfully improves production efficiency.

[0025] 3) There is a significant difference between manual wiring schemes and ideal winding paths, especially when the slot spacing of large generators is large, which can easily lead to a large amount of material waste. The solution algorithm designed in this invention is very close to the optimal solution, significantly improving material utilization and enhancing economic efficiency.

[0026] 4) This invention effectively solves the problems of low efficiency and serious material waste in traditional copper ring wiring methods, significantly improves the efficiency of copper ring merging, and is particularly suitable for large hydroelectric generators with large structures, complex channels and numerous parallel branches. Attached Figure Description

[0027] The present invention will be further described below with reference to the accompanying drawings and embodiments: Figure 1 for M =7, N =2 is a schematic diagram of the clamp channel.

[0028] Figure 2 This is a flowchart of the algorithm for solving the problem in this invention.

[0029] Figure 3 For different p A diagram illustrating the impact of the value 1 on generating a scheme.

[0030] Figure 4 For different p A diagram illustrating the impact of the value of 2 on generating a scheme.

[0031] Figure 5 The convergence curve of the solution algorithm is shown.

[0032] Figure 6 This is a comparison diagram of the bus copper winding scheme solved by the embodiment of the present invention and the manual scheme.

[0033] Figure 7 This is a schematic flowchart of the optimized bus copper ring scheme of the present invention. Detailed Implementation

[0034] To make the technical solution of the present invention clearer, the present invention will be further described below with reference to the accompanying drawings: An optimization method for the arrangement of busbar copper rings in large hydroelectric generators based on random search algorithm and greedy strategy includes the following steps: The first step is to establish a model of the bus copper ring layout scheme: (1): Define the coordinates, slot number coding direction, and copper ring spacing: Define coordinates: The position of each stator slot is fixed and evenly distributed in the stator core. Since the radial diagram of the generator stator is circular, the stator slot number is used to define the coordinates to represent the position information. Define the slot numbering direction: According to motor manufacturing specifications and standards, stator slots are numbered clockwise. Select one stator slot and define its coordinate as 0, with slots numbered 1, 2, ... clockwise. Z -1; Define the distance between copper rings: The distance the copper rings travel is represented by the number of slots the copper rings pass through in the stator.

[0035] (2): Definition of the starting slot number of the copper ring; (3): Definition of copper ring clamp channel: The wire clamps are evenly distributed on the circumferential surface of the stator, and each wire clamp has M layer N A series of channels are used to support the copper rings. After the conductor bars are wound in the stator slots, they converge to their respective outlets through the copper rings. The channel closest to the generator is designated as the inner channel, and the channel furthest from the generator as the outer channel. First, a channel is selected to lead into the clamp. This process requires first introducing the copper ring to the same height as the selected channel, and then horizontally introducing it into the selected channel. Next, the rotation direction of the copper ring is selected, i.e., clockwise or counterclockwise. Finally, the copper ring is led out of the clamp at the corresponding outlet position. Each phase's copper ring can only choose its corresponding outlet; outlets of other phases cannot be selected. During winding, the copper ring cannot change channels, and there must be no path collisions. For the first... N Columns, from level 1 to level 2 M The layers are denoted as follows: M ( N -1)+1, M ( N -1)+2,..., MN The copper ring clamp channel is defined as follows: (2); M =7, N =2 wire clamp channel diagram as shown Figure 1 As shown.

[0036] (4): Definition of the direction of rotation of the copper ring: The copper ring can only rotate clockwise or counterclockwise. Clockwise rotation is recorded as 1, and counterclockwise rotation as 0, as shown below: (3); (5): Definition of copper ring arrangement scheme: For a copper ring bus scheme, four pieces of information need to be determined: the starting slot number, the bus channel, the rotation direction, and the target slot number. A parallel branch requires 6 copper rings. a The number of copper rings required for each parallel branch is 6. a One. Define the copper ring bus scheme as... P [ k ][ l ], as shown below: (4); The second step is to establish a spatial information model of the busbar copper ring: The number of layers of the wire clamp is M The number of columns is N The number of slots is Z Then the entire space can be divided into M × N × Z Each grid can define the entire spatial information as... S p [ m ][ n ][ z The occupancy status of spatial information is represented as follows: (5); In the formula, m =1, 2, ..., M , respectively representing the 1st, 2nd, ..., of the wire clamps. M layer; n =1, 2, ..., N , respectively representing the 1st, 2nd, ..., of the wire clamps. N List; z =1, 2, ..., Z , respectively representing the 1st, 2nd, ..., Z One slot.

[0037] 6 a Root copper ring and M × N The availability relationship of each channel is defined as follows: A t ,but A t 6 a OK M × N A matrix of columns, where each element is denoted as . at lc , No. iThe elements of the row represent the first row. i The root copper ring is available in all channels as follows:

[0038] .

[0039] The third step is to construct the constraints for the bus copper ring: (1) When the copper ring is introduced into the wire clamp channel, if the first l Root copper ring selection z Slot No. 1 m Layer, First n If the channel is blocked, the copper ring will block the first channel. m All inner channels of the layer. If other copper rings are selected in a direction that passes through this location, then this slot cannot be selected. m The first column of the layer to the second column n The column, that is, after the copper ring is arranged, needs to be the first of the slots. m The first column of the layer to the second column n The column space information is set to zero, as shown below: (6); In the formula, z 1= P [1][ l ] indicates the first l The starting slot number of the root copper ring.

[0040] (2) When the copper ring is led out from the wire clamp channel, if the first l Root copper ring selection z Slot No. 1 m Layer, First n If the channel is blocked, the copper ring will block the first channel. m All outer channels of the layer. If other copper rings are selected in a direction that passes through this location, then this slot cannot be selected. m The first layer n Listed to number N The column, that is, after the copper ring is arranged, needs to be the first of the slots. m The first layer n Listed to number N The column space information is set to zero, as shown below: (7); (3) There can be no path collisions between the copper rings; that is, only one copper ring can exist on the path from the wire clamp to the wire outlet at the same time. Therefore, for the first... l When arranging the copper rings, it should be determined whether the path has already been selected. Let the first copper ring be... l The first copper ring selects the clamp channel. m Layer n The column is calculated using the following formula. Sp [ m ][ n ][ z ]: (8); In the formula, P [1][ l ] is the first l The starting slot number of the root copper ring; P [3][ l ] is the first l The direction of rotation of the copper ring; P [4][ l ] is the first l The target slot number of the root copper ring. For the first... l Root copper ring, S p [ m ][ n ][ z The value should be 0.

[0041] Fourth step, establish the optimization objective function: The distance between a single copper ring is defined as follows: (9); With 6 a The objective function is to minimize the total distance traversed by the copper core, defined as follows: (10); Fifth, optimize the solution using a combination of a random search algorithm and a greedy strategy: (1): Generate the initial population P : (1.1): Define the set of directions X 1 = Ø Channel set X 2 = Ø ; (1.2): Determine the first i Is there a usable channel in the root copper ring? If yes, proceed to step (1.3); otherwise, proceed to step (1.1).

[0042] (1.3): Based on the available channel matrix A t Randomly select the direction and available channel, and the first i The direction and channel selected for the root copper ring are recorded in... X 1 and X 2 The i One position.

[0043] (1.4): Update the available channel matrix A t ; (1.5): Determine if there are any remaining copper rings. If yes, proceed to step (1.2); otherwise, proceed to step (1.6). (1.6): X 1 The elements are written in order in P The 3rd line, X 2 The elements are written in order in P The second line.

[0044] Let the population size be NX Repeat the above steps. NX The initial population can be generated in one step. Population set P ={ P 1, P 2, ..., P NX}

[0045] (2): Calculate the fitness function for each individual; (3): Eliminate half of the individuals and regenerate them, then update the individuals using probability factors: (3.1): Probability of direction selection p 1, p 1∈[0,1]. p The probability of 1 is selected from the available directions such that the distance of the copper ring is less than 1. Z / 2 direction.

[0046] (3.2): Channel selection probability p 2, p 2∈[0,1]. The distance between the starting point and the ending point is less than [0,1]. Z / 4 copper ring, with p The probability of 2 is randomly selected from the available inner channels.

[0047] To ensure the ergodicity of the initial population, start by... p 1. p 2 is set to 0.5, and then increases linearly with the number of iterations, as shown below: (11); (12); In the formula, p 11 , p 12 Choose probability values ​​for the initial and final directions, respectively; p 21 ,p 22 To select probability values ​​for the initial and final channels, respectively; ger This represents the total number of iterations. iter This represents the current iteration number.

[0048] Regarding the channel selection mechanism, the previous method of randomly selecting all available channels from all copper rings was changed to: the distance between the start and end points being less than... Z / 4 of p The available inner channel is selected with a probability of 1. If no inner channel is available, another available channel is randomly selected. (Modify) p The experiment was conducted with a value of 1, and the results are as follows: Figure 3 As shown.

[0049] Regarding the direction selection mechanism, the random selection of available directions for all copper rings is changed to: […]. p A probability of 2 makes the copper ring spacing less than 1. Z / 2 direction, with (1- p 2) The probability selection makes the copper ring spacing greater than Z / 2 direction. Select this direction when only one direction is available. Modify. p The experiment was conducted with a size of 2, and the results are as follows: Figure 4 As shown.

[0050] (4): Determine whether the termination condition is met. If it is met, output the optimal solution; otherwise, return (2).

[0051] Example: Based on the number of slots Z =240, number of parallel branches a =4, Number of cable clamp channel layers M =7, number of columns N Taking =2 as an example, this structure represents a typical large-scale hydropower unit layout scenario in engineering, presenting practical difficulties such as complex channels, long wiring paths, and a high probability of path conflicts. The starting and ending points of each phase are shown in Table 1. According to... Figure 2 The greedy random search algorithm shown performs multiple rounds of iterative optimization on the copper ring arrangement path while satisfying spatial constraints, and finally obtains a convergent result. Its convergence curve is shown in Figure 1. Figure 5 As shown.

[0052]

[0053] The solved bus copper winding scheme and the manual scheme are compared as follows: Figure 6 As shown in Table 2, to further quantify the performance advantages and disadvantages of the two schemes, statistical analysis was performed on their total winding distance and deviation from the ideal path.

[0054]

[0055] As shown in Table 2, the scheme obtained using the greedy random search algorithm proposed in this invention has a significantly shorter total winding path than the manual arrangement scheme, and differs from the theoretical optimal path by only 14 slots, almost reaching the optimal solution. Compared with the manual winding scheme, the total distance of the copper rings is significantly lower. In large hydroelectric generators, due to their large structure, the stator core slot spacing is large. The two schemes differ by 108 slots. The algorithm-solved scheme significantly reduces the total winding length while ensuring that the constraints are met, which can significantly save materials in manufacturing.

Claims

1. A method for optimizing the arrangement of busbar copper rings in large hydroelectric generators based on random search algorithm and greedy strategy, characterized in that... Includes the following steps: Step 1: Establish a model of the bus copper ring layout scheme; Step 2: Establish a spatial information model of the bus copper ring; Step 3: Construct the constraints for the bus copper ring; Step 4: Establish the optimization objective function; Step 5: Optimize the bus copper ring layout scheme using a random search algorithm combined with a greedy strategy.

2. The method for optimizing the arrangement of large-scale hydroelectric generator busbar copper rings based on random search algorithm and greedy strategy according to claim 1, characterized in that: Step 1 includes: 1.1: Define the coordinates, slot number coding direction, and copper ring spacing: Define coordinates: Use stator slot numbers to define coordinates to represent position information; Define the slot numbering direction: Number the stator slots in a clockwise direction. Select one stator slot and define its coordinate as 0, then sequentially assign 1, 2, ... in a clockwise direction. Z -1, Z Indicates the number of stator slots; Define the copper winding distance: The distance the copper winding passes through is expressed by the number of slots the copper passes through; 1.2: Definition of the starting slot number for the copper ring: The coordinate position information of the copper ring is available. Z The groups are formed, but the relative positions of the bars within each group remain unchanged; the starting position of the copper ring is defined as... S t [ z ][ i ][ j ],Will Z The starting position of each group is recorded. S t [ z ][ i ][ j In the middle; when the coordinate position exceeds the defined zero point, that is, the coordinate is greater than 0. Z When the value is -1, the coordinate is reset to zero and the count restarted, as shown below: （1）； In formula (1): z =1, 2, ..., Z, representing the... z Group coordinates; i =1, 2, ..., 6, representing the six phases A, B, C, AN, BN, and CN respectively; j =1, 2..., a , respectively representing the 1st, 2nd, ..., of each phase. a One parallel branch; 1.3: Definition of copper ring clamp channel: Each clamp channel has M layer N In the column, the number of channels for each clamp is... M × N For the first, N Columns, from level 1 to level 2 M The layers are denoted as follows: M ( N -1)+1, M ( N -1)+2,..., MN The copper ring clamp channel is defined as: （2）； 1.4: Definition of the direction of rotation of the copper ring: The copper ring can only rotate clockwise or counterclockwise. Clockwise rotation is recorded as 1, and counterclockwise rotation as 0, as shown below: （3）； In formula (3): i =1, 2, ..., 6, representing the six phases A, B, C, AN, BN, and CN respectively; j =1, 2..., a , respectively representing the 1st, 2nd, ..., of each phase. a One parallel branch; Indicates the first i Xiangdi j The copper ring system of each parallel branch is oriented in the direction of the circuit. 1.5: Definition of Copper Ring Arrangement Scheme: For a copper ring busbar scheme, four pieces of information are determined: the starting slot number of the copper ring, the busbar channel, the rotation direction, and the target slot number.

3. The method for optimizing the arrangement of busbar copper rings for large hydroelectric generators based on a random search algorithm and a greedy strategy as described in claim 2, characterized in that: If a parallel branch requires 6 copper rings, then... a The number of copper rings required for each parallel branch is 6. a One; the copper ring bus scheme is defined as P [ k ][ l ], as shown below: （4）； In equation (4): k =1, 2, 3, 4, representing the starting slot number, confluence channel, rotation direction, and target slot number of the copper ring, respectively; l =1, 2, ..., 6 a , respectively representing the 1st, 2nd, ..., 6th a Root copper ring.

4. The method for optimizing the arrangement of busbar copper rings for large hydroelectric generators based on a random search algorithm and a greedy strategy as described in claim 3, characterized in that: In step 2, the spatial information is defined as follows: The number of layers of the wire clamp is M The number of columns is N The number of slots is Z Then the entire space can be divided into M × N × Z Each grid can define the entire spatial information as... S p [ m ][ n ][ z The occupancy status of spatial information is represented as follows: （5）； In formula (5): m =1, 2, ..., M , respectively representing the 1st, 2nd, ..., of the wire clamps. M layer; n =1, 2, ..., N , respectively representing the 1st, 2nd, ..., of the wire clamps. N List; z =1, 2, ..., Z , respectively representing the 1st, 2nd, ..., Z One slot.

5. The method for optimizing the arrangement of busbar copper rings for large hydroelectric generators based on a random search algorithm and a greedy strategy according to claim 4, characterized in that: 6 a Root copper ring and M × N The ability of each channel to be defined by a relationship is: A t ,but A t 6 a OK M × N A matrix of columns, where each element is denoted as . at ij , No. i The elements of the row represent the first row. i The root copper ring is available in all channels as follows: ； 。 6. The method for optimizing the arrangement of busbar copper rings for large hydroelectric generators based on random search algorithm and greedy strategy according to claim 5, characterized in that: In step 3, the constraints are as follows: 1) After arranging the copper rings, the groove needs to be... m The first column of the layer to the second column n The column space information is set to zero, as shown below: （6）； In formula (6): Indicates the first z 1 slot in the m Layer n The occupancy status of one channel; It is an index variable, and its value range is [1, ..., ...]. n ]; z 1= P [1][ l ] indicates the first l The starting slot number of the root copper ring; 2) After arranging the copper rings, the groove needs to be... m The first layer n Listed to number N The column space information is set to zero, as shown below: （7）； In equation (7): Indicates the first z 2 slots in the m Layer n The occupancy status of the two channels; n 2 is an index variable, and its value range is [ n , N ]; Z 2= P [4][ l ] indicates the first l The target slot number of the root copper ring; 3) Regarding the first l When arranging the copper rings, it should be determined whether the path has already been selected; set up No. l The first copper ring selects the clamp channel. m Layer n The column is calculated using the following formula. S p [ m ][ n ][ z ]: （8）； In equation (8), P [1][ l ] is the first l The starting slot number of the root copper ring; P [3][ l ] is the first l The direction of rotation of the copper ring; P [4][ l ] is the first l The target slot number of the root copper ring; for the first l Root copper ring, S p [ m ][ n ][ z The value should be 0.

7. The method for optimizing the arrangement of busbar copper rings for large hydroelectric generators based on a random search algorithm and a greedy strategy as described in claim 6, characterized in that: In step 4, with 6 a The objective function is to minimize the total distance traversed by the copper core, defined as follows: The distance between a single copper ring is defined as follows: （9）； In equation (9), l =1, 2, ..., 6 a , respectively representing the 1st, 2nd, ..., 6th a Root copper ring; Indicates the first l The winding distance of the copper ring; The objective function is defined as follows: （10）； In equation (10), i =1, 2, ..., 6, representing the six phases A, B, C, AN, BN, and CN respectively; j =1, 2, ..., a , respectively representing the 1st, 2nd, ..., of each phase. a A branch road; L t This indicates the total winding distance of all copper rings; Indicates the first i The first phase j The distance of the copper ring around each branch road.

8. The method for optimizing the arrangement of busbar copper rings for large hydroelectric generators based on a random search algorithm and a greedy strategy as described in claim 7, characterized in that: Step 5 includes the following steps: Step 5.1: Generate the initial population P ; Step 5.2: Calculate the fitness function for each individual; Step 5.3: Eliminate half of the individuals and regenerate them, then update the individuals using probability factors; Step 5.4: Determine if the termination condition is met. If it is, output the optimal solution; otherwise, return to step 5.

2.

9. The method for optimizing the arrangement of busbar copper rings for large hydroelectric generators based on a random search algorithm and a greedy strategy as described in claim 8, characterized in that: Step 5.1 includes the following steps: Step 5.1.1: Define the direction set X 1 = Ø Channel set X 2 = Ø ; Ø This indicates that the set is initialized to an empty set; Step 5.1.2: Determine the first... l Check if there is a usable channel in the root copper ring; if so, proceed to step 5.1.3, otherwise proceed to step 5.1.

1. Step 5.1.3: Based on the available channel matrix A t Randomly select the direction and available channel, and the first l The direction and channel selected for the root copper ring are recorded in... X 1 and X 2 The l One location; Step 5.1.4: Update the available channel matrix A t ; Step 5.1.5: Determine if there are any remaining copper rings; if yes, proceed to step 5.1.2, otherwise proceed to step 5.1.6; Step 5.1.6: X 1 The elements are written in order in P The 3rd line, X 2 The elements are written in order in P The second line; Let the population size be NX Repeat the above steps. NX This allows the generation of an initial population and a population set. P ={ P 1, P 2, ..., P NX }, P 1, P 2, ..., P NX They represent the 1st, 2nd, ..., th in the population, respectively. NX Individual.

10. The method for optimizing the arrangement of busbar copper rings for large hydroelectric generators based on a random search algorithm and a greedy strategy according to claim 8, characterized in that: In step 5.3, the probability factors introduced are as follows: (1) Probability of direction selection p 1, p 1∈[0,1], with p The probability of 1 is selected from the available directions such that the distance of the copper ring is less than 1. Z / 2 direction; (2) Channel selection probability p 2, p 2∈[0,1], the distance between the starting point and the ending point is less than Z / 4 copper ring, p The probability of 2 is randomly selected from among the available inner channels; To ensure the ergodicity of the initial population, start by... p 1. p 2 is set to 0.5, and then increases linearly with the number of iterations, as shown below: （11）； （12）； In the above formula, p 11 , p 12 Choose probability values ​​for the initial and final directions, respectively; p 21 , p 22 To select probability values ​​for the initial and final channels, respectively; ger This represents the total number of iterations. iter This represents the current iteration number.

Images