...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Renewable energy >A new optimization algorithm for solving wind turbine placement problem: Binary artificial algae algorithm
【24h】

A new optimization algorithm for solving wind turbine placement problem: Binary artificial algae algorithm

机译：解决风轮机布置问题的一种新的优化算法：二进制人工藻类算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The wind turbine has grown out to be one of the most common renewable energy sources around the world in recent years. As wind energy becomes more important, the significance of wind turbine placement also increases. This study was intended to position the wind turbines on a wind farm to achieve the highest performance possible. The turbine placement operation was designed for a 2 km x 2 km area. The surface of the area was calculated by dividing it into a 10 x 10 grid and a 20 x 20 grid with the use of binary coding. The calculation revealed ten different new binary algorithms using ten different transfer functions of the Artificial Algae Algorithm (AAA) that has been successfully applied to solve continuous optimization problems. These algorithms were applied to the turbine placement problem, and the algorithm that obtained the best result was called the Binary Artificial Algorithm (BinAAA). The results of the proposed algorithm for the binary turbine placement optimization problem were compared with those of other well-known algorithms in the relevant literature. The algorithm that was proposed in the study is an efficient algorithm for the placement problem of wind turbines since it optimized the binary search space and achieved the most successful result (C) 2017 Elsevier Ltd. All rights reserved.
机译：近年来，风力涡轮机已成长为全球最常见的可再生能源之一。随着风能变得越来越重要，风力涡轮机布置的重要性也增加了。这项研究旨在将风力涡轮机放置在风电场上，以实现最高的性能。涡轮机放置操作的设计面积为2 km x 2 km。通过使用二进制编码将区域分为10 x 10网格和20 x 20网格来计算区域的表面。计算显示了十种使用人工藻类算法（AAA）的十种不同传递函数的新二元算法，这些算法已成功应用于解决连续优化问题。这些算法被应用于涡轮机布置问题，获得最佳效果的算法称为二进制人工算法（BinAAA）。将所提出的用于二元涡轮机布置优化问题的算法的结果与相关文献中其他知名算法的结果进行了比较。该研究中提出的算法是解决风力涡轮机放置问题的有效算法，因为它优化了二进制搜索空间并获得了最成功的结果（C）2017 ElsevierLtd。保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号