Simultaneous Optimisation of Cable Connection Schemes and Capacity for Offshore Wind Farms via a Modified Bat Algorithm

Yuanhang Qi, Peng Hou*, Liang Yang, Guangya Yang

*Corresponding author for this work

    Research output: Contribution to journalJournal articleResearchpeer-review

    323 Downloads (Orbit)

    Abstract

    Offshore wind energy has attracted worldwide attention and investments in the last decade due to the stability and abundance of wind resources. As one of the main components of this, internal array cables have a great impact on the levelised cost of energy of offshore wind farms, and thus their connection layout is a matter of concern. In this paper, a classical mathematical problem-the traveling salesman problem, which belongs to the field of graph theory-is applied to solve the offshore wind farm cable connection layout optimization problem. Both the capital investment on cables, cable laying, and the cost of power losses associated with array cables are considered in the proposed model. A modified bat algorithm is presented to resolve the problem. Furthermore, a cable crossing detection method is also adopted to avoid obtaining crossed cable connection layouts. The effectiveness was verified through a case study.
    Original languageEnglish
    Article number265
    JournalApplied Sciences
    Volume9
    Issue number2
    Number of pages20
    DOIs
    Publication statusPublished - 2019

    Bibliographical note

    This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

    Keywords

    • Offshore wind farm
    • Cable connection layout
    • Power losses
    • Traveling salesman problem
    • Bat algorithm

    Fingerprint

    Dive into the research topics of 'Simultaneous Optimisation of Cable Connection Schemes and Capacity for Offshore Wind Farms via a Modified Bat Algorithm'. Together they form a unique fingerprint.

    Cite this