A branch-and-bound algorithm for the multi-stage transmission expansion planning
| Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
|---|---|
| Data(s) |
27/05/2014
27/05/2014
31/10/2005
|
| Resumo |
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. |
| Formato |
171-176 |
| Identificador |
http://dx.doi.org/10.1109/PES.2005.1489071 2005 IEEE Power Engineering Society General Meeting, v. 1, p. 171-176. http://hdl.handle.net/11449/68454 10.1109/PES.2005.1489071 2-s2.0-27144488879 |
| Idioma(s) |
eng |
| Relação |
2005 IEEE Power Engineering Society General Meeting |
| Direitos |
closedAccess |
| Palavras-Chave | #Algorithms #Mathematical models #Planning #Problem solving #Transportation #Branch-and-bound algorithms #DC model #Multi-stage transmission expansion #Planning problems #Electric power transmission |
| Tipo |
info:eu-repo/semantics/conferencePaper |
