Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||A Branch-and-bound Algorithm For The Multi-stage Transmission Expansion Planning|
|Abstract:||This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models or to more complex ones such as the DC model. Tests with a realistic power system were carried out in order to show the performance of the algorithm for the expansion plan executed for different time frames. © 2005 IEEE.|
|Appears in Collections:||Artigos e Materiais de Revistas Científicas - Unicamp|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.