采用经济调度模型的随机机组承诺试验设计

IF 2.6 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Nahal Sakhavand , Jay Rosenberger , Victoria C.P. Chen , Harsha Gangammanavar
{"title":"采用经济调度模型的随机机组承诺试验设计","authors":"Nahal Sakhavand ,&nbsp;Jay Rosenberger ,&nbsp;Victoria C.P. Chen ,&nbsp;Harsha Gangammanavar","doi":"10.1016/j.ejco.2024.100089","DOIUrl":null,"url":null,"abstract":"<div><p>We develop a Design and Analysis of the Computer Experiments (DACE) approach to the stochastic unit commitment problem for power systems with significant renewable integration. For this purpose, we use a two-stage stochastic programming formulation of the stochastic unit commitment-economic dispatch problem. Typically, a sample average approximation of the true problem is solved using a cutting plane method (such as the L-shaped method) or scenario decomposition (such as Progressive Hedging) algorithms. However, when the number of scenarios increases, these solution methods become computationally prohibitive. To address this challenge, we develop a novel DACE approach that exploits the structure of the first-stage unit commitment decision space in a design of experiments, uses features based upon solar generation, and trains a multivariate adaptive regression splines model to approximate the second stage of the stochastic unit commitment-economic dispatch problem. We conduct experiments on two modified IEEE-57 and IEEE-118 test systems and assess the quality of the solutions obtained from both the DACE and the L-shaped methods in a replicated procedure. The results obtained from this approach attest to the significant improvement in the computational performance of the DACE approach over the traditional L-shaped method.</p></div>","PeriodicalId":51880,"journal":{"name":"EURO Journal on Computational Optimization","volume":"12 ","pages":"Article 100089"},"PeriodicalIF":2.6000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192440624000066/pdfft?md5=734ce10eb038b678d854fede2426d31a&pid=1-s2.0-S2192440624000066-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Design of experiments for the stochastic unit commitment with economic dispatch models\",\"authors\":\"Nahal Sakhavand ,&nbsp;Jay Rosenberger ,&nbsp;Victoria C.P. Chen ,&nbsp;Harsha Gangammanavar\",\"doi\":\"10.1016/j.ejco.2024.100089\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We develop a Design and Analysis of the Computer Experiments (DACE) approach to the stochastic unit commitment problem for power systems with significant renewable integration. For this purpose, we use a two-stage stochastic programming formulation of the stochastic unit commitment-economic dispatch problem. Typically, a sample average approximation of the true problem is solved using a cutting plane method (such as the L-shaped method) or scenario decomposition (such as Progressive Hedging) algorithms. However, when the number of scenarios increases, these solution methods become computationally prohibitive. To address this challenge, we develop a novel DACE approach that exploits the structure of the first-stage unit commitment decision space in a design of experiments, uses features based upon solar generation, and trains a multivariate adaptive regression splines model to approximate the second stage of the stochastic unit commitment-economic dispatch problem. We conduct experiments on two modified IEEE-57 and IEEE-118 test systems and assess the quality of the solutions obtained from both the DACE and the L-shaped methods in a replicated procedure. The results obtained from this approach attest to the significant improvement in the computational performance of the DACE approach over the traditional L-shaped method.</p></div>\",\"PeriodicalId\":51880,\"journal\":{\"name\":\"EURO Journal on Computational Optimization\",\"volume\":\"12 \",\"pages\":\"Article 100089\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2024-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2192440624000066/pdfft?md5=734ce10eb038b678d854fede2426d31a&pid=1-s2.0-S2192440624000066-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EURO Journal on Computational Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2192440624000066\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Computational Optimization","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192440624000066","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

摘要

我们开发了一种计算机实验设计与分析 (DACE) 方法,用于解决具有大量可再生能源集成的电力系统的随机机组承诺问题。为此,我们对随机机组承诺-经济调度问题采用了两阶段随机编程方法。通常情况下,使用切割面法(如 L 型法)或情景分解法(如渐进对冲法)算法求解真实问题的样本平均近似值。然而,当方案数量增加时,这些求解方法的计算量就会变得过大。为了应对这一挑战,我们开发了一种新颖的 DACE 方法,该方法在实验设计中利用第一阶段机组承诺决策空间的结构,使用基于太阳能发电量的特征,并训练一个多变量自适应回归样条模型来近似处理第二阶段的随机机组承诺-经济调度问题。我们在两个经过修改的 IEEE-57 和 IEEE-118 测试系统上进行了实验,并在重复程序中评估了 DACE 和 L 型方法所得到的解决方案的质量。这种方法得出的结果证明,与传统的 L 型方法相比,DACE 方法的计算性能有了显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design of experiments for the stochastic unit commitment with economic dispatch models

We develop a Design and Analysis of the Computer Experiments (DACE) approach to the stochastic unit commitment problem for power systems with significant renewable integration. For this purpose, we use a two-stage stochastic programming formulation of the stochastic unit commitment-economic dispatch problem. Typically, a sample average approximation of the true problem is solved using a cutting plane method (such as the L-shaped method) or scenario decomposition (such as Progressive Hedging) algorithms. However, when the number of scenarios increases, these solution methods become computationally prohibitive. To address this challenge, we develop a novel DACE approach that exploits the structure of the first-stage unit commitment decision space in a design of experiments, uses features based upon solar generation, and trains a multivariate adaptive regression splines model to approximate the second stage of the stochastic unit commitment-economic dispatch problem. We conduct experiments on two modified IEEE-57 and IEEE-118 test systems and assess the quality of the solutions obtained from both the DACE and the L-shaped methods in a replicated procedure. The results obtained from this approach attest to the significant improvement in the computational performance of the DACE approach over the traditional L-shaped method.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
EURO Journal on Computational Optimization
EURO Journal on Computational Optimization OPERATIONS RESEARCH & MANAGEMENT SCIENCE-
CiteScore
3.50
自引率
0.00%
发文量
28
审稿时长
60 days
期刊介绍: The aim of this journal is to contribute to the many areas in which Operations Research and Computer Science are tightly connected with each other. More precisely, the common element in all contributions to this journal is the use of computers for the solution of optimization problems. Both methodological contributions and innovative applications are considered, but validation through convincing computational experiments is desirable. The journal publishes three types of articles (i) research articles, (ii) tutorials, and (iii) surveys. A research article presents original methodological contributions. A tutorial provides an introduction to an advanced topic designed to ease the use of the relevant methodology. A survey provides a wide overview of a given subject by summarizing and organizing research results.
×
引用
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学术官方微信