基于交流敏感性因素的安全约束机组承诺与经济调度

Gioacchino Tricarico, Raju Wagle, L. S. Azuara-Grande, F. Gonzalez-Longatt, M. Dicorato, G. Forte, J. Rueda
{"title":"基于交流敏感性因素的安全约束机组承诺与经济调度","authors":"Gioacchino Tricarico, Raju Wagle, L. S. Azuara-Grande, F. Gonzalez-Longatt, M. Dicorato, G. Forte, J. Rueda","doi":"10.1109/ARGENCON55245.2022.9939863","DOIUrl":null,"url":null,"abstract":"The dispatch schedule of the electrical power plant units is the result of the solution to the unit commitment optimisation problem, and it minimises the cost of production considering pre-defined technical limits. The security-constrained unit commitment problem has been defined as including the network constraints in the previously mentioned optimisation problem to obtain a feasible power system solution. The traditional security-constrained unit commitment methods are based on the DC-power flow model, where the network losses and voltage magnitudes are neglected in the problem formulation. This paper proposed a bi-stage security-constrained unit commitment with an economic dispatch (SCUCED) optimisation problem. A merit-order-based zonal day-ahead market problem is solved in the first stage to define a preliminary generation commitment. In the second stage, the SCUCED is solved based on the AC-power flow model and sensitivity factors to embed the full network representation in the optimisation problem. In this paper, the proposed method is illustrated by an application to a modified version of the IEEE 39-bus test system.","PeriodicalId":318846,"journal":{"name":"2022 IEEE Biennial Congress of Argentina (ARGENCON)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Security Constrained Unit Commitment and Economic Dispatch by AC Sensitivity Factors\",\"authors\":\"Gioacchino Tricarico, Raju Wagle, L. S. Azuara-Grande, F. Gonzalez-Longatt, M. Dicorato, G. Forte, J. Rueda\",\"doi\":\"10.1109/ARGENCON55245.2022.9939863\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The dispatch schedule of the electrical power plant units is the result of the solution to the unit commitment optimisation problem, and it minimises the cost of production considering pre-defined technical limits. The security-constrained unit commitment problem has been defined as including the network constraints in the previously mentioned optimisation problem to obtain a feasible power system solution. The traditional security-constrained unit commitment methods are based on the DC-power flow model, where the network losses and voltage magnitudes are neglected in the problem formulation. This paper proposed a bi-stage security-constrained unit commitment with an economic dispatch (SCUCED) optimisation problem. A merit-order-based zonal day-ahead market problem is solved in the first stage to define a preliminary generation commitment. In the second stage, the SCUCED is solved based on the AC-power flow model and sensitivity factors to embed the full network representation in the optimisation problem. In this paper, the proposed method is illustrated by an application to a modified version of the IEEE 39-bus test system.\",\"PeriodicalId\":318846,\"journal\":{\"name\":\"2022 IEEE Biennial Congress of Argentina (ARGENCON)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Biennial Congress of Argentina (ARGENCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARGENCON55245.2022.9939863\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Biennial Congress of Argentina (ARGENCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARGENCON55245.2022.9939863","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

电厂机组调度调度是机组承诺优化问题解决的结果,它考虑了预先设定的技术限制,使生产成本最小化。安全约束的机组承诺问题被定义为在前面提到的优化问题中包含网络约束,以获得可行的电力系统解。传统的安全约束机组承诺方法基于直流潮流模型,在问题的表述中忽略了网络损耗和电压幅值。提出了一种具有经济调度优化问题的双阶段安全约束机组承诺。第一阶段解决了基于优序的区域日前市场问题,确定了初步发电承诺。在第二阶段,基于交流潮流模型和灵敏度因子求解SCUCED,将全网络表示嵌入优化问题中。本文以一个改进版的IEEE 39总线测试系统为例,说明了该方法的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Security Constrained Unit Commitment and Economic Dispatch by AC Sensitivity Factors
The dispatch schedule of the electrical power plant units is the result of the solution to the unit commitment optimisation problem, and it minimises the cost of production considering pre-defined technical limits. The security-constrained unit commitment problem has been defined as including the network constraints in the previously mentioned optimisation problem to obtain a feasible power system solution. The traditional security-constrained unit commitment methods are based on the DC-power flow model, where the network losses and voltage magnitudes are neglected in the problem formulation. This paper proposed a bi-stage security-constrained unit commitment with an economic dispatch (SCUCED) optimisation problem. A merit-order-based zonal day-ahead market problem is solved in the first stage to define a preliminary generation commitment. In the second stage, the SCUCED is solved based on the AC-power flow model and sensitivity factors to embed the full network representation in the optimisation problem. In this paper, the proposed method is illustrated by an application to a modified version of the IEEE 39-bus test system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信