Utilize este identificador para citar ou criar um link para este item:
http://acervodigital.unesp.br/handle/11449/68454- Título:
- A branch-and-bound algorithm for the multi-stage transmission expansion planning
- Universidade Estadual de Campinas (UNICAMP)
- Universidade Estadual Paulista (UNESP)
- 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.
- 31-Out-2005
- 2005 IEEE Power Engineering Society General Meeting, v. 1, p. 171-176.
- 171-176
- Algorithms
- Mathematical models
- Planning
- Problem solving
- Transportation
- Branch-and-bound algorithms
- DC model
- Multi-stage transmission expansion
- Planning problems
- Electric power transmission
- http://dx.doi.org/10.1109/PES.2005.1489071
- Acesso restrito
- outro
- http://repositorio.unesp.br/handle/11449/68454
Não há nenhum arquivo associado com este item.
Itens do Acervo digital da UNESP são protegidos por direitos autorais reservados a menos que seja expresso o contrário.