Optimal layout method of wind turbines in offshore wind farms based on genetic algorithm
Through the method based on genetic algorithm, the fan arrangement of offshore wind farms is automatically optimized, which solves the problems of power generation loss and insufficient utilization of sea area in the prior art, and achieves efficient and reliable fan arrangement, which is suitable for the actual needs of offshore wind farms.
Patent Information
- Application Number
- CN202211240875.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-10-11
- Publication Date
- 2024-11-12
- Estimated Expiration
- 2042-10-11
AI Technical Summary
The prior art cannot effectively realize the optimal layout of offshore wind farm fans, resulting in insufficient power generation loss and sea area utilization. Relying on manual experience and automatic optimization of local modules, it is impossible to achieve optimal design.
Using a genetic algorithm-based method, by setting boundary conditions, discrete wind farms, randomly selecting fan layout schemes, calculating fitness, crossover and variation, iterative calculations are automatically iterated to optimize fan layout, reduce manual intervention, and meet the power generation of the entire wind farm. Pros and cons.
It realizes fully automated fan optimization layout, reduces manual operation, improves calculation efficiency and result reliability, is highly adaptable, is suitable for actual construction of offshore wind farms, has fast calculation speed, can effectively avoid restricted areas, and obtains relatively regular fan layout plan.
Smart Images

Figure CN115688336B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of wind power generation, and in particular to a method for optimizing the layout of wind turbines in an offshore wind farm based on a genetic algorithm. Background Art
[0002] The layout of wind turbines in offshore wind farms mainly solves the contradiction between the distance between wind turbines, the wake effect and the sea area occupied. On the one hand: the existence of the wake effect of offshore wind farms requires that there should be sufficient spacing between wind turbines to ensure that the mutual influence between the positions is minimized and a higher power generation is achieved. On the other hand, the planned sea area constraint requires that the spacing between wind turbines cannot be too large. For the array layout of offshore wind farms, the traditional solution is to ensure that the spacing in the prevailing wind direction is larger and the spacing perpendicular to the main wind direction is smaller. This empirical method suppresses the power generation loss caused by the wake to a certain extent, but it relies too much on the experience of engineers and cannot be exhaustive and optimal.
[0003] There are many software related to power generation calculation in the field of wind power, such as WAsP, WindPRO, WindFarmer, WindSim and Meteodyn WT, but the existing software cannot realize the optimal layout calculation of wind turbines; most of the offshore wind power survey and design companies nowadays still mainly use traditional manual optimization or local module automatic optimization methods in the micro-site selection stage of offshore wind farms, which cannot reflect the design superiority. Summary of the invention
[0004] The purpose of the present invention is to address the defects of the prior art and provide a method for optimizing the layout of wind turbines in offshore wind farms based on genetic algorithms. The method is improved based on genetic algorithms and is a method for fully automatic iterative calculation that does not require excessive human intervention. The method arranges wind turbines according to the overall power generation of the wind farm. Applying it to the layout of offshore wind turbines can better solve the problems mentioned above.
[0005] The technical solution of the present invention is: a method for optimizing the layout of wind turbines in an offshore wind farm based on a genetic algorithm, comprising:
[0006] Step 1, set boundary conditions, total number of cycles and convergence requirements;
[0007] Step 2, discretize the wind farm into multiple grid sequences;
[0008] Step 3, determining the relative position relationship between the grid node in step 2 and the restricted area, and deleting the grid node if it is within the restricted area;
[0009] Step 4: randomly select N grid nodes in the grid sequence of step 3 according to the number of wind turbines N required by the wind farm, and arrange the wind turbines at the selected grid nodes, and encode the grid sequence of step 3 to form a wind turbine arrangement scheme S1 represented by the code;
[0010] Step 5, repeat step 4 until x fan layout schemes are selected, wherein the x fan layout schemes constitute an initial population X, wherein the initial population X = (S1, S2, S3 ... S x );
[0011] Step 6, taking the power generation of the entire wind farm taking the wake into consideration as the fitness value, respectively calculating the fitness of various layout schemes in step 5, and sorting them in descending order according to the fitness, and storing the optimal layout scheme;
[0012] Step 7, the optimal layout scheme is passed on to the next generation, and the remaining schemes are cross-calculated in pairs;
[0013] Step 8, performing mutation calculation in each scheme formed by completing the crossover calculation, so that the scheme after mutation and the optimal arrangement scheme in step 7 form a new offspring population;
[0014] Step 9, calculate the fitness of the new offspring population respectively, and sort them in descending order according to the fitness, compare the fitness of each solution with the fitness value of the solution stored in step 6, and take the solution with the largest fitness value as the optimal layout solution and replace the original stored solution;
[0015] Step 10, repeating steps 7 to 9, and stopping the calculation when the number of cycles reaches the set value or the power generation of the optimal layout scheme reaches the convergence requirement;
[0016] Step 11, decode and output the stored solution.
[0017] Preferably, in step 1, setting the boundary conditions includes:
[0018] Set the wind resource data of the wind farm, the number of wind turbines N required for the wind farm, the applicable wind turbine model parameters, the wind turbine power curve, the row spacing D1 of the wind turbines, the column spacing D2 of the wind turbines and the dominant wind direction of the wind farm.
[0019] Preferably, in step 2, discretizing the wind farm into a plurality of grid sequences comprises:
[0020] According to the given wind farm range and the dominant wind direction of the wind farm, the wind farm is discretized into m×n grid sequences, wherein the length and width of the grid sequence are set as required.
[0021] More preferably, the restricted area includes a shipwreck area and a reef area.
[0022] Preferably, in step 4, when selecting grid nodes to arrange fans, the fan column spacing should meet the fan safety distance D2, and the fan row spacing should meet the set fan row spacing D1. When the fan column spacing or row spacing does not meet the requirements, delete the corresponding node and reselect the grid node to arrange the fans.
[0023] Preferably, in step 4, encoding the grid sequence of step 3 includes:
[0024] The grid nodes where wind turbines are deployed are coded with binary digits “1”, and the grid nodes where wind turbines are not deployed are coded with binary digits “0”.
[0025] Preferably, the step 6 further comprises:
[0026] The energy density, theoretical power generation, average wind speed considering the wake effect, power generation considering the wake and wake loss coefficient of each scheme in the group are calculated.
[0027] Preferably, storing the optimal arrangement solution in step 6 includes:
[0028] Stores the position coordinates, position number, energy density, theoretical power generation, average wind speed considering wake effect, power generation considering wake and wake loss coefficient.
[0029] Preferably, in step 7, during the crossover process, if the genes at corresponding positions in the two individuals are the same, that is, both gene points are equipped with fans or neither is equipped with fans, then they will be retained; if the genes at corresponding positions in the two individuals are different, that is, one individual has a fan and the other individual does not have a fan at the gene point, then a random number is generated by a random function, and when the random number is less than the preset probability Pc, the genes at the corresponding positions are crossover calculated.
[0030] Preferably, in step 8, performing variation calculation in each solution formed by completing crossover calculation includes:
[0031] Traverse each layout scheme gene and generate a random number through a random function. When the random number is less than the preset probability Pm, the gene at the corresponding position mutates, that is, the "0" gene mutates to "1" or the "1" gene mutates to "0".
[0032] The beneficial effects of the present invention are:
[0033] 1 This method is improved based on genetic algorithm. It is a method of fully automatic iterative calculation without excessive human intervention. It arranges wind turbines according to the overall power generation of the wind farm. It can fully automatically calculate the optimal layout of wind turbines in offshore wind farms. Applying it to the layout of offshore wind turbines can reduce manual operations and liberate productivity.
[0034] 2. This method has a clear process, strong operability, and a good theoretical basis. It can be combined with various wake calculation models such as Jensen to output parameters such as wind turbine coordinates required by users, and the calculation results have good reliability.
[0035] 3. This method has strong adaptability. In the process of completing the optimized layout of wind turbines, this method will automatically avoid the restricted layout area; and the wind turbine layout plan obtained by this method is more regular and more suitable for the actual construction of offshore wind farms.
[0036] 4. The calculation speed of this method is fast and controllable. In the process of completing the optimal layout of the fans, changing the row spacing and column spacing of the fans will effectively change the calculation speed of this method and meet the safety spacing requirements of the fans. BRIEF DESCRIPTION OF THE DRAWINGS
[0037] Figure 1 This is a schematic diagram of the core process of the present invention;
[0038] Figure 2 This is a schematic diagram of the wind farm grid result of the present invention;
[0039] Figure 3 This is a schematic diagram of the optimal layout of the wind farm of the present invention. DETAILED DESCRIPTION
[0040] In order to make the technical problems, technical solutions and beneficial effects to be solved by the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.
[0041] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.
[0042] It should be understood that when used in the present specification and the appended claims, the term "comprising" indicates the presence of described features, wholes, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or combinations thereof.
[0043] It should also be understood that the term “and / or” used in the specification and appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes these combinations.
[0044] As used in the specification and appended claims of this application, the term "if" can be interpreted as "when" or "uponce" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrase "if it is determined" or "if [described condition or event] is detected" can be interpreted as meaning "uponce it is determined" or "in response to determining" or "uponce [described condition or event] is detected" or "in response to detecting [described condition or event]", depending on the context.
[0045] In addition, in the description of the present application specification and the appended claims, the terms "first", "second", "third", etc. are only used to distinguish the descriptions and cannot be understood as indicating or implying relative importance.
[0046] References to "one embodiment" or "some embodiments" etc. described in the specification of this application mean that one or more embodiments of the present application include specific features, structures or characteristics described in conjunction with the embodiment. Therefore, the statements "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments", etc. that appear in different places in this specification do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways. The terms "including", "comprising", "having" and their variations all mean "including but not limited to", unless otherwise specifically emphasized in other ways. "Multiple" means "two or more".
[0047] Embodiment 1
[0048] Figure 1 Shows a preferred embodiment of the present application ( Figure 1 The core flow diagram of a method for optimizing the arrangement of wind turbines in an offshore wind farm based on a genetic algorithm is shown in the first embodiment of the present application. For ease of explanation, only the part related to the present embodiment is shown, which includes the following steps:
[0049] Step 1: Set boundary conditions. Boundary conditions include wind resource data of wind farm, number of wind turbines required in wind farm N, applicable wind turbine model parameters, wind turbine power curve, row spacing D1 of wind turbines, column spacing D2 of wind turbines, and dominant wind direction of wind farm. Set the total number of cycles and convergence requirements.
[0050] Step 2: Discretize the wind farm. According to the given wind farm range and dominant wind direction, discretize it into m×n grid sequences. The length and width of the grid are set as needed, and wind turbines are arranged at grid nodes.
[0051] Step 3: Exclude restricted areas. Offshore wind farms should be built away from areas where they cannot be deployed, such as shipwrecks and reefs. Determine the relative positional relationship between the grid node in step 2 and the restricted area. If the grid node is within the restricted area, delete it.
[0052] Step 4, selection and encoding. According to the number of wind turbines N required for the wind farm, randomly select N nodes in the grid sequence of step 3, and arrange the wind turbines at the selected nodes. When selecting grid nodes to arrange wind turbines, the spacing between wind turbine columns should meet the wind turbine safety distance D2; at the same time, the spacing between wind turbine rows D1 can be set. When the spacing between wind turbines does not meet the requirements, delete the corresponding node and reselect. Encode the grid sequence of step 3, encode the grid nodes where wind turbines are arranged with binary digits "1", and encode the grid nodes where wind turbines are not arranged with binary digits "0". The encoded nodes are called genes. When all gene encodings are completed, a wind turbine arrangement scheme S1 is formed, also called an individual S1. For example, the gene encoding of an individual S1 is (1 0 1 01······1 1), the encoding "1" indicates that a wind turbine is arranged at the gene point, the encoding "0" indicates that the gene is not arranged with a wind turbine, and the total number of "1" genes is the number of wind turbines N required for the wind farm.
[0053] Step 5: Repeat step 4 until x fan layout schemes are selected, and the x fan layout schemes constitute the initial population. For example, a population X = (S1, S2, S3...S x ).
[0054] Step 6, calculate the fitness. Use the improved Jensen model (this is a wind farm power generation calculation model, other models can also be selected) to calculate the energy density, theoretical power generation, average wind speed considering the wake effect, power generation considering the wake, and wake loss coefficient of each scheme in the group. Take the power generation of the entire wind farm considering the wake as the fitness value, calculate the fitness of various layout schemes respectively, and sort them in descending order according to the fitness, and store the results of the optimal scheme's position coordinates, position number, energy density, theoretical power generation, average wind speed considering the wake effect, power generation considering the wake, and wake loss coefficient in variable A.
[0055] Step 7, crossover calculation. Before the crossover calculation, the elite retention strategy is first executed to pass the optimal layout plan to the next generation, and the remaining plans are crossed in pairs. During the crossover process, if the genes at the corresponding positions in the two individuals are the same, that is, the gene points are both equipped with fans or neither is equipped with fans, they will be retained. For different genes, that is, one individual has a fan and the other individual does not have a fan at the gene point, a random number is generated by a random function. When the random number is less than the probability Pc (user-defined), the corresponding position gene is crossover calculated. During the crossover calculation process, the total number of fans in each plan must be guaranteed to remain unchanged, and the fan spacing in each plan must be calculated, and the plans that do not meet the fan spacing requirements must be deleted.
[0056] Step 8, mutation calculation. In order to jump out of the local optimal solution, mutation calculation is performed in each scheme formed after the crossover calculation. Traverse the genes of each layout scheme, generate random numbers through a random function, and when the random number is less than the probability Pm (user-defined), the gene at the corresponding position mutates, and the "0" gene mutates to "1" or the "1" gene mutates to "0". In the process of mutation calculation, it is necessary to ensure that the total number of fans in each scheme remains unchanged, and the fan spacing in each scheme must be calculated, and the schemes whose fan spacing does not meet the requirements are deleted. The schemes after the mutation are completed and the schemes that implement the elite retention strategy form a new offspring group.
[0057] Step 9, calculate the fitness. Calculate the fitness of the new offspring population respectively, and sort them in descending order according to the fitness, compare the fitness of each solution with the fitness value of the solution in variable A, and if the former has a larger fitness, replace the solution in variable A with the former.
[0058] Step 10: Repeat steps 7 to 9. Stop the calculation when the number of cycles reaches the set value or the power generation of the optimal solution reaches the convergence requirement.
[0059] Step 11, decoding. The station coordinates, station number, energy density, theoretical power generation, average wind speed considering the wake effect, power generation considering the wake, and wake loss coefficient of the scheme in variable A are saved and output.
[0060] Embodiment 2
[0061] This embodiment provides an embodiment for a certain offshore wind power project. The wind farm scope of the offshore wind power project covers an area of about 29km 2 , designed and installed 36 wind turbines with a single unit capacity of 5.5MW, the impeller diameter of the wind turbine is 155m, the hub height is 100m, and the total capacity of the project is 198MW. The air density on site is 1.137kg / m 3 , the corresponding altitude is 100m. The execution process of the method is as follows:
[0062] First, set the boundary conditions. The wind resource data of the wind farm selects 8760h data throughout the year. The number of wind turbines required by the wind farm is N=36, the applicable wind turbine impeller diameter D is 155m, the wheel height is 100m, the single unit capacity is 5.0MW, the wind turbine power curve is the power curve of MY155-5.0 under local standard conditions, the row spacing of the wind turbine is D1=5D, the column spacing of the wind turbine is D2=3D, and the dominant wind direction of the wind farm is 64 degrees north east. Set the total number of cycles to 2000 times, or set the power generation change difference to less than 0.1% to meet the convergence requirements.
[0063] Secondly, the wind farm is discretized and the restricted area is excluded. The length and width of the grid are set to 0.3D and 0.3D respectively. The wind farm grid results are as follows: Figure 2 ,The gray area in the figure is the area where the machine cannot be laid out.
[0064] Finally, the selection, encoding, crossover, and mutation operations are performed within a given number of cycles. When the number of cycles or convergence conditions are reached, the calculation stops. The optimal solution is finally obtained as follows: Figure 3 , the detailed output results are shown in Table 1. The annual power generation of the optimal solution can be increased by 6020MW*h / year compared with the original wind farm layout solution (artificial layout).
[0065] Table 1 Detailed output results obtained by genetic algorithm
[0066]
[0067]
[0068] It should be understood that the specific order or hierarchy of steps in the disclosed process is an example of an exemplary method. Based on design preferences, it should be understood that the specific order or hierarchy of steps in the process can be rearranged without departing from the scope of protection of the present disclosure. The attached method claims present the elements of the various steps in an exemplary order and are not intended to be limited to the specific order or hierarchy described.
[0069] In the above detailed description, various features are grouped together in a single embodiment to simplify the disclosure. This method of disclosure should not be interpreted as reflecting an intention that the embodiments of the claimed subject matter require more features than are clearly stated in each claim. On the contrary, as reflected in the appended claims, the invention is in a state of having less than all the features of the disclosed individual embodiments. Therefore, the appended claims are hereby expressly incorporated into the detailed description, with each claim standing on its own as a separate preferred embodiment of the invention.
[0070] The disclosed embodiments are described above to enable any person skilled in the art to implement or use the present invention. Various modifications of these embodiments are obvious to those skilled in the art, and the general principles defined herein may also be applied to other embodiments without departing from the spirit and scope of the present disclosure. Therefore, the present disclosure is not limited to the embodiments given herein, but is consistent with the broadest scope of the principles and novel features disclosed in this application.
[0071] The above description includes examples of one or more embodiments. Of course, it is impossible to describe all possible combinations of components or methods for the purpose of describing the above embodiments, but it should be recognized by those skilled in the art that the various embodiments may be further combined and arranged. Therefore, the embodiments described herein are intended to cover all such changes, modifications and variations that fall within the scope of protection of the appended claims. In addition, with respect to the term "comprising" used in the specification or claims, the word is covered in a manner similar to the term "including", just as "including," is explained as a transitional word in the claims. In addition, any term "or" used in the specification of the claims is intended to mean "non-exclusive or".
[0072] Those skilled in the art may also understand that the various illustrative logical blocks, units, and steps listed in the embodiments of the present invention may be implemented by electronic hardware, computer software, or a combination of the two. In order to clearly demonstrate the interchangeability of hardware and software, the various illustrative components, units, and steps described above have generally described their functions. Whether such functions are implemented by hardware or software depends on the specific application and the design requirements of the entire system. Those skilled in the art may use various methods to implement the described functions for each specific application, but such implementation should not be understood as exceeding the scope of protection of the embodiments of the present invention.
[0073] The various illustrative logic blocks or units described in the embodiments of the present invention can be implemented or operated by a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field programmable gate array or other programmable logic device, a discrete gate or transistor logic, a discrete hardware component, or any combination of the above. The general-purpose processor can be a microprocessor, and optionally, the general-purpose processor can also be any conventional processor, controller, microcontroller or state machine. The processor can also be implemented by a combination of computing devices, such as a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors combined with a digital signal processor core, or any other similar configuration.
[0074] The steps of the method or algorithm described in the embodiments of the present invention can be directly embedded in hardware, a software module executed by a processor, or a combination of the two. The software module can be stored in a RAM memory, a flash memory, a ROM memory, an EPROM memory, an EEPROM memory, a register, a hard disk, a removable disk, a CD-ROM, or other storage media of any form in the art. Exemplarily, the storage medium can be connected to the processor so that the processor can read information from the storage medium and can write information to the storage medium. Optionally, the storage medium can also be integrated into the processor. The processor and the storage medium can be arranged in an ASIC, and the ASIC can be arranged in a user terminal. Optionally, the processor and the storage medium can also be arranged in different components in the user terminal.
[0075] In one or more exemplary designs, the above functions described in the embodiments of the present invention can be implemented in hardware, software, firmware or any combination of the three. If implemented in software, these functions can be stored on a computer-readable medium, or transmitted in the form of one or more instructions or codes on a computer-readable medium. Computer-readable media include computer storage media and communication media that facilitate the transfer of computer programs from one place to another. The storage medium can be any available medium that can be accessed by any general or special computer. For example, such computer-readable media can include but are not limited to RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage or other magnetic storage devices, or any other medium that can be used to carry or store program codes in the form of instructions or data structures and other forms that can be read by general or special computers, or general or special processors. In addition, any connection can be appropriately defined as a computer-readable medium, for example, if the software is transmitted from a website site, server or other remote resource through a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL) or wirelessly, such as infrared, wireless and microwave, it is also included in the defined computer-readable medium. The disk and disc include compact disk, laser disk, optical disk, DVD, floppy disk and blue-ray disk. Disks usually copy data magnetically, while discs usually copy data optically with lasers. The above combination can also be included in computer readable media.
[0076] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.
Claims
1. A method for optimizing the layout of wind turbines in an offshore wind farm based on a genetic algorithm, characterized in that: include: Step 1, set boundary conditions, total number of cycles and convergence requirements; Step 2, discretize the wind farm into multiple grid sequences; Step 3, determining the relative position relationship between the grid node in step 2 and the restricted area, and deleting the grid node if it is within the restricted area, wherein the restricted area includes the shipwreck area and the reef area; Step 4: randomly select N grid nodes in the grid sequence of step 2 according to the number of wind turbines N required by the wind farm, and arrange the wind turbines at the selected grid nodes, and encode the grid sequence of step 2 to form a wind turbine arrangement scheme S1 represented by the code; Step 5, repeat step 4 until x fan layout schemes are selected, and the x fan layout schemes constitute the initial population X, and the initial population X=(S1, S2, S3 S x ); Step 6, taking the power generation of the entire wind farm taking the wake into consideration as the fitness value, respectively calculating the fitness of various layout schemes in step 5, and sorting them in descending order according to the fitness, and storing the optimal layout scheme; Step 7, the optimal layout scheme is passed on to the next generation, and the remaining schemes are cross-calculated in pairs; Step 8, performing mutation calculation in each scheme formed by completing the crossover calculation, so that the scheme after mutation and the optimal arrangement scheme in step 7 form a new offspring population; Step 9, calculate the fitness of the new offspring population respectively, and sort them in descending order according to the fitness, compare the fitness of each solution with the fitness value of the solution stored in step 6, and take the solution with the largest fitness value as the optimal layout solution and replace the original stored solution; Step 10, repeat steps 7 to 9, and stop the calculation when the number of cycles reaches the set value or the power generation of the optimal layout reaches the convergence requirement; Step 11, decoding and outputting the stored solution; In step 1, setting boundary conditions includes: Set the wind resource data of the wind farm, the number of wind turbines N required for the wind farm, the parameters of the applicable wind turbine model, the wind turbine power curve, the row spacing D1 of the wind turbines, the column spacing D2 of the wind turbines and the dominant wind direction of the wind farm; In step 2, discretizing the wind farm into a plurality of grid sequences includes: According to the given wind farm range and the dominant wind direction of the wind farm, the wind farm is discretized into m×n grid sequences, where the length and width of the grid sequence are set as required; The step 6 also includes: The improved Jensen model is used to calculate the energy density, theoretical power generation, average wind speed considering the wake effect, power generation considering the wake and wake loss coefficient of each scheme in the group; In step 7, during the crossover process, if the genes at the corresponding positions in the two individuals are the same, that is, both gene points are equipped with fans or neither is equipped with fans, then they are retained; if the genes at the corresponding positions in the two individuals are different, that is, one individual has a fan and the other individual does not have a fan at the gene point, then a random number is generated by a random function, and when the random number is less than the preset probability Pc, the gene at the corresponding position is cross-calculated; In step 8, performing variation calculation in each solution formed by completing crossover calculation includes: Traverse each layout plan gene and generate a random number through a random function. When the random number is less than the preset probability Pm, the gene at the corresponding position mutates, that is, the "0" gene mutates to "1" or the "1" gene mutates to "0".
2. The method for optimizing the layout of wind turbines in an offshore wind farm based on a genetic algorithm according to claim 1, characterized in that: In step 4, when selecting grid nodes to arrange fans, the fan column spacing should meet the fan safety distance D2, and the fan row spacing should meet the set fan row spacing D1. When the fan column spacing or row spacing does not meet the requirements, delete the corresponding node and reselect the grid node to arrange the fan.
3. The method for optimizing the layout of offshore wind farm wind turbines based on genetic algorithm according to claim 1, characterized in that: In step 4, encoding the grid sequence of step 2 includes: The grid nodes where wind turbines are deployed are coded with binary digits "1", and the grid nodes where wind turbines are not deployed are coded with binary digits "0".
4. The method for optimizing the layout of wind turbines in an offshore wind farm based on a genetic algorithm according to claim 1, characterized in that: Storing the optimal arrangement solution in step 6 includes: Stores the position coordinates, position number, energy density, theoretical power generation, average wind speed considering wake effect, power generation considering wake and wake loss coefficient.
