A branch-and-bound algorithm for the multi-stage transmission expansion planning

dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-27T11:21:39Z
dc.date.available2014-05-27T11:21:39Z
dc.date.created2014-05-27T11:21:39Z
dc.date.issued2005-10-31
dc.identifier2005 IEEE Power Engineering Society General Meeting, v. 1, p. 171-176.
dc.identifierhttp://hdl.handle.net/11449/68454
dc.identifier10.1109/PES.2005.1489071
dc.identifier2-s2.0-27144488879
dc.description.abstractThis 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.
dc.languageeng
dc.relation2005 IEEE Power Engineering Society General Meeting
dc.rightsAcesso aberto
dc.sourceScopus
dc.subjectAlgorithms
dc.subjectMathematical models
dc.subjectPlanning
dc.subjectProblem solving
dc.subjectTransportation
dc.subjectBranch-and-bound algorithms
dc.subjectDC model
dc.subjectMulti-stage transmission expansion
dc.subjectPlanning problems
dc.subjectElectric power transmission
dc.titleA branch-and-bound algorithm for the multi-stage transmission expansion planning
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución