Path-based distribution network modeling: application to reconfiguration for loss reduction

By Esther Romero Ramos, A. G. Expósito, Jesús Santos, Francisco Llorens Iborra. IEEE Transactions on Power Systems, 2005

178 citations recorded by the source corpus.

Subfields: Control and Systems Engineering, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/a317c6c857e1e7a93a04b4c12d8c18b9de95b61c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Control and Systems Engineering

In Electrical and Electronic Engineering

Citations in the corpus

Imposing Radiality Constraints in Distribution System Optimization Problems (2012, methodology): “An alternative mathematical model that allows the solution of the DSR problem using commercial software is presented in [2].”
A Mixed-Integer Linear Programming Approach for the Computation of the Minimum-Losses Radial Configuration of Electrical Distribution Networks (2012, methodology): “In [17], a genetic algorithm approach is compared with a MILP model in which all bus voltage magnitudes are assumed to be 1 p.”
An Efficient Codification to Solve Distribution Network Reconfiguration for Loss Reduction Problem (2008, background): “In the last few years, there were some very interesting proposals to deal with this kind of problem [13], [26]–[28].”
Minimum Loss Network Reconfiguration Using Mixed-Integer Convex Programming (2012, methodology): “There are different options to represent the network radiality constraints including a loop-based approach [8] which stipulates that each loop in the meshed configuration has to be open and a path-based approach which is based on the identification of reasonable alternative paths linking each bus to”
Resilient Disaster Recovery Logistics of Distribution Systems: Co-Optimize Service Restoration With Repair Crew and Mobile Power Source Dispatch (2018, unknown): “While some other kinds of spanning tree constraints may require additional discrete variables and potentially a combinatorial number of constraints [52], [53], the single-commodity flow based spanning tree constraints (25)-(27) here only involve |L| binary variables, |L| continuous variables and |N|”