Transmission Expansion by Branch-and-Bound Integer Programming with Optimal Cost - Capacity Curves

Abstract

A new method is proposed in this paper to solve a single-stage expansion problem for a transmission network, given future generation and load patterns, and alternative types of lines available, subject to overload, reliability and right-of-way constraints. The problem is formulated as a series of zero-one integer programs which are solved by an efficient branch-and-bound algorithm. Complexity is reduced by the concepts of optimal cost-capacity curves and screening algorithms. A sample study is shown and the method is implemented in a computer program.