网络约束随机单元承诺的准确定性代理

IF 6.1 1区工程技术 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC

Journal of Modern Power Systems and Clean Energy Pub Date : 2025-02-21 DOI:10.35833/MPCE.2024.001046

Xuan Liu;Antonio J. Conejo

{"title":"网络约束随机单元承诺的准确定性代理","authors":"Xuan Liu;Antonio J. Conejo","doi":"10.35833/MPCE.2024.001046","DOIUrl":null,"url":null,"abstract":"We propose a quasi-deterministic proxy for the network-constrained stochastic unit commitment (SUC) problem. The proposed proxy can identify very similar commitment decisions as those obtained by solving the SUC problem with a large scenario set. Its computational performance, though, is close to that of a deterministic unit commitment problem. The proposed proxy has the same formulation as the SUC problem but only includes one or two envelope scenarios, generated based on the original scenario set. The two envelope scenarios capture the maximum and minimum net-load conditions in the original scenario set. We use a systematic method to assess the quality of commitment decisions obtained by the proposed proxy. The considered case study is based on the Illinois 200-bus system.","PeriodicalId":51326,"journal":{"name":"Journal of Modern Power Systems and Clean Energy","volume":"13 4","pages":"1167-1175"},"PeriodicalIF":6.1000,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10899797","citationCount":"0","resultStr":"{\"title\":\"Quasi-Deterministic Proxy for Network-Constrained Stochastic Unit Commitment\",\"authors\":\"Xuan Liu;Antonio J. Conejo\",\"doi\":\"10.35833/MPCE.2024.001046\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a quasi-deterministic proxy for the network-constrained stochastic unit commitment (SUC) problem. The proposed proxy can identify very similar commitment decisions as those obtained by solving the SUC problem with a large scenario set. Its computational performance, though, is close to that of a deterministic unit commitment problem. The proposed proxy has the same formulation as the SUC problem but only includes one or two envelope scenarios, generated based on the original scenario set. The two envelope scenarios capture the maximum and minimum net-load conditions in the original scenario set. We use a systematic method to assess the quality of commitment decisions obtained by the proposed proxy. The considered case study is based on the Illinois 200-bus system.\",\"PeriodicalId\":51326,\"journal\":{\"name\":\"Journal of Modern Power Systems and Clean Energy\",\"volume\":\"13 4\",\"pages\":\"1167-1175\"},\"PeriodicalIF\":6.1000,\"publicationDate\":\"2025-02-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10899797\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Modern Power Systems and Clean Energy\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10899797/\",\"RegionNum\":1,\"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":"Journal of Modern Power Systems and Clean Energy","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10899797/","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}

引用次数: 0

摘要

针对网络约束随机单元承诺（SUC）问题，提出了一个准确定性代理。所提出的代理可以识别与使用大型场景集解决SUC问题获得的承诺决策非常相似的承诺决策。然而，它的计算性能接近于确定性单元承诺问题的计算性能。所提出的代理与SUC问题具有相同的公式，但仅包含一个或两个包络场景，是在原始场景集的基础上生成的。两个信封场景捕获原始场景集中的最大和最小净负载条件。我们使用一种系统的方法来评估所提议的代理所获得的承诺决策的质量。所考虑的案例研究基于伊利诺伊州200辆公交车系统。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Quasi-Deterministic Proxy for Network-Constrained Stochastic Unit Commitment

We propose a quasi-deterministic proxy for the network-constrained stochastic unit commitment (SUC) problem. The proposed proxy can identify very similar commitment decisions as those obtained by solving the SUC problem with a large scenario set. Its computational performance, though, is close to that of a deterministic unit commitment problem. The proposed proxy has the same formulation as the SUC problem but only includes one or two envelope scenarios, generated based on the original scenario set. The two envelope scenarios capture the maximum and minimum net-load conditions in the original scenario set. We use a systematic method to assess the quality of commitment decisions obtained by the proposed proxy. The considered case study is based on the Illinois 200-bus system.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Modern Power Systems and Clean Energy ENGINEERING, ELECTRICAL & ELECTRONIC-

CiteScore

12.30

自引率

14.30%

发文量

审稿时长

13 weeks

期刊介绍： Journal of Modern Power Systems and Clean Energy (MPCE), commencing from June, 2013, is a newly established, peer-reviewed and quarterly published journal in English. It is the first international power engineering journal originated in mainland China. MPCE publishes original papers, short letters and review articles in the field of modern power systems with focus on smart grid technology and renewable energy integration, etc.