531
Views
7
CrossRef citations to date
0
Altmetric
Research Article

A Jaya-based approach to wind turbine placement problem

ORCID Icon, & ORCID Icon
Pages 3318-3337 | Received 05 Apr 2020, Accepted 29 Jul 2020, Published online: 21 Sep 2020
 

ABSTRACT

Renewable energy resources are natural, clean, economical, and never-ending energy resources. Wind energy is an important clean, cheap, and easy applicable energy sources. On account of this, generation of the energy from wind technology has been raised day by day because of the competition with fossil-fuel power production methods. By depending on increases the number of turbines located in the wind farm, the average power obtains from each wind turbine appreciable reduces due to the existence of wake effects within the wind farm. Therefore, the optimal placement of turbines in a wind farm provides to get optimum wind energy from the wind farm. When the place where the wind turbines are located is considered as NxN grid, a wind turbine can be established to each cell of this grid. Whether a wind turbine is replaced to each cell of the grid or not can be modeled as a binary-based optimization problem. In this study, a Jaya-based binary optimization algorithm is proposed to determine which cells are used for wind turbine replacement. In order to justify the efficiency of the proposed approach, two different test cases are considered, and the solutions produced by the proposed approach are compared with the solutions of the swarm intelligence or evolutionary computation methods. According to the experiments and comparisons the Jaya-based binary approach shows a superior performance than compared approaches in terms of cost and power effectiveness. While the efficiency of the Jaya-based approach is 92.2% with 30 turbines replacement on 10 × 10 grid, the efficiency of the Jaya-based binary method is 95.7% with 43 turbines replacement on 20 × 20 grid.

Highlights

  • Jaya-based an effective solution proposed for wind farm layout optimization.

  • Jaya-based algorithm (for short JayaX) has been analyzed on two different types as 10×10 grid with 100 possible squares and as 20×20 grid with 400 possible squares for placement the wind turbines.

  • JayaX is compared with state-of-art population-based algorithms.

  • The proposed algorithm shows better performance in terms of solution quality and robustness.

Nomenclature

a Axial induction factorrr Rotor radiusz Hub height, mCT Thrust coefficientz0 Surface roughness, mu0 Wind velocity, m/sα Entrainment constant

Correction Statement

This article has been republished with minor changes. These changes do not impact the academic content of the article.

Additional information

Notes on contributors

Murat Aslan

Murat Aslan received B.Sc. and M.Sc degrees in computer engineering from Selçuk University in 2011 and 2017 respectively. Recently, he is a research assistant in the Department of the Computer Engineering at Sirnak University and working on his Ph.D. dissertation at Department of Computer Engineering, Faculty of Engineering and Natural Sciences, Konya Technical University. His current interests include applications of Graph Theory, Discrete and Binary Optimization Problems, Swarm Intelligence or Evolutionary Computation Algorithms.

Mesut Gunduz

Mesut Gunduz received M.Sc degree in computer engineering from Selçuk University in 2000, and received Ph.D. degree in Electrical and Electronic Engineering from Selçuk University in 2006. Recently, he is an Associate Professor in the Department of the Computer Engineering at Konya Technical University. His current interests include applications of optimization problems, Artificial Intelligence Algorithms and Machine Learning.

Mustafa Servet Kiran

Mustafa Servet Kiran received B.Sc., M.Sc and Ph.D. degrees in computer engineering from Selçuk University in 2007, 2010 and 2014 respectively. Recently, he is an Associate Professor in the Department of the Computer Engineering at Konya Technical University. His current interests include applications of optimization problems, swarm intelligence Algorithms, Machine Learning and Parallel Computing.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.