A polynomial-time exact algorithm for the sectionalizing switch allocation problem

The allocation of switches in power distribution networks is a critical combinatorial optimization problem concerning reliability optimization. In this work, we consider a set of sectionalizing switches and a radial network, for which the objective is to find the best edges to allocate the switches...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Electric power systems research Ročník 249; s. 112016
Hlavní autori: Usberti, Fábio Luiz, González, José Federico Vizcaino, Assis, Laura Silva de, Cavellucci, Celso
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.12.2025
Predmet:
Combinatorial optimization
Dynamic programming
Power distribution
Reliability
Dynamic programming
Reliability
Combinatorial optimization
Power distribution
ISSN:0378-7796
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The allocation of switches in power distribution networks is a critical combinatorial optimization problem concerning reliability optimization. In this work, we consider a set of sectionalizing switches and a radial network, for which the objective is to find the best edges to allocate the switches to minimize the expected energy not supplied. An open question in the literature concerns the computational complexity of this fundamental problem, specifically, whether it is NP-hard. In this paper, we show that it is in fact tractable by presenting the first exact polynomial-time algorithm, based on dynamic programming. We compare our approach with previous state-of-the-art methodologies. Extensive computational experiments show that the proposed dynamic programming scales much better than the previous approach. Large instances, with more than three thousand nodes, are solved for the first time for any number of switches. •A polynomial-time exact algorithm is proposed for the switch allocation problem.•The problem is proven to be tractable under radial networks and additive functions.•All 9,995 benchmark instances are solved optimally in seconds.•Significant gains over ILP and prior DP approaches are demonstrated.•Code and datasets are publicly available to ensure reproducibility.
ISSN:0378-7796
DOI:10.1016/j.epsr.2025.112016