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 wi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 320; číslo 1; s. 239 - 255
Hlavní autori: Barros, Rafael Martins, Lage, Guilherme Guimarães, Rabêlo, Ricardo de Andrade Lira
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.01.2025
Predmet:
Dynamic programming
Graph shortest path
Optimal power flow
OR in energy
Parallel computing
Parallel computing
Dynamic programming
OR in energy
Optimal power flow
Graph shortest path
ISSN:0377-2217
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 n ORD control adjustments over n! 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 n! potential paths (more than 1028 for sequencing 27 control adjustments) and average algorithm runtimes validate the straightforward application and, more importantly, effectiveness of such a comprehensive framework. [Display omitted] •ORDs are vital for efficient power system operation and even CO2 emission mitigation.•There lacks comprehensive methodologies detailing the sequencing of ORD adjustments.•The number of sequence paths is factorial, and brute-force sequencing is impractical.•Graph shortest path ensures a global optimal path toward minimal operational losses.•Parallel computing and dynamic programming effectively sequence ORD adjustments.
ISSN:0377-2217
DOI:10.1016/j.ejor.2024.07.033