Branch and Bound Algorithm for Transmission Network Expansion Planning Using DC Model

This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of a Branch- and-Bound (B&B) algorithm to directly solve mixed non-linear integer problems. An efficient interior point method is used to solve the non-linear programming problem at each node of the B&B tree. Tests with several known systems are presented to illustrate the performance of the proposed method.

I. Introduction

THE objective of the power system transmission network expansion planning (TNEP) problem is to obtain the optimum expansion plan, that is the transmission lines and/or transformers that must be added to a network in order to make its operation viable for a pre-defined horizon of planning, at a minimum cost [1].