Branch and bound algorithm for transmission system expansion planning using a transportation model

Author

Haffner, S. ; Monticelli, A. ; Garcia, A. ; Mantovani, J. ; Romero, R.

Author_Institution

Dept. of Electic Energy Syst., Sao Paulo Univ., Brazil

Volume

147

Issue

3

fYear

2000

fDate

5/1/2000 12:00:00 AM

Firstpage

149

Lastpage

156

Abstract

A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been tested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature

Keywords

optimisation; power transmission planning; transmission network calculations; tree searching; branch and bound algorithm; hierarchical Benders decomposition; linear program; master subproblem; slave subproblem; transmission system expansion planning optimisation; transportation model;

fLanguage

English

Journal_Title

Generation, Transmission and Distribution, IEE Proceedings-

Publisher

iet

ISSN

1350-2360

Type

jour

DOI

10.1049/ip-gtd:20000337

Filename

848584