Sparsity-Leveraging Reconfiguration of Smart Distribution Systems
- 17 February 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Delivery
- Vol. 29 (3) , 1417-1426
Abstract
A system reconfiguration problem is considered for three-phase power distribution networks featuring distributed generation. In lieu of binary line selection variables, the notion of group sparsity is advocated to re-formulate the nonconvex distribution system reconfiguration (DSR) problem into a convex one. It is shown that the line selection task boils down to a shrinkage and thresholding operation on the line currents. Further, numerical tests illustrate the ability of the proposed scheme to identify meshed, weakly meshed, or even radial configurations by adjusting a sparsity-tuning parameter in the DSR cost. Constraints on the voltages are investigated and incorporated in the novel DSR problem to facilitate voltage regulation.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Distributed Optimal Power Flow for Smart MicrogridsIEEE Transactions on Smart Grid, 2013
- Mixed Integer Programming-based reconfiguration of a distribution system with battery storage2012
- Three-phase distribution OPF in smart grids: Optimality versus computational burden2011
- Network reconfiguration in balanced and unbalanced distribution systems with high DG penetration2011
- Distribution Systems Reconfiguration Based on OPF Using Benders DecompositionIEEE Transactions on Power Delivery, 2009
- Reconfiguration of distribution system using fuzzy multi-objective approachInternational Journal of Electrical Power & Energy Systems, 2006
- Model Selection and Estimation in Regression with Grouped VariablesJournal of the Royal Statistical Society Series B: Statistical Methodology, 2005
- Meshed vs. radial MV distribution network in presence of large amount of DG2004
- An efficient brute-force solution to the network reconfiguration problemIEEE Transactions on Power Delivery, 2000
- Integer and Combinatorial Optimization1988