IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v270y2018i3p917-930.html

Optimizing wind farm cable routing considering power losses

Author

Listed:
  • Fischetti, Martina
  • Pisinger, David

Abstract

Wind energy is the fastest growing source of renewable energy, but as wind farms are getting larger and more remotely located, installation and infrastructure costs are rising. It is estimated that the expenses for electrical infrastructures account for 15–30% of the overall initial costs, hence it is important to optimize their design. This paper focuses on offshore inter-array cable routing optimization. The routing should connect all turbines to one (or more) offshore substation(s) while respecting cable capacities, no-cross restrictions, connection-limits at the substation, and obstacles at the site. The objective is to minimize both the capital that must be spent immediately in cable and installation costs, and the future reduced revenues due to power losses. We present a Mixed-Integer Linear Programming approach to optimize the routing using both exact and math-heuristic methods. In the power losses computation, wind scenarios are handled efficiently as part of the preprocessing, resulting in a model of only slightly larger size. A library of real-life instances is introduced and made publicly available for benchmarking. Computational results on this testbed show the viability of our methods, proving that savings in the order of millions of Euro can be achieved.

Suggested Citation

  • Fischetti, Martina & Pisinger, David, 2018. "Optimizing wind farm cable routing considering power losses," European Journal of Operational Research, Elsevier, vol. 270(3), pages 917-930.
  • Handle: RePEc:eee:ejores:v:270:y:2018:i:3:p:917-930
    DOI: 10.1016/j.ejor.2017.07.061
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171730704X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2017.07.061?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:270:y:2018:i:3:p:917-930. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.