Publicação: A branch-and-bound algorithm for the multi-stage transmission expansion planning
Carregando...
Data
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Tipo
Trabalho apresentado em evento
Direito de acesso
Acesso aberto
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.
Descrição
Palavras-chave
Algorithms, Mathematical models, Planning, Problem solving, Transportation, Branch-and-bound algorithms, DC model, Multi-stage transmission expansion, Planning problems, Electric power transmission
Idioma
Inglês
Como citar
2005 IEEE Power Engineering Society General Meeting, v. 1, p. 171-176.
