解决安全受限的单位承诺问题:三种新方法

IF 5 2区 工程技术 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC International Journal of Electrical Power & Energy Systems Pub Date : 2024-10-22 DOI:10.1016/j.ijepes.2024.110213
Alessandro Francesco Castelli , Iiro Harjunkoski , Jan Poland , Marco Giuntoli , Emanuele Martelli , Ignacio E. Grossmann
{"title":"解决安全受限的单位承诺问题:三种新方法","authors":"Alessandro Francesco Castelli ,&nbsp;Iiro Harjunkoski ,&nbsp;Jan Poland ,&nbsp;Marco Giuntoli ,&nbsp;Emanuele Martelli ,&nbsp;Ignacio E. Grossmann","doi":"10.1016/j.ijepes.2024.110213","DOIUrl":null,"url":null,"abstract":"<div><div>This work proposes three novel approaches to speed up the solution of the Security Constrained Unit Commitment problem: an improvement of an active-set iterative approach taken from literature, an approach using solver callback functions for the evaluation of system and security constraints in the branch-and-bound tree, and one based on a shrinking horizon decomposition integrated with the use of callback functions. The three approaches were tested over five different case studies and compared against an approach taken from literature to assess scalability and performance. Results show that the modified iterative approach is always faster than the original one reported in the literature (between −58% and −93% run time), while the callback-based method does not reduce the computational time of large-scale instances. Finally, the shrinking-horizon-based approach was proved to be the fastest (up to −98% less time) despite not guaranteeing optimality (about 1% suboptimal).</div></div>","PeriodicalId":50326,"journal":{"name":"International Journal of Electrical Power & Energy Systems","volume":null,"pages":null},"PeriodicalIF":5.0000,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solving the security constrained unit commitment problem: Three novel approaches\",\"authors\":\"Alessandro Francesco Castelli ,&nbsp;Iiro Harjunkoski ,&nbsp;Jan Poland ,&nbsp;Marco Giuntoli ,&nbsp;Emanuele Martelli ,&nbsp;Ignacio E. Grossmann\",\"doi\":\"10.1016/j.ijepes.2024.110213\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This work proposes three novel approaches to speed up the solution of the Security Constrained Unit Commitment problem: an improvement of an active-set iterative approach taken from literature, an approach using solver callback functions for the evaluation of system and security constraints in the branch-and-bound tree, and one based on a shrinking horizon decomposition integrated with the use of callback functions. The three approaches were tested over five different case studies and compared against an approach taken from literature to assess scalability and performance. Results show that the modified iterative approach is always faster than the original one reported in the literature (between −58% and −93% run time), while the callback-based method does not reduce the computational time of large-scale instances. Finally, the shrinking-horizon-based approach was proved to be the fastest (up to −98% less time) despite not guaranteeing optimality (about 1% suboptimal).</div></div>\",\"PeriodicalId\":50326,\"journal\":{\"name\":\"International Journal of Electrical Power & Energy Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.0000,\"publicationDate\":\"2024-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Electrical Power & Energy Systems\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0142061524004344\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Electrical Power & Energy Systems","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0142061524004344","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

本研究提出了三种加速解决安全受限单位承诺问题的新方法:一种是对文献中的主动集迭代方法的改进,一种是使用求解器回调函数来评估分支约束树中的系统和安全约束,还有一种是基于收缩视界分解并结合使用回调函数的方法。这三种方法在五个不同的案例研究中进行了测试,并与文献中的一种方法进行了比较,以评估可扩展性和性能。结果表明,修改后的迭代方法总是比文献中报道的原始方法更快(运行时间在-58%到-93%之间),而基于回调的方法并没有减少大规模实例的计算时间。最后,基于收缩远景的方法被证明是最快的(最多可减少-98%的时间),尽管它不能保证最优性(约1%的次优)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Solving the security constrained unit commitment problem: Three novel approaches
This work proposes three novel approaches to speed up the solution of the Security Constrained Unit Commitment problem: an improvement of an active-set iterative approach taken from literature, an approach using solver callback functions for the evaluation of system and security constraints in the branch-and-bound tree, and one based on a shrinking horizon decomposition integrated with the use of callback functions. The three approaches were tested over five different case studies and compared against an approach taken from literature to assess scalability and performance. Results show that the modified iterative approach is always faster than the original one reported in the literature (between −58% and −93% run time), while the callback-based method does not reduce the computational time of large-scale instances. Finally, the shrinking-horizon-based approach was proved to be the fastest (up to −98% less time) despite not guaranteeing optimality (about 1% suboptimal).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Electrical Power & Energy Systems
International Journal of Electrical Power & Energy Systems 工程技术-工程:电子与电气
CiteScore
12.10
自引率
17.30%
发文量
1022
审稿时长
51 days
期刊介绍: The journal covers theoretical developments in electrical power and energy systems and their applications. The coverage embraces: generation and network planning; reliability; long and short term operation; expert systems; neural networks; object oriented systems; system control centres; database and information systems; stock and parameter estimation; system security and adequacy; network theory, modelling and computation; small and large system dynamics; dynamic model identification; on-line control including load and switching control; protection; distribution systems; energy economics; impact of non-conventional systems; and man-machine interfaces. As well as original research papers, the journal publishes short contributions, book reviews and conference reports. All papers are peer-reviewed by at least two referees.
期刊最新文献
Robust contingency-constrained load restoration method for transmission systems considering modified SOCP formulation of power flow Variable droop gain frequency supporting control with maximum rotor kinetic energy utilization for wind-storage system Size optimization of standalone wind-photovoltaics-diesel-battery systems by Harris hawks optimization (HHO): Case study of a wharf located in Bushehr, Iran Feasible region identification approach for the regional integrated energy system considering flexible ramping constraints based on polyhedral projection algorithm Bidding strategy for the virtual power plant based on cooperative game participating in the Electricity-Carbon joint market
×
引用
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