Distribution systems expansion planning by multi-stage branch exchange

The authors present a multistage 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 quickly, the authors have developed a method based on the branch exchange technique which is able to find an approximate solution. To obtain a more accurate solution, the multistage branch exchange algorithm is introduced. The validity and effectiveness of the proposed algorithm are demonstrated by applying it to a 59-node, 69-branch numerical example system.<
>