An efficient brute-force solution to the network reconfiguration problem
- 1 July 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Delivery
- Vol. 15 (3), 996-1000
- https://doi.org/10.1109/61.871365
Abstract
The authors suggest a method for determining a minimal-loss radial configuration for a power distribution network, using an exhaustive search algorithm. While exhaustive, the method is highly efficient, deriving its efficiency from the use of graph-theoretic techniques involving semi-sparse transformations of a current sensitivity matrix. The algorithm can he applied to networks of moderate size and has advantages over existing algorithms for network reconfiguration in that it guarantees a globally optimal solution (under appropriate modeling assumptions), and is easily extended to take account of phase imbalance and network operation constraints. A 33-bus example is used to demonstrate the operation of the algorithm.Keywords
This publication has 5 references indexed in Scilit:
- Overload prevention and loss minimization in managed distribution networksIEEE Transactions on Power Delivery, 2000
- A survey of the state of the art in distribution system reconfiguration for system loss reductionElectric Power Systems Research, 1994
- Network reconfiguration in distribution systems for loss reduction and load balancingIEEE Transactions on Power Delivery, 1989
- Loss minimization of distribution feeders: optimality and algorithmsIEEE Transactions on Power Delivery, 1989
- Distribution feeder reconfiguration for loss reductionIEEE Transactions on Power Delivery, 1988