Probabilistic bootstrap-based evolutionary algorithm for three-objective wind farm turbine position optimization

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Chen Zhang , Haotian Li , Xiuxian Li , Jiujun Cheng , Zhenyu Lei , Shangce Gao
{"title":"Probabilistic bootstrap-based evolutionary algorithm for three-objective wind farm turbine position optimization","authors":"Chen Zhang ,&nbsp;Haotian Li ,&nbsp;Xiuxian Li ,&nbsp;Jiujun Cheng ,&nbsp;Zhenyu Lei ,&nbsp;Shangce Gao","doi":"10.1016/j.swevo.2025.101972","DOIUrl":null,"url":null,"abstract":"<div><div>Amid the worsening energy crisis, wind farm layout optimization (WFLO) to increase power generation, reduce costs, and mitigate potential environmental impacts is of great significance. This paper formulates three-objective wind farm layout optimization (TWFLO) which is rarely considered, aiming to effectively utilize existing information to optimize power output, land usage, and costs. We propose a new algorithm (MOEA/D-P) based on probability distributions to guide turbine placement and improve the performance of a Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D). This algorithm addresses the issue of neglecting valuable information during layout optimization. Additionally, we make improvements to the traditional land-use function to avoid situations where non-convex layouts result in an area calculation of zero. The MOEA/D-P is tested on six different initial layouts and compared with five algorithms under two wind conditions. Results are evaluated using inverted generational distance, hypervolume, and scatter plot distributions. The impact of initial probability distribution on algorithm performance is discussed under four simple wind conditions. The results show that MOEA/D-P outperforms the other five algorithms in terms of performance.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"96 ","pages":"Article 101972"},"PeriodicalIF":8.2000,"publicationDate":"2025-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225001300","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Amid the worsening energy crisis, wind farm layout optimization (WFLO) to increase power generation, reduce costs, and mitigate potential environmental impacts is of great significance. This paper formulates three-objective wind farm layout optimization (TWFLO) which is rarely considered, aiming to effectively utilize existing information to optimize power output, land usage, and costs. We propose a new algorithm (MOEA/D-P) based on probability distributions to guide turbine placement and improve the performance of a Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D). This algorithm addresses the issue of neglecting valuable information during layout optimization. Additionally, we make improvements to the traditional land-use function to avoid situations where non-convex layouts result in an area calculation of zero. The MOEA/D-P is tested on six different initial layouts and compared with five algorithms under two wind conditions. Results are evaluated using inverted generational distance, hypervolume, and scatter plot distributions. The impact of initial probability distribution on algorithm performance is discussed under four simple wind conditions. The results show that MOEA/D-P outperforms the other five algorithms in terms of performance.
基于概率自举的三目标风电场位置优化进化算法
在能源危机日益加剧的情况下,优化风电场布局对提高发电量、降低成本、减轻潜在环境影响具有重要意义。本文提出了一种很少被考虑的三目标风电场布局优化(TWFLO)方法,旨在有效利用现有信息对输出功率、土地利用和成本进行优化。在改进基于分解的多目标进化算法(MOEA/D)的基础上,提出了一种基于概率分布的新算法(MOEA/D- p)来指导涡轮布局。该算法解决了布局优化过程中忽略有价值信息的问题。此外,我们对传统的土地利用功能进行了改进,以避免非凸布局导致面积计算为零的情况。MOEA/D-P在六种不同的初始布局下进行了测试,并在两种风况下对五种算法进行了比较。使用倒代距离、超大体积和散点图分布来评估结果。在四种简单的风条件下,讨论了初始概率分布对算法性能的影响。结果表明,MOEA/D-P算法在性能上优于其他五种算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信