通过二次潮流优化潮流

Ye Tao, A. Meliopoulos
{"title":"通过二次潮流优化潮流","authors":"Ye Tao, A. Meliopoulos","doi":"10.1109/PSCE.2011.5772563","DOIUrl":null,"url":null,"abstract":"This paper proposes an optimal power flow (OPF) algorithm based on quadratic modeling and incremental loading of the network. The proposed OPF algorithm is robust and highly efficient for large-scale power systems. Robustness is achieved by the design of the algorithm to operate on infeasible but optimal points and move towards the feasible and optimal operating point. Efficiency is achieved by (a) the design of the algorithm to include mainly the active constraints and therefore reducing the problem size and (b) quadratic modeling that provides faster solution times of the network update solutions. The algorithm guarantees a solution. In case that an optimal solution does not exist, it provides the best solution, the constraints that cannot be satisfied and the remedial actions necessary to satisfy the operating constraints. Numerical examples indicate that the proposed algorithm converges fast and the convergence speed is not affected by system size.","PeriodicalId":120665,"journal":{"name":"2011 IEEE/PES Power Systems Conference and Exposition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Optimal power flow via quadratic power flow\",\"authors\":\"Ye Tao, A. Meliopoulos\",\"doi\":\"10.1109/PSCE.2011.5772563\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an optimal power flow (OPF) algorithm based on quadratic modeling and incremental loading of the network. The proposed OPF algorithm is robust and highly efficient for large-scale power systems. Robustness is achieved by the design of the algorithm to operate on infeasible but optimal points and move towards the feasible and optimal operating point. Efficiency is achieved by (a) the design of the algorithm to include mainly the active constraints and therefore reducing the problem size and (b) quadratic modeling that provides faster solution times of the network update solutions. The algorithm guarantees a solution. In case that an optimal solution does not exist, it provides the best solution, the constraints that cannot be satisfied and the remedial actions necessary to satisfy the operating constraints. Numerical examples indicate that the proposed algorithm converges fast and the convergence speed is not affected by system size.\",\"PeriodicalId\":120665,\"journal\":{\"name\":\"2011 IEEE/PES Power Systems Conference and Exposition\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE/PES Power Systems Conference and Exposition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PSCE.2011.5772563\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE/PES Power Systems Conference and Exposition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PSCE.2011.5772563","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

提出了一种基于二次建模和负荷增量的电网最优潮流优化算法。该算法对大型电力系统具有鲁棒性和高效性。鲁棒性是通过设计算法在不可行但最优的点上运行,并向可行且最优的工作点移动来实现的。效率是通过(a)算法的设计,主要包括主动约束,从而减少了问题的大小,(b)二次建模,提供了更快的网络更新解决方案的求解时间。该算法保证了一个解。在不存在最优解的情况下,给出最优解、不能满足的约束以及满足运行约束所必需的补救措施。数值算例表明,该算法收敛速度快,且收敛速度不受系统大小的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal power flow via quadratic power flow
This paper proposes an optimal power flow (OPF) algorithm based on quadratic modeling and incremental loading of the network. The proposed OPF algorithm is robust and highly efficient for large-scale power systems. Robustness is achieved by the design of the algorithm to operate on infeasible but optimal points and move towards the feasible and optimal operating point. Efficiency is achieved by (a) the design of the algorithm to include mainly the active constraints and therefore reducing the problem size and (b) quadratic modeling that provides faster solution times of the network update solutions. The algorithm guarantees a solution. In case that an optimal solution does not exist, it provides the best solution, the constraints that cannot be satisfied and the remedial actions necessary to satisfy the operating constraints. Numerical examples indicate that the proposed algorithm converges fast and the convergence speed is not affected by system size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信