A new heuristic approach for optimal reconfiguration in distribution systems

Abul’Wafa, Ahmed R.

doi:10.1016/j.epsr.2010.09.003

Cited by 55 publications

(24 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A BN connection branches by nodes matrix is constructed, based on the discovered paths. The PM uses the two matrices BIBC and BCBV, to find out the solution satisfying the need of distribution automation [32]. The Appendix summaries the relationship between the bus current injections and branch current (BIBC) and the relationship between branch currents and voltage drops along branches (BCBV).…”

Section: Solution Methodologymentioning

confidence: 99%

“…1(a). Traversing the directed graph in depthfirst search mode, the power flow paths (downstream nodes for each node including the node itself) can be detected [32,33]. A BN connection branches by nodes matrix is constructed, based on the discovered paths.…”

Section: Solution Methodologymentioning

confidence: 99%

“…This result in tabulation of the input information for both line data and node data in such way that the receiving end node will be in an ascending order. The vector of downstream nodes for each node in the original network graphs are obtained by graph traversing [32]. The number of downstream nodes for each node including the node itself is the length of this vector.…”

Section: Proposed Solution Algorithmmentioning

confidence: 99%

“…Using the BN connection matrix, build the impedance matrix (BCBV) of the system. BCBV is a symmetric matrix and only the upper triangular matrix is calculated [32]. The solution for distribution network load flow can be obtained by solving the following equations iteratively…”

Section: Proposed Solution Algorithmmentioning

confidence: 99%

“…The proposed method (PM) also allows dynamic building of the two matrices: BIBC and branch-current to bus-voltage (BCBV) matrix, used to find out the load flow solution. Reconstruction of these matrices takes place automatically by just changing two elements in the sparse matrix S reflecting changes in network configuration [32], thus avoiding updating the whole matrices. The method is then applied for load flow studies, aiming to reduce the computational time associated with.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A network-topology-based load flow for radial distribution networks with composite and exponential load

Abul’Wafa

2012

Electric Power Systems Research

Self Cite

View full text Add to dashboard Cite

Section: Solution Methodologymentioning

confidence: 99%

Section: Solution Methodologymentioning

confidence: 99%

Section: Proposed Solution Algorithmmentioning

confidence: 99%

Section: Proposed Solution Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A network-topology-based load flow for radial distribution networks with composite and exponential load

Abul’Wafa

2012

Electric Power Systems Research

Self Cite

View full text Add to dashboard Cite

Novel approach to reconfiguration power loss reduction problem by simulated annealing technique

Stojanović¹,

Rajić

2017

Int Trans Electr Energ Syst

View full text Add to dashboard Cite

Summary The network reconfiguration is done by changing the status of the switches, mainly for 2 reasons: an active power loss reduction and load balancing attracting the attention of distribution engineers for quite a long period of time. In this article, solving method for the active power loss reduction is given. Searching for the relevant radial configurations is done by a simulated annealing technique. To aid the search, a program for checking the connectivity of the power system, with imposed radiality constraint, is enhanced by a new approximate power flow method. The applied power flow program is very efficient and fast but can be used only as an indication for the loss estimation because of the insufficient method accuracy. At the end of the algorithm, it is necessary to run an efficient power flow program to determine the real situation concerning loss reduction. A numerical example for Baran and Wu network is analyzed. The developed method converges to the global optimum given in a numerical example. The time duration of the used method is of an hour order and does not depend on the fast manipulation of incoming data files. This advantage makes the method interesting in the planning stage as well as the application in real time. Main contribution of this paper is a novel approach that exploits mostly the following mechanisms: network connectivity checking matrix, Lavorato et al criterion for imposing radiality constraint, and efficient power flow algorithm combined with precise power flow for exact loss calculation.

show abstract