Title
Branch and bound algorithm for transmission network expansion planning using DC model
Date Issued
01 December 2007
Access level
metadata only access
Resource Type
conference paper
Author(s)
Rider M.J.
Garcia A.V.
Romero R.
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. ©2007 IEEE.
Start page
1350
End page
1355
Language
English
OCDE Knowledge area
Ingeniería eléctrica, Ingeniería electrónica
Subjects
Scopus EID
2-s2.0-50849145134
ISBN
9781424421909
Source
2007 IEEE Lausanne POWERTECH, Proceedings
Resource of which it is part
2007 IEEE Lausanne POWERTECH, Proceedings
Conference
2007 IEEE Lausanne POWERTECH
Sources of information:
Directorio de Producción Científica
Scopus