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

Rafael Martins Barros, Guilherme Guimarães Lage and Ricardo de Andrade Lira Rabêlo

European Journal of Operational Research, 2025, vol. 320, issue 1, 239-255

Abstract: 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.

Keywords: OR in energy; Dynamic programming; Graph shortest path; Optimal power flow; Parallel computing (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221724005939
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:320:y:2025:i:1:p:239-255

DOI: 10.1016/j.ejor.2024.07.033

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().