Branch and bound algorithm for transmission system expansion planning using a transportation model

dc.contributor.authorHaffner, S.
dc.contributor.authorMonticelli, A.
dc.contributor.authorGarcia, A.
dc.contributor.authorMantovani, J.
dc.contributor.authorRomero, R.
dc.contributor.institutionUniversidade Estadual de Campinas (UNICAMP)
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T15:23:56Z
dc.date.available2014-05-20T15:23:56Z
dc.date.issued2000-05-01
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.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.format.extent149-156
dc.identifierhttp://dx.doi.org/10.1049/ip-gtd:20000337
dc.identifier.citationIee Proceedings-generation Transmission and Distribution. Hertford: IEE-inst Elec Eng, v. 147, n. 3, p. 149-156, 2000.
dc.identifier.doi10.1049/ip-gtd:20000337
dc.identifier.issn1350-2360
dc.identifier.urihttp://hdl.handle.net/11449/34617
dc.identifier.wosWOS:000087598100003
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.ispartofIEE Proceedings: Generation, Transmission and Distribution
dc.rights.accessRightsAcesso restrito
dc.sourceWeb of Science
dc.titleBranch and bound algorithm for transmission system expansion planning using a transportation modelen
dc.typeArtigo
dcterms.licensehttp://www.ieee.org/publications_standards/publications/rights/rights_policies.html
dcterms.rightsHolderIee-inst Elec Eng
unesp.campusUniversidade Estadual Paulista (Unesp), Faculdade de Engenharia, Ilha Solteirapt

Arquivos

Licença do Pacote
Agora exibindo 1 - 1 de 1
Nenhuma Miniatura disponível
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição: