New approximate optimization method for distribution system planning

Abstract

An algorithm to obtain an approximate optimal solution to the problem of large-scale radial distribution system planning is proposed. The distribution planning problem is formulated as a MIP (mixed integer programming) problem. The set of constraints is reduced to a set of continuous variable linear equations by using the fact that the basis of the simplex tableau consists of the power flow variables of radial branch. This linear problem is solved by pivot operations which correspond to a branch-exchange of the radial network. Numerical examples are presented to demonstrate the validity and effectiveness of the algorithm.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>