Greedy robust wind farm layout optimization with feasibility guarantee

Ning Quan, Harrison M. Kim

Research output: Contribution to journalArticle

Abstract

This article proposes a method with light data requirements for generating robust wind farm layouts. Robustness in this work is quantified as the lowest energy conversion efficiency of the wind farm across all wind directions. A quadratic integer programming formulation for generating robustness-maximizing layouts is presented. Small instances of the proposed formulation can be solved to optimality using branch and bound. A modified greedy algorithm that guarantees solution feasibility with regards to inter-turbine safety distance is proposed to find solutions to larger problem instances. A series of experiments were conducted using real world wind data collected at two sites to demonstrate the trade-offs in power generation between robust layouts and power output maximizing layouts. The results show a loss of around 1.1% in hourly power generation in return for an increase in minimum power output of 1% to 45% across all directions for robust layouts generated in the experiments. The increase in robustness largely depends on the shape and orientation of the wind farm relative to the dominant wind direction, as well as the difference between the average wind speed at the site of the wind farm and rated wind speed of the turbines.

Original languageEnglish (US)
Pages (from-to)1152-1167
Number of pages16
JournalEngineering Optimization
Volume51
Issue number7
DOIs
StatePublished - Jul 3 2019

Fingerprint

Farms
Layout
Optimization
Wind Speed
Turbine
Robustness
Power generation
Turbines
Formulation
Output
Branch-and-bound
Greedy Algorithm
Farm
Guarantee
Integer Programming
Quadratic Programming
Experiment
Lowest
Integer programming
Optimality

Keywords

  • Wind farm
  • greedy algorithm
  • layout optimization
  • robust

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Optimization
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this

Greedy robust wind farm layout optimization with feasibility guarantee. / Quan, Ning; Kim, Harrison M.

In: Engineering Optimization, Vol. 51, No. 7, 03.07.2019, p. 1152-1167.

Research output: Contribution to journalArticle

@article{40ddfd0317c04521af865e0d56bdca67,
title = "Greedy robust wind farm layout optimization with feasibility guarantee",
abstract = "This article proposes a method with light data requirements for generating robust wind farm layouts. Robustness in this work is quantified as the lowest energy conversion efficiency of the wind farm across all wind directions. A quadratic integer programming formulation for generating robustness-maximizing layouts is presented. Small instances of the proposed formulation can be solved to optimality using branch and bound. A modified greedy algorithm that guarantees solution feasibility with regards to inter-turbine safety distance is proposed to find solutions to larger problem instances. A series of experiments were conducted using real world wind data collected at two sites to demonstrate the trade-offs in power generation between robust layouts and power output maximizing layouts. The results show a loss of around 1.1{\%} in hourly power generation in return for an increase in minimum power output of 1{\%} to 45{\%} across all directions for robust layouts generated in the experiments. The increase in robustness largely depends on the shape and orientation of the wind farm relative to the dominant wind direction, as well as the difference between the average wind speed at the site of the wind farm and rated wind speed of the turbines.",
keywords = "Wind farm, greedy algorithm, layout optimization, robust",
author = "Ning Quan and Kim, {Harrison M.}",
year = "2019",
month = "7",
day = "3",
doi = "10.1080/0305215X.2018.1509962",
language = "English (US)",
volume = "51",
pages = "1152--1167",
journal = "Engineering Optimization",
issn = "0305-215X",
publisher = "Taylor and Francis Ltd.",
number = "7",

}

TY - JOUR

T1 - Greedy robust wind farm layout optimization with feasibility guarantee

AU - Quan, Ning

AU - Kim, Harrison M.

PY - 2019/7/3

Y1 - 2019/7/3

N2 - This article proposes a method with light data requirements for generating robust wind farm layouts. Robustness in this work is quantified as the lowest energy conversion efficiency of the wind farm across all wind directions. A quadratic integer programming formulation for generating robustness-maximizing layouts is presented. Small instances of the proposed formulation can be solved to optimality using branch and bound. A modified greedy algorithm that guarantees solution feasibility with regards to inter-turbine safety distance is proposed to find solutions to larger problem instances. A series of experiments were conducted using real world wind data collected at two sites to demonstrate the trade-offs in power generation between robust layouts and power output maximizing layouts. The results show a loss of around 1.1% in hourly power generation in return for an increase in minimum power output of 1% to 45% across all directions for robust layouts generated in the experiments. The increase in robustness largely depends on the shape and orientation of the wind farm relative to the dominant wind direction, as well as the difference between the average wind speed at the site of the wind farm and rated wind speed of the turbines.

AB - This article proposes a method with light data requirements for generating robust wind farm layouts. Robustness in this work is quantified as the lowest energy conversion efficiency of the wind farm across all wind directions. A quadratic integer programming formulation for generating robustness-maximizing layouts is presented. Small instances of the proposed formulation can be solved to optimality using branch and bound. A modified greedy algorithm that guarantees solution feasibility with regards to inter-turbine safety distance is proposed to find solutions to larger problem instances. A series of experiments were conducted using real world wind data collected at two sites to demonstrate the trade-offs in power generation between robust layouts and power output maximizing layouts. The results show a loss of around 1.1% in hourly power generation in return for an increase in minimum power output of 1% to 45% across all directions for robust layouts generated in the experiments. The increase in robustness largely depends on the shape and orientation of the wind farm relative to the dominant wind direction, as well as the difference between the average wind speed at the site of the wind farm and rated wind speed of the turbines.

KW - Wind farm

KW - greedy algorithm

KW - layout optimization

KW - robust

UR - http://www.scopus.com/inward/record.url?scp=85053269610&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85053269610&partnerID=8YFLogxK

U2 - 10.1080/0305215X.2018.1509962

DO - 10.1080/0305215X.2018.1509962

M3 - Article

AN - SCOPUS:85053269610

VL - 51

SP - 1152

EP - 1167

JO - Engineering Optimization

JF - Engineering Optimization

SN - 0305-215X

IS - 7

ER -