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

dc.contributorIEEE
dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-27T11:22:39Z
dc.date.available2014-05-27T11:22:39Z
dc.date.created2014-05-27T11:22:39Z
dc.date.issued2007-12-01
dc.identifier2007 IEEE Lausanne POWERTECH, Proceedings, p. 1350-1355.
dc.identifierhttp://hdl.handle.net/11449/70027
dc.identifier10.1109/PCT.2007.4538512
dc.identifier2-s2.0-50849145134
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.
dc.languageeng
dc.relation2007 IEEE Lausanne POWERTECH, Proceedings
dc.rightsAcesso 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 model
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución