Branch and bound algorithm for transmission network expansion planning using DC model
Nenhuma Miniatura disponível
Data
2007-12-01
Autores
Rider, Marcos J.
Garcia, Ariovaldo V.
Romero, Rubén [UNESP]
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
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.
Descrição
Palavras-chave
Branch-and-bound algorithm, DC model, Higher order interior point method, Mixed integer nonlinear programming, Power transmission planning, Boolean functions, Computer networks, Dynamic programming, Electric power transmission, Electric power transmission networks, Linearization, Mathematical programming, Nonlinear programming, Linear programming
Como citar
2007 IEEE Lausanne POWERTECH, Proceedings, p. 1350-1355.