Rafael Martins Barros , Guilherme Guimarães Lage , Ricardo de Andrade Lira Rabêlo
{"title":"通过图最短路径、并行计算和动态编程对最优无功调度控制调整进行全局最优排序,以最大限度地降低输电系统的运行损耗","authors":"Rafael Martins Barros , Guilherme Guimarães Lage , Ricardo de Andrade Lira Rabêlo","doi":"10.1016/j.ejor.2024.07.033","DOIUrl":null,"url":null,"abstract":"<div><p>Minimizing operational losses in transmission systems through the Optimal Reactive Dispatch (ORD), a non-convex mixed-integer nonlinear programming problem, is crucial for operational cost reduction, resource optimization, and greenhouse gas emission mitigation. Besides all intricacies associated with solving ORDs, transmission system operators encounter the challenge of determining sequences in which ORD control adjustments must be implemented before significant changes occur in generators scheduled power output and system loading. Sequencing ORD control adjustments, in spite of not being novel, remains modestly scrutinized in the literature. This paper introduces a two-phase framework that tackles the globally optimal sequencing of <span><math><mi>n</mi></math></span> ORD control adjustments over <span><math><mrow><mi>n</mi><mo>!</mo></mrow></math></span> potential paths by solving the ORD to minimize operational losses in transmission systems in the first phase, and optimally sequencing ORD control adjustments employing fast power flow calculations, graph shortest path, parallel computing, and dynamic programming in the second phase. We discuss the framework’s second phase asymptotic time complexity, which is exponential over factorial for brute-force approaches, and its capability to guarantee globally optimal paths toward minimal operational losses determined in the framework’s first phase. ORD control adjustments for transmission systems with up to 27 controllable variables are benchmarked against two mixed-integer nonlinear programming solvers: BARON, a global non-convex solver, and Knitro, a local solver (assuming convexity around local optima). Globally optimal sequences of ORD control adjustments over <span><math><mrow><mi>n</mi><mo>!</mo></mrow></math></span> potential paths (more than <span><math><mrow><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mn>28</mn></mrow></msup></mrow></math></span> for sequencing 27 control adjustments) and average algorithm runtimes validate the straightforward application and, more importantly, effectiveness of such a comprehensive framework.</p></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":null,"pages":null},"PeriodicalIF":6.0000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Globally optimal sequencing of optimal reactive dispatch control adjustments to minimize operational losses in transmission systems by graph shortest path, parallel computing, and dynamic programming\",\"authors\":\"Rafael Martins Barros , Guilherme Guimarães Lage , Ricardo de Andrade Lira Rabêlo\",\"doi\":\"10.1016/j.ejor.2024.07.033\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Minimizing operational losses in transmission systems through the Optimal Reactive Dispatch (ORD), a non-convex mixed-integer nonlinear programming problem, is crucial for operational cost reduction, resource optimization, and greenhouse gas emission mitigation. Besides all intricacies associated with solving ORDs, transmission system operators encounter the challenge of determining sequences in which ORD control adjustments must be implemented before significant changes occur in generators scheduled power output and system loading. Sequencing ORD control adjustments, in spite of not being novel, remains modestly scrutinized in the literature. This paper introduces a two-phase framework that tackles the globally optimal sequencing of <span><math><mi>n</mi></math></span> ORD control adjustments over <span><math><mrow><mi>n</mi><mo>!</mo></mrow></math></span> potential paths by solving the ORD to minimize operational losses in transmission systems in the first phase, and optimally sequencing ORD control adjustments employing fast power flow calculations, graph shortest path, parallel computing, and dynamic programming in the second phase. We discuss the framework’s second phase asymptotic time complexity, which is exponential over factorial for brute-force approaches, and its capability to guarantee globally optimal paths toward minimal operational losses determined in the framework’s first phase. ORD control adjustments for transmission systems with up to 27 controllable variables are benchmarked against two mixed-integer nonlinear programming solvers: BARON, a global non-convex solver, and Knitro, a local solver (assuming convexity around local optima). Globally optimal sequences of ORD control adjustments over <span><math><mrow><mi>n</mi><mo>!</mo></mrow></math></span> potential paths (more than <span><math><mrow><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mn>28</mn></mrow></msup></mrow></math></span> for sequencing 27 control adjustments) and average algorithm runtimes validate the straightforward application and, more importantly, effectiveness of such a comprehensive framework.</p></div>\",\"PeriodicalId\":55161,\"journal\":{\"name\":\"European Journal of Operational Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":6.0000,\"publicationDate\":\"2024-07-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Operational Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0377221724005939\",\"RegionNum\":2,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Operational Research","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377221724005939","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
摘要
优化无功调度(ORD)是一个非凸混合整数非线性编程问题,通过优化无功调度将输电系统的运行损耗降至最低对降低运行成本、优化资源和减少温室气体排放至关重要。除了与解决 ORD 相关的所有复杂问题外,输电系统运营商还面临着一个挑战,即在发电机计划输出功率和系统负荷发生重大变化之前,必须确定实施 ORD 控制调整的顺序。尽管确定 ORD 控制调整的顺序并非新颖之举,但文献中对这一问题的研究仍然不多。本文介绍了一个两阶段框架,通过在第一阶段求解 ORD 以最小化输电系统的运行损耗,以及在第二阶段利用快速功率流计算、图最短路径、并行计算和动态编程来优化 ORD 控制调整在潜在路径上的全局最优排序。我们讨论了该框架第二阶段的渐近时间复杂性(对于蛮力方法而言,该复杂性是指数级的阶乘),以及该框架保证实现框架第一阶段确定的最小运行损失的全局最优路径的能力。针对多达 27 个可控变量的输电系统的 ORD 控制调整,以两个混合整数非线性编程求解器为基准:BARON 是一种全局非凸求解器,Knitro 是一种局部求解器(假定局部最优点周围具有凸性)。潜在路径上 ORD 控制调整的全局最优序列(多于 27 个控制调整的序列)和平均算法运行时间验证了这种综合框架的直接应用,更重要的是,验证了其有效性。
Globally optimal sequencing of optimal reactive dispatch control adjustments to minimize operational losses in transmission systems by graph shortest path, parallel computing, and dynamic programming
Minimizing operational losses in transmission systems through the Optimal Reactive Dispatch (ORD), a non-convex mixed-integer nonlinear programming problem, is crucial for operational cost reduction, resource optimization, and greenhouse gas emission mitigation. Besides all intricacies associated with solving ORDs, transmission system operators encounter the challenge of determining sequences in which ORD control adjustments must be implemented before significant changes occur in generators scheduled power output and system loading. Sequencing ORD control adjustments, in spite of not being novel, remains modestly scrutinized in the literature. This paper introduces a two-phase framework that tackles the globally optimal sequencing of ORD control adjustments over potential paths by solving the ORD to minimize operational losses in transmission systems in the first phase, and optimally sequencing ORD control adjustments employing fast power flow calculations, graph shortest path, parallel computing, and dynamic programming in the second phase. We discuss the framework’s second phase asymptotic time complexity, which is exponential over factorial for brute-force approaches, and its capability to guarantee globally optimal paths toward minimal operational losses determined in the framework’s first phase. ORD control adjustments for transmission systems with up to 27 controllable variables are benchmarked against two mixed-integer nonlinear programming solvers: BARON, a global non-convex solver, and Knitro, a local solver (assuming convexity around local optima). Globally optimal sequences of ORD control adjustments over potential paths (more than for sequencing 27 control adjustments) and average algorithm runtimes validate the straightforward application and, more importantly, effectiveness of such a comprehensive framework.
期刊介绍:
The European Journal of Operational Research (EJOR) publishes high quality, original papers that contribute to the methodology of operational research (OR) and to the practice of decision making.