Cable Layout Optimization of Offshore Wind Farm Based on Global Dynamic Minimum Spanning Tree Algorithm.
Saved in:
| Title: | Cable Layout Optimization of Offshore Wind Farm Based on Global Dynamic Minimum Spanning Tree Algorithm. |
|---|---|
| Authors: | Huang, Guoqing1,2 (AUTHOR), Cao, Ziwei1 (AUTHOR), Li, Ke1,2 (AUTHOR) keli‐bridge@cqu.edu.cn, Zhou, Xuhong1,2 (AUTHOR), Yang, Qingshan1,2 (AUTHOR), Hu, Weihao3 (AUTHOR) |
| Source: | Wind Energy. May2026, Vol. 29 Issue 5, p1-15. 15p. |
| Subjects: | Offshore wind power plants, Optimization algorithms, Spanning trees, Wind power, Cost control |
| Abstract: | Wind energy has become one of the most promising new energy resources. In the construction of offshore wind farms, the cable accounts for about 10% of the total investment, and the optimization of the cable layout is necessary for reducing the total cost of the wind farm. In this paper, we proposed a novel algorithm for the optimization of the cable layout of wind farms, which can consider the relationship between the cost of cable and the amount of its connected wind turbines. Mathematically, it is a dynamic minimum spanning tree (DMST) algorithm that can consider the dynamic changes of the edge weights during the optimization process. This feature makes it suitable for optimizing the cable layout and cable type of wind farms simultaneously, and the wind turbines can be reasonably clustered in consideration of the current‐carrying limit of the cables. In this paper, this algorithm was used to optimize the cable layout of two offshore wind farms, respectively. In the first case of the wind farms, the proposed method saved 5.08%, 2.07%, and 8.61% of the cable investment compared to the Prim algorithm, the traditional DMST algorithm, and the ant colony algorithms, respectively. In the second case of the wind farms, the proposed method saved correspondingly 8.12%, 8.12%, and 7.98% of the cable investment, respectively. [ABSTRACT FROM AUTHOR] |
| Copyright of Wind Energy is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Wind energy has become one of the most promising new energy resources. In the construction of offshore wind farms, the cable accounts for about 10% of the total investment, and the optimization of the cable layout is necessary for reducing the total cost of the wind farm. In this paper, we proposed a novel algorithm for the optimization of the cable layout of wind farms, which can consider the relationship between the cost of cable and the amount of its connected wind turbines. Mathematically, it is a dynamic minimum spanning tree (DMST) algorithm that can consider the dynamic changes of the edge weights during the optimization process. This feature makes it suitable for optimizing the cable layout and cable type of wind farms simultaneously, and the wind turbines can be reasonably clustered in consideration of the current‐carrying limit of the cables. In this paper, this algorithm was used to optimize the cable layout of two offshore wind farms, respectively. In the first case of the wind farms, the proposed method saved 5.08%, 2.07%, and 8.61% of the cable investment compared to the Prim algorithm, the traditional DMST algorithm, and the ant colony algorithms, respectively. In the second case of the wind farms, the proposed method saved correspondingly 8.12%, 8.12%, and 7.98% of the cable investment, respectively. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 10954244 |
| DOI: | 10.1002/we.70116 |
