Branch and bound algorithm for transmission network expansion planning using DC model

Página do item simplificado
dc.contributor.authorRider, Marcos J.
dc.contributor.authorGarcia, Ariovaldo V.
dc.contributor.authorRomero, Rubén [UNESP]
dc.contributor.institutionIEEE
dc.contributor.institutionUniversidade Estadual de Campinas (UNICAMP)
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-27T11:22:39Z
dc.date.available2014-05-27T11:22:39Z
dc.date.issued2007-12-01
dc.description.abstractThis paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of a Branch-and-Bound (B&B) algorithm to directly solve mixed non-linear integer problems. An efficient interior point method is used to solve the non-linear programming problem at each node of the B&B tree. Tests with several known systems are presented to illustrate the performance of the proposed method. ©2007 IEEE.en
dc.description.affiliationIEEE
dc.description.affiliationDepartment of Electric Energy Systems State University of Campinas, Campinas - SP
dc.description.affiliationFaculty of Engineering of Ilha Solteira Paulista State University, Ilha Solteira - SP
dc.description.affiliationUnespFaculty of Engineering of Ilha Solteira Paulista State University, Ilha Solteira - SP
dc.format.extent1350-1355
dc.identifierhttp://dx.doi.org/10.1109/PCT.2007.4538512
dc.identifier.citation2007 IEEE Lausanne POWERTECH, Proceedings, p. 1350-1355.
dc.identifier.doi10.1109/PCT.2007.4538512
dc.identifier.scopus2-s2.0-50849145134
dc.identifier.urihttp://hdl.handle.net/11449/70027
dc.language.isoeng
dc.relation.ispartof2007 IEEE Lausanne POWERTECH, Proceedings
dc.rights.accessRightsAcesso aberto
dc.sourceScopus
dc.subjectBranch-and-bound algorithm
dc.subjectDC model
dc.subjectHigher order interior point method
dc.subjectMixed integer nonlinear programming
dc.subjectPower transmission planning
dc.subjectBoolean functions
dc.subjectComputer networks
dc.subjectDynamic programming
dc.subjectElectric power transmission
dc.subjectElectric power transmission networks
dc.subjectLinearization
dc.subjectMathematical programming
dc.subjectNonlinear programming
dc.subjectLinear programming
dc.titleBranch and bound algorithm for transmission network expansion planning using DC modelen
dc.typeTrabalho apresentado em evento
dcterms.licensehttp://www.ieee.org/publications_standards/publications/rights/rights_policies.html
unesp.campusUniversidade Estadual Paulista (Unesp), Faculdade de Engenharia, Ilha Solteirapt

Arquivos

Coleções

Artigos - Engenharia Elétrica - FEIS