@article{Jabr:2012,
author = {Jabr, RA and Singh, R and Pal, BC},
journal = {IEEE Transactions on Power Systems},
pages = {1106--1115},
title = {Minimum Loss Network Reconfiguration Using Mixed-Integer Convex Programming},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6140618&contentType=Journals+%26+Magazines&refinements%3D4291944246%2C4294967042%26ranges%3D2011_2012_p_Publication_Year%26matchBoolean%3Dtrue%26searchField%3DSearch_All%26queryText%3D%28p_Authors%3Apal+b.+c.%29},
volume = {27},
year = {2012}
}

Download

TY  - JOUR
AB  - This paper proposes a mixed-integer conic programmingformulation for the minimum loss distribution network reconfigurationproblem. This formulation has two features: first,it employs a convex representation of the network model whichis based on the conic quadratic format of the power flow equationsand second, it optimizes the exact value of the network losses.The use of a convex model in terms of the continuous variables isparticularly important because it ensures that an optimal solutionobtained by a branch-and-cut algorithm for mixed-integer conicprogramming is global. In addition, good quality solutions with arelaxed optimality gap can be very efficiently obtained. A polyhedralapproximation which is amenable to solution via more widelyavailable mixed-integer linear programming software is also presented.Numerical results on practical test networks including distributedgeneration show that mixed-integer convex optimization is an effective tool for network reconfiguration.
AU  - Jabr,RA
AU  - Singh,R
AU  - Pal,BC
EP  - 1115
PY  - 2012///
SN  - 0885-8950
SP  - 1106
TI  - Minimum Loss Network Reconfiguration Using Mixed-Integer Convex Programming
T2  - IEEE Transactions on Power Systems
VL  - 27
ER  - 

Download