Actas de congresos
Branch and bound algorithm for transmission network expansion planning using DC model
2007 IEEE Lausanne POWERTECH, Proceedings, p. 1350-1355.
Universidade Estadual de Campinas (UNICAMP)
Universidade Estadual Paulista (UNESP)
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.
Showing items related by title, author, creator and subject.
Lopez-Lezama, J. M.; Padilha-Feltrin, A.; Contreras, J.; Muñoz, J. I.
Gallego, Luis A.; Rider, Marcos J.; Romero, Rubén; Garcia, Ariovaldo V.
Optimisation-based Switch Allocation To Improve Energy Losses And Service Restoration In Radial Electrical Distribution Systems Lopez; Juan Camilo; Franco; John Fredy; Rider; Marcos J.