Specialised branch-and-bound algorithm for transmission network expansion planning

Página do item simplificado
dc.contributor.authorHaffner, S.
dc.contributor.authorMonticelli, A.
dc.contributor.authorGarcia, A.
dc.contributor.authorRomero, R.
dc.contributor.institutionPontifícia Universidade Católica do Rio Grande do Sul (PUCRS)
dc.contributor.institutionUniversidade Estadual de Campinas (UNICAMP)
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T15:24:07Z
dc.date.available2014-05-20T15:24:07Z
dc.date.issued2001-09-01
dc.description.abstractAn algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.en
dc.description.affiliationPontifical Catholic Univ Rio Grande Sul, Dept Elect Engn, BR-90619900 Porto Alegre, RS, Brazil
dc.description.affiliationUniv Estadual Campinas, Dept Elect Energy Syst, BR-13081970 Campinas, SP, Brazil
dc.description.affiliationPaulista State Univ, Fac Engn Ilha Solteira, BR-15385000 Ilha Solteira, SP, Brazil
dc.description.affiliationUnespPaulista State Univ, Fac Engn Ilha Solteira, BR-15385000 Ilha Solteira, SP, Brazil
dc.format.extent482-488
dc.identifierhttp://dx.doi.org/10.1049/ip-gtd:20010502
dc.identifier.citationIee Proceedings-generation Transmission and Distribution. Hertford: IEE-inst Elec Eng, v. 148, n. 5, p. 482-488, 2001.
dc.identifier.doi10.1049/ip-gtd:20010502
dc.identifier.issn1350-2360
dc.identifier.urihttp://hdl.handle.net/11449/34773
dc.identifier.wosWOS:000171849100016
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.titleSpecialised branch-and-bound algorithm for transmission network expansion planningen
dc.typeArtigo
dcterms.licensehttp://www.ieee.org/publications_standards/publications/rights/rights_policies.html
dcterms.rightsHolderIee-inst Elec Eng

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:

Coleções

Artigos