You are in the accessibility menu

Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHaffner, S.-
dc.contributor.authorMonticelli, A.-
dc.contributor.authorGarcia, A.-
dc.contributor.authorMantovani, J.-
dc.contributor.authorRomero, R.-
dc.identifier.citationIee Proceedings-generation Transmission and Distribution. Hertford: IEE-inst Elec Eng, v. 147, n. 3, p. 149-156, 2000.-
dc.description.abstractA method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)-
dc.sourceWeb of Science-
dc.titleBranch and bound algorithm for transmission system expansion planning using a transportation modelen
dc.contributor.institutionUniversidade Estadual de Campinas (UNICAMP)-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.description.affiliationUniv Campinas, Elect Energy Syst Dept, BR-13081907 Campinas, SP, Brazil-
dc.description.affiliationUNESP, FEIS, BR-15385000 Ilha Solteira, SP, Brazil-
dc.description.affiliationUnespUNESP, FEIS, BR-15385000 Ilha Solteira, SP, Brazil-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofIEE Proceedings: Generation, Transmission and Distribution-
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.