IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v316y2022i2d10.1007_s10479-021-04133-w.html
   My bibliography  Save this article

Cost Optimized Design for the Local Wind Turbine Grid of an Onshore Wind Farm

Author

Listed:
  • Claudio Risso

    (Instituto de Computación, Facultad de Ingeniería)

  • Eduardo Canale

    (Instituto de Matemática y Estadística Rafael Laguardia, Facultad de Ingeniería)

Abstract

This document analyses the problem of designing a minimum cost local wind turbine grid (or LWTG) for an onshore wind farm. The LWTG is responsible for adding up the power of the farm’s wind turbines to then deliver it to a high voltage network. To minimize disruption of agricultural activities, the cables should be laid along underground conduits, parallel to an existing map of roads in the terrain. Hence, connections of onshore wind farms are limited differently from those in offshore ones. This document presents: the technical constraints of such a grid; a combinatorial model to find cost optimal solutions; and also shows some concrete optimal layouts. The work is based upon a real-world project, the Parque Eólico Palomas, a wind farm in Uruguay, a leader country in the usage of renewable energies and environmental care. The results of this research contributed to reduce investment costs of that project, with savings exceeding 30% over manually crafted solutions.

Suggested Citation

  • Claudio Risso & Eduardo Canale, 2022. "Cost Optimized Design for the Local Wind Turbine Grid of an Onshore Wind Farm," Annals of Operations Research, Springer, vol. 316(2), pages 1187-1203, September.
  • Handle: RePEc:spr:annopr:v:316:y:2022:i:2:d:10.1007_s10479-021-04133-w
    DOI: 10.1007/s10479-021-04133-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-021-04133-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-021-04133-w?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Luis Bicalho & Alexandre Cunha & Abilio Lucena, 2016. "Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem," Computational Optimization and Applications, Springer, vol. 63(3), pages 755-792, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alexandre Salles Cunha, 2022. "Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 379-413, August.
    2. Luiz Viana & Manoel Campêlo & Ignasi Sau & Ana Silva, 2021. "A unifying model for locally constrained spanning tree problems," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 125-150, July.
    3. Chagas, Rosklin Juliano & Valle, Cristiano Arbex & da Cunha, Alexandre Salles, 2018. "Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 57-71.

    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:spr:annopr:v:316:y:2022:i:2:d:10.1007_s10479-021-04133-w. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.