Asada, Eduardo N.Carreño, Edgar [UNESP]Romero, Rubeń [UNESP]Garcia, Ariovaldo V.2014-05-272014-05-272005-10-312005 IEEE Power Engineering Society General Meeting, v. 1, p. 171-176.http://hdl.handle.net/11449/68454This 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.171-176engAlgorithmsMathematical modelsPlanningProblem solvingTransportationBranch-and-bound algorithmsDC modelMulti-stage transmission expansionPlanning problemsElectric power transmissionTrabalho apresentado em evento10.1109/PES.2005.1489071Acesso aberto2-s2.0-27144488879