Wind farm layout optimization using adaptive evolutionary algorithm with Monte Carlo Tree Search reinforcement learning

Fangyun Bai, Xinglong Ju, Shouyi Wang, Wenyong Zhou, Feng Liu

Research output: Contribution to journalArticlepeer-review

71 Scopus citations

Abstract

Recent years have witnessed an enormous growth of wind farm capacity worldwide. Due to the wake effect, the velocity of incoming wind is reduced for the wind turbines in the downwind directions, thus causing discounted power generation in a wind farm. Previously, a self-informed adaptivity mechanism in evolutionary algorithms was introduced by the authors, which is inspired by the individuals’ self-adaptive capability to fit the environment in the natural world, where relocating the worst wind turbine with a surrogate model informed mechanism was found to be effective in improving the power conversion efficiency. In this paper, the exploitation capability in the adaptive genetic algorithm is further improved by casting the relocation of multiple wind turbines into a single-player reinforcement learning problem, which is further addressed by Monte-Carlo Tree Search embedded within the evolutionary algorithm. In contrast to the moderate improvements of the authors’ previous algorithms, significant improvement is achieved due to the enhanced algorithmic exploitation. The new algorithm is also applied to solve the optimal layout problem for a recently approved wind farm in New Jersey, and showed better performance against the benchmark algorithms.

Original languageEnglish
Article number115047
JournalEnergy Conversion and Management
Volume252
DOIs
StatePublished - 15 Jan 2022

Keywords

  • Adaptive genetic algorithm
  • Evolutionary computations
  • Monte-Carlo Tree Search
  • Reinforcement learning
  • Wind farm layout optimization

Fingerprint

Dive into the research topics of 'Wind farm layout optimization using adaptive evolutionary algorithm with Monte Carlo Tree Search reinforcement learning'. Together they form a unique fingerprint.

Cite this