Sequential heuristic optimisation of a real offshore wind farm site considering turbine placement and cable layout

Taylor, Peter and Campos-Gaona, D and Yue, H and Anaya-Lara, O and Jia, C and Ng, C (2020) Sequential heuristic optimisation of a real offshore wind farm site considering turbine placement and cable layout. Journal of Physics: Conference Series, 1669. 012024. ISSN 1742-6588

[thumbnail of Taylor-etal-JoP-2020-Sequential-heuristic-optimisation-of-a-real-offshore-wind-farm-site]
Preview
Text (Taylor-etal-JoP-2020-Sequential-heuristic-optimisation-of-a-real-offshore-wind-farm-site)
Taylor_etal_JoP_2020_Sequential_heuristic_optimisation_of_a_real_offshore_wind_farm_site.pdf
Final Published Version
License: Creative Commons Attribution 3.0 logo

Download (909kB)| Preview

    Abstract

    Competition within the energy generation industry provides an incentive for developers to build offshore wind farms with a low levelised cost of energy. Therefore, there is a need for design optimisation to reduce costs and increase energy capture. A sequential approach to optimise turbine placement and cable layout is presented, using a heuristic k-opt algorithm and mixed-integer linear programming respectively. Energy storage is considered as a means to further improve the cable selection process. A case study is carried out on the Lillgrund offshore wind farm and the resulting layout improves energy capture by 6%. Cable costs are increased but the electrical losses are reduced such that there is an overall saving over the project lifetime of 20%. Energy storage as a means to peak shave the power seen by a cable in order to reduce electrical losses or de-rate a cable section was found to be impractically large and not profitable. Future work will consider secondary revenue streams to remedy this.

    ORCID iDs

    Taylor, Peter, Campos-Gaona, D ORCID logoORCID: https://orcid.org/0000-0002-0347-6288, Yue, H ORCID logoORCID: https://orcid.org/0000-0003-2072-6223, Anaya-Lara, O ORCID logoORCID: https://orcid.org/0000-0001-5250-5877, Jia, C and Ng, C;