Two studies on grid expansion planning

This paper compares two methods to solve the grid expansion planning using branch and bound algorithm and Ford-Fulkerson algorithm, given future generation and load strategies, and alternative types of lines available, subject to load, reliability and right of way constraints. From the comparisons of results, it proposes the reasonable algorithm that can be applied to an actual grid system. The grid expansion planning problem is formulated not only as a series of zero or one integer programming that is solved by a branch and bound algorithm but also formulated as linear programming by the Ford-Fulkerson algorithm at minimization total cost subject to reliability constraint (load balance). A test study results on a 63-bus test system show that the proposed method is near side practical and efficiently applicable to the medium size grid expansion planning