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

Author

Rider, Marcos J. ; Garcia, Ariovaldo V. ; Romero, Rubén

Author_Institution

Dept. of Electr. Energy Syst., State Univ. of Campinas, Campinas

fYear

2007

Firstpage

1350

Lastpage

1355

Abstract

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.

Keywords

nonlinear programming; power transmission planning; tree searching; DC model; branch-and-bound algorithm; higher order interior point method; mixed integer nonlinear programming; power transmission planning; transmission network expansion planning; Circuits; Heuristic algorithms; Linear programming; Mathematical model; Power generation; Power system modeling; Power system planning; Power system simulation; System testing; Voltage; Branch-and-Bound algorithm; DC model; Power transmission planning; higher order interior point method; mixed integer nonlinear programming;

fLanguage

English

Publisher

ieee

Conference_Titel

Power Tech, 2007 IEEE Lausanne

Conference_Location

Lausanne

Print_ISBN

978-1-4244-2189-3

Electronic_ISBN

978-1-4244-2190-9

Type

conf

DOI

10.1109/PCT.2007.4538512

Filename

4538512