Wind Farm Cable Connection Layout Optimization Using a Genetic Algorithm and Integer Linear Programming

IF 1.9 Q2 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Computation Pub Date : 2023-12-03 DOI:10.3390/computation11120241
E. J. S. Pires, A. Cerveira, José Baptista
{"title":"Wind Farm Cable Connection Layout Optimization Using a Genetic Algorithm and Integer Linear Programming","authors":"E. J. S. Pires, A. Cerveira, José Baptista","doi":"10.3390/computation11120241","DOIUrl":null,"url":null,"abstract":"This work addresses the wind farm (WF) optimization layout considering several substations. It is given a set of wind turbines jointly with a set of substations, and the goal is to obtain the optimal design to minimize the infrastructure cost and the cost of electrical energy losses during the wind farm lifetime. The turbine set is partitioned into subsets to assign to each substation. The cable type and the connections to collect wind turbine-produced energy, forwarding to the corresponding substation, are selected in each subset. The technique proposed uses a genetic algorithm (GA) and an integer linear programming (ILP) model simultaneously. The GA creates a partition in the turbine set and assigns each of the obtained subsets to a substation to optimize a fitness function that corresponds to the minimum total cost of the WF layout. The fitness function evaluation requires solving an ILP model for each substation to determine the optimal cable connection layout. This methodology is applied to four onshore WFs. The obtained results show that the solution performance of the proposed approach reaches up to 0.17% of economic savings when compared to the clustering with ILP approach (an exact approach).","PeriodicalId":52148,"journal":{"name":"Computation","volume":"55 7","pages":""},"PeriodicalIF":1.9000,"publicationDate":"2023-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/computation11120241","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

This work addresses the wind farm (WF) optimization layout considering several substations. It is given a set of wind turbines jointly with a set of substations, and the goal is to obtain the optimal design to minimize the infrastructure cost and the cost of electrical energy losses during the wind farm lifetime. The turbine set is partitioned into subsets to assign to each substation. The cable type and the connections to collect wind turbine-produced energy, forwarding to the corresponding substation, are selected in each subset. The technique proposed uses a genetic algorithm (GA) and an integer linear programming (ILP) model simultaneously. The GA creates a partition in the turbine set and assigns each of the obtained subsets to a substation to optimize a fitness function that corresponds to the minimum total cost of the WF layout. The fitness function evaluation requires solving an ILP model for each substation to determine the optimal cable connection layout. This methodology is applied to four onshore WFs. The obtained results show that the solution performance of the proposed approach reaches up to 0.17% of economic savings when compared to the clustering with ILP approach (an exact approach).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用遗传算法和整数线性规划优化风电场电缆连接布局
本文研究了考虑多个变电站的风电场优化布局问题。给定一组风力机和一组变电站,目标是在风电场生命周期内获得最优设计,使基础设施成本和电能损失成本最小。机组被划分为多个机组分配给各个变电站。在每个子集中选择收集风力发电机产生的能量并转发到相应变电站的电缆类型和连接方式。该方法同时采用遗传算法和整数线性规划(ILP)模型。遗传算法在水轮机机组中划分分区,并将得到的每个子集分配给变电站,以优化对应于WF布局总成本最小的适应度函数。适应度函数评估需要求解每个变电站的ILP模型,以确定最优的电缆连接布局。该方法应用于四个陆上油田。结果表明,与精确聚类方法ILP聚类相比,该方法的求解性能可节省0.17%的经济成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computation
Computation Mathematics-Applied Mathematics
CiteScore
3.50
自引率
4.50%
发文量
201
审稿时长
8 weeks
期刊介绍: Computation a journal of computational science and engineering. Topics: computational biology, including, but not limited to: bioinformatics mathematical modeling, simulation and prediction of nucleic acid (DNA/RNA) and protein sequences, structure and functions mathematical modeling of pathways and genetic interactions neuroscience computation including neural modeling, brain theory and neural networks computational chemistry, including, but not limited to: new theories and methodology including their applications in molecular dynamics computation of electronic structure density functional theory designing and characterization of materials with computation method computation in engineering, including, but not limited to: new theories, methodology and the application of computational fluid dynamics (CFD) optimisation techniques and/or application of optimisation to multidisciplinary systems system identification and reduced order modelling of engineering systems parallel algorithms and high performance computing in engineering.
期刊最新文献
Analytical and Numerical Investigation of Two-Dimensional Heat Transfer with Periodic Boundary Conditions Enhancement of Machine-Learning-Based Flash Calculations near Criticality Using a Resampling Approach Corporate Bankruptcy Prediction Models: A Comparative Study for the Construction Sector in Greece Analysis of Effectiveness of Combined Surface Treatment Methods for Structural Parts with Holes to Enhance Their Fatigue Life A New Mixed Fractional Derivative with Applications in Computational Biology
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1