Wind farm array cable layout optimisation for complex offshore sites - a decomposition based heuristic approach

Tools

Taylor, Peter and Yue, Hong and Campos-Gaona, David and Anaya-Lara, Olimpo and Jia, Chunjiang (2023) Wind farm array cable layout optimisation for complex offshore sites - a decomposition based heuristic approach. IET Renewable Power Generation, 17 (2). pp. 243-259. ISSN 1752-1416 (https://doi.org/10.1049/rpg2.12593)

[thumbnail of Taylor-etal-IETRPG-2022-Wind-farm-array-cable-layout-optimisation-for-complex-offshore-sites-a-decomposition]
Preview
 Text. Filename: Taylor_etal_IETRPG_2022_Wind_farm_array_cable_layout_optimisation_for_complex_offshore_sites_a_decomposition.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (624kB)| Preview

Abstract

As the number of turbines in offshore wind farms increases, so does the complexity of cable routing optimisation problems. Optimising the collector network is a crucial task for developers contributing between 15% and 30% of initial investment costs. For some algorithms, increasing the number of turbines leads to unfavourable scaling of the computational time and memory required to reach optimal solutions. Heuristics offer an alternative but are likely to incur increases in total costs relative to the optimal solution since heuristic searching cannot guarantee optimality. This study proposes a novel optimisation algorithm based on the ant-colony heuristic by introducing decomposition techniques informed by the problem formulation to improve the computational performance. The new algorithm can reach near-optimal solutions and requires little computational resource.Three algorithms are compared on a set of six case studies, including mixed-integer linear programming (MILP), classical ant-colony optimisation (ACO) algorithm, and the pro-posed ACO with decomposition, ACOsp. Optimal solutions were found using the MILP algorithm. ACO algorithm solutions cost 0.4–7.6% more than optimal solutions, whereas ACOsp solutions cost only 0.0–1.4% more than optimal solutions. The proposed ACOsp algorithm has shown to be a robust approach for large-scale cable layout optimisation problems (>100 turbines) without requiring high-performance computing facilities.

ORCID iDs

Taylor, Peter, Yue, Hong ORCID logoORCID: https://orcid.org/0000-0003-2072-6223, Campos-Gaona, David ORCID logoORCID: https://orcid.org/0000-0002-0347-6288, Anaya-Lara, Olimpo ORCID logoORCID: https://orcid.org/0000-0001-5250-5877 and Jia, Chunjiang;
CORE (COnnecting REpositories)