A branch-and-bound algorithm for the multi-stage transmission expansion planning
Loading...
External sources
External sources
Date
Advisor
Coadvisor
Graduate program
Undergraduate course
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Type
Work presented at event
Access right
Acesso aberto
External sources
External sources
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.
Description
Language
English
Citation
2005 IEEE Power Engineering Society General Meeting, v. 1, p. 171-176.
