[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content

Advertisement

Log in

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

  • S.I.: CLAIO 2018
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Akagi, T., Canale, E., & Risso, C. (2017). Optimal edge fault-tolerant embedding of a star over a cycle. Matemática Contemporânea, 45, 115–123.

    Google Scholar 

  • Bicalho, L. H., da Cunha, A. S., & Lucena, A. (2016). Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem. Computational Optimization and Applications, 63(3), 755–792.

    Article  Google Scholar 

  • Canale, E. A., & Risso, C. E. (2015). Optimal edge fault-tolerant bijective embedding of a complete graph over a cycle. Electronic Notes in Discrete Mathematics, 50, 217–222. LAGOS’15—VIII Latin-American Algorithms, Graphs and Optimization Symposium.

    Article  Google Scholar 

  • Fan, N., & Golari, M. (2014). Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs. Combinatorial Optimization and Applications, 613–622.

  • Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability. A Guide to the Theory of NPCompleteness. Freemann.

  • Goemans, M. X., & Myung, Y.-S. (1993). A catalog of Steiner tree formulations. Networks, 23(1), 19–28.

    Article  Google Scholar 

  • Gonzalez-Longatt, F. M., Wall, P., Regulski, P., & Terzija, V. (2012). Optimal electric network design for a large offshore wind farm based on a modified genetic algorithm approach. IEEE Systems Journal, 6(1), 164–172.

    Article  Google Scholar 

  • Hauptmann, M., & Karpinski, M. (2013). A compendium on steiner tree problems. Technical report, Department of Computer Science and Hausdorff Center for Mathematics University of Bonn.

  • Lundberg, S. (2003). Configuration study of large wind parks. Technical report, Department of Electric Power Engineering, Chalmers University of Technology, Göteberg, Sweden.

  • Narula, S. C., & Cesar, A. H. (1980). Degree-constrained minimum spanning tree. Computers & Operations Research, 7(4), 239–249.

    Article  Google Scholar 

  • Pettie, S., & Ramachandran, V. (2002). An optimal minimum spanning tree algorithm. Journal of ACM, 49(1), 16–34.

    Article  Google Scholar 

  • Risso, C., Nesmachnow, S., & Robledo, F. (2018). Metaheuristic approaches for ip/mpls network design. International Transactions in Operational Research, 25(2), 599–625.

    Article  Google Scholar 

  • Sung, T. Y., Chang, C. P., & Hsu, L. H. (2000). Edge congestion and topological properties of crossed cubes. IEEE Transactions on Parallel and Distributed Systems, 11(1), 64–80.

    Article  Google Scholar 

  • Vasko, F. J., Barbieri, R. S., Rieksts, B. Q., Reitmeyer, K. L., & Stott, K. L. (2002). The cable trench problem: combining the shortest path and minimum spanning tree problems. Computers & Operations Research, 29(5), 441–458.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Claudio Risso.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Risso, C., Canale, E. Cost Optimized Design for the Local Wind Turbine Grid of an Onshore Wind Farm. Ann Oper Res 316, 1187–1203 (2022). https://doi.org/10.1007/s10479-021-04133-w

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-021-04133-w

Keywords

Navigation