基于元启发式方法的输气管网全暂态功率最小化

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Hamid Reza Moetamedzadeh, Hossein Khodabakhshi Rafsanjani
{"title":"基于元启发式方法的输气管网全暂态功率最小化","authors":"Hamid Reza Moetamedzadeh, Hossein Khodabakhshi Rafsanjani","doi":"10.1515/ijnsns-2020-0057","DOIUrl":null,"url":null,"abstract":"Abstract In gas transmission networks, the pressure drop caused by friction is one of the main operation costs that is compensated through consuming energy in the compressors. In the competitive market of energy, considering the demand variation is inevitable. Hence, the power minimization should be carried out in transient state. Since the minimization problem is severely nonlinear and nonconvex subjected to nonlinear constraints, utilizing a powerful minimization tool with a straightforward procedure is very helpful. In this paper, a novel approach is proposed based on metaheuristic algorithms for power minimization of a gas transmission network in fully transient conditions. The metaheuristic algorithms, unlike the gradient dependent method, can solve the complicated minimization problem without simplification. In the proposed strategy, the cost function is not expressed explicitly as a function of minimization variables; therefore, the transient minimization can be as precise as possible. The minimization is carried out by a straightforward methodology in each time sample, which leads to more precise solutions as compared to the quasi transient minimization. The metaheuristic minimizer, called the particle swarm optimization gravitational search algorithm (PSOGSA), is utilized to find the optimum operating set points. The numerical results also confirm the accuracy and well efficiency of the proposed method.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2022-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Power minimization of gas transmission network in fully transient state using metaheuristic methods\",\"authors\":\"Hamid Reza Moetamedzadeh, Hossein Khodabakhshi Rafsanjani\",\"doi\":\"10.1515/ijnsns-2020-0057\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In gas transmission networks, the pressure drop caused by friction is one of the main operation costs that is compensated through consuming energy in the compressors. In the competitive market of energy, considering the demand variation is inevitable. Hence, the power minimization should be carried out in transient state. Since the minimization problem is severely nonlinear and nonconvex subjected to nonlinear constraints, utilizing a powerful minimization tool with a straightforward procedure is very helpful. In this paper, a novel approach is proposed based on metaheuristic algorithms for power minimization of a gas transmission network in fully transient conditions. The metaheuristic algorithms, unlike the gradient dependent method, can solve the complicated minimization problem without simplification. In the proposed strategy, the cost function is not expressed explicitly as a function of minimization variables; therefore, the transient minimization can be as precise as possible. The minimization is carried out by a straightforward methodology in each time sample, which leads to more precise solutions as compared to the quasi transient minimization. The metaheuristic minimizer, called the particle swarm optimization gravitational search algorithm (PSOGSA), is utilized to find the optimum operating set points. The numerical results also confirm the accuracy and well efficiency of the proposed method.\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2022-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1515/ijnsns-2020-0057\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1515/ijnsns-2020-0057","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

摘要在天然气输送网络中,摩擦引起的压降是主要的运行成本之一,通过消耗压缩机的能量来补偿。在竞争激烈的能源市场中,考虑需求变化是不可避免的。因此,功率最小化应在瞬态状态下进行。由于最小化问题是严重的非线性和非凸的,受到非线性约束,因此使用一个强大的最小化工具和一个简单的过程是非常有帮助的。本文提出了一种基于元启发式算法的输气网络全暂态功率最小化新方法。与梯度相关方法不同,元启发式算法可以在不简化的情况下解决复杂的最小化问题。在所提出的策略中,成本函数没有明确表示为最小化变量的函数;因此,瞬态最小化可以尽可能精确。在每个时间样本中,通过直接的方法进行最小化,与准瞬态最小化相比,这导致了更精确的解。元启发式最小化器被称为粒子群优化引力搜索算法(PSOGSA),用于寻找最佳操作设定点。数值结果也证实了该方法的准确性和良好的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Power minimization of gas transmission network in fully transient state using metaheuristic methods
Abstract In gas transmission networks, the pressure drop caused by friction is one of the main operation costs that is compensated through consuming energy in the compressors. In the competitive market of energy, considering the demand variation is inevitable. Hence, the power minimization should be carried out in transient state. Since the minimization problem is severely nonlinear and nonconvex subjected to nonlinear constraints, utilizing a powerful minimization tool with a straightforward procedure is very helpful. In this paper, a novel approach is proposed based on metaheuristic algorithms for power minimization of a gas transmission network in fully transient conditions. The metaheuristic algorithms, unlike the gradient dependent method, can solve the complicated minimization problem without simplification. In the proposed strategy, the cost function is not expressed explicitly as a function of minimization variables; therefore, the transient minimization can be as precise as possible. The minimization is carried out by a straightforward methodology in each time sample, which leads to more precise solutions as compared to the quasi transient minimization. The metaheuristic minimizer, called the particle swarm optimization gravitational search algorithm (PSOGSA), is utilized to find the optimum operating set points. The numerical results also confirm the accuracy and well efficiency of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
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学术官方微信