Branch and bound algorithm for transmission network expansion planning using DC model
MetadataShow full item record
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.
How to cite this document
Showing items related by title, author, creator and subject.
Lopez-Lezama, J. M.; Padilha-Feltrin, A. ; Contreras, J.; Muñoz, J. I. (2010 IEEE PES Transmission and Distribution Conference and Exposition: Smart Solutions for a Changing World, 2010) [Trabalho apresentado em evento]A bilevel programming approach for the optimal contract pricing of distributed generation (DG) in distribution networks is presented. The outer optimization problem corresponds to the owner of the DG who must decide the ...
Gallego, Luis A. ; Rider, Marcos J.; Romero, Rubén ; Garcia, Ariovaldo V. (2009 IEEE Bucharest PowerTech: Innovative Ideas Toward the Electrical Grid of the Future, 2009) [Trabalho apresentado em evento]In this paper, the short term transmission network expansion planning (STTNEP) is solved through a specialized genetic algorithm (SGA). A complete AC model of the transmission network is used, which permits the formulation ...
Planejamento de Fontes Reativas em Sistemas de Energia Elétrica utilizando a técnica de Decomposição de Benders e o algoritmo de Branch-and-Bound Mantovani, José R. S. ; Scucuglia, José W.; Romero, Rubén ; Garcia, Ariovaldo V. (Controle y Automacao, 2001) [Artigo]This paper presents the Benders decomposition technique and Branch and Bound algorithm used in the reactive power planning in electric energy systems. The Benders decomposition separates the planning problem into two ...