A hierarchical decomposition approach for transmission network expansion planning

This paper presents a hierarchical decomposition approach for optimal transmission network expansion planning. A major difficulty in obtaining global optimal solutions for complex, real-life networks is due to the nonconvexity of the problem. Hierarchical decomposition has proved to be an efficient heuristic for coping with nonconvexity, as illustrated in the test results section of the paper. Significant reductions in investment costs have been obtained in some practical cases for which results are available in the literature. The current implementation of the hierarchical decomposition approach utilizes three different levels of network modeling: transportation models, hybrid models, and linearized power flow models. An initial solution is obtained for the simplest model (transportation model) and as one moves towards the final solution the algorithm successively switches to more accurate models.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>