DISTRIBUTION-SYSTEMS EXPANSION PLANNING BY MULTISTAGE BRANCH EXCHANGE

This paper presents a multi-stage branch exchange algorithm for solving expansion planning problems in distribution systems. Since it is formulated as a combinatorial optimization problem, it is difficult to solve such a large-scale problem accurately. Therefore, in order to find a solution fast, the authors have developed a method based on the branch exchange technique which is able to find an "approximate" solution quickly. In this paper, so as to obtain a more accurate solution, the authors introduce a multi-stage branch exchange algorithm. The validity and effectiveness of the proposed algorithm are demonstrated by applying it to a 59 node, 69 branch numerical example system.