大型安全约束AC-OPF关键事件快速识别分解算法

IF 0.7 4区管理学 Q3 Engineering

Military Operations Research Pub Date : 2023-04-27 DOI:10.1287/opre.2023.2453

Frank E. Curtis, D. Molzahn, Shenyinying Tu, A. Wächter, Ermin Wei, Elizabeth Wong

{"title":"大型安全约束AC-OPF关键事件快速识别分解算法","authors":"Frank E. Curtis, D. Molzahn, Shenyinying Tu, A. Wächter, Ermin Wei, Elizabeth Wong","doi":"10.1287/opre.2023.2453","DOIUrl":null,"url":null,"abstract":"The article “A Decomposition Algorithm with Fast Identification of Critical Contingencies for Large-Scale Security-Constrained AC-OPF” presents the decomposition algorithm used by Team GO-SNIP for the ARPA-E Grid Optimization (GO) Competition Challenge 1, held from November 2018 through October 2019. The algorithm involves unique contingency ranking and evaluation strategies for determining the important contingencies to include in a master problem that approximates the original large-scale security-constrained problem. It also involves efficient strategies for handling the complementarity constraints that appear in the model and for handling the arising degeneracies. Software implementation details are described, and the results of an extensive set of numerical experiments are provided to illustrate the effectiveness of each of the used techniques. Team GO-SNIP received a second-place finish in Challenge 1 of the Go Competition.","PeriodicalId":49809,"journal":{"name":"Military Operations Research","volume":"29 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Decomposition Algorithm with Fast Identification of Critical Contingencies for Large-Scale Security-Constrained AC-OPF\",\"authors\":\"Frank E. Curtis, D. Molzahn, Shenyinying Tu, A. Wächter, Ermin Wei, Elizabeth Wong\",\"doi\":\"10.1287/opre.2023.2453\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The article “A Decomposition Algorithm with Fast Identification of Critical Contingencies for Large-Scale Security-Constrained AC-OPF” presents the decomposition algorithm used by Team GO-SNIP for the ARPA-E Grid Optimization (GO) Competition Challenge 1, held from November 2018 through October 2019. The algorithm involves unique contingency ranking and evaluation strategies for determining the important contingencies to include in a master problem that approximates the original large-scale security-constrained problem. It also involves efficient strategies for handling the complementarity constraints that appear in the model and for handling the arising degeneracies. Software implementation details are described, and the results of an extensive set of numerical experiments are provided to illustrate the effectiveness of each of the used techniques. Team GO-SNIP received a second-place finish in Challenge 1 of the Go Competition.\",\"PeriodicalId\":49809,\"journal\":{\"name\":\"Military Operations Research\",\"volume\":\"29 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-04-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Military Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1287/opre.2023.2453\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Military Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/opre.2023.2453","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}

引用次数: 2

摘要

文章“一种快速识别大规模安全约束AC-OPF关键事件的分解算法”介绍了GO- snip团队在2018年11月至2019年10月举行的ARPA-E网格优化(GO)竞赛挑战1中使用的分解算法。该算法采用独特的权变排序和评估策略，以确定主问题中包含的重要权变，从而近似于原始的大规模安全约束问题。它还涉及处理模型中出现的互补性约束和处理产生的退化的有效策略。描述了软件实现的细节，并提供了一组广泛的数值实验结果，以说明每种使用技术的有效性。Go - snip团队在第一轮围棋比赛中获得第二名。

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

查看原文本刊更多论文

A Decomposition Algorithm with Fast Identification of Critical Contingencies for Large-Scale Security-Constrained AC-OPF

The article “A Decomposition Algorithm with Fast Identification of Critical Contingencies for Large-Scale Security-Constrained AC-OPF” presents the decomposition algorithm used by Team GO-SNIP for the ARPA-E Grid Optimization (GO) Competition Challenge 1, held from November 2018 through October 2019. The algorithm involves unique contingency ranking and evaluation strategies for determining the important contingencies to include in a master problem that approximates the original large-scale security-constrained problem. It also involves efficient strategies for handling the complementarity constraints that appear in the model and for handling the arising degeneracies. Software implementation details are described, and the results of an extensive set of numerical experiments are provided to illustrate the effectiveness of each of the used techniques. Team GO-SNIP received a second-place finish in Challenge 1 of the Go Competition.

求助全文

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

来源期刊

Military Operations Research 管理科学-运筹学与管理科学

CiteScore

1.00

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Military Operations Research is a peer-reviewed journal of high academic quality. The Journal publishes articles that describe operations research (OR) methodologies and theories used in key military and national security applications. Of particular interest are papers that present: Case studies showing innovative OR applications Apply OR to major policy issues Introduce interesting new problems areas Highlight education issues Document the history of military and national security OR.