Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/70027
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Rider, Marcos J. | - |
dc.contributor.author | Garcia, Ariovaldo V. | - |
dc.contributor.author | Romero, Rubén | - |
dc.date.accessioned | 2014-05-27T11:22:39Z | - |
dc.date.accessioned | 2016-10-25T18:24:38Z | - |
dc.date.available | 2014-05-27T11:22:39Z | - |
dc.date.available | 2016-10-25T18:24:38Z | - |
dc.date.issued | 2007-12-01 | - |
dc.identifier | http://dx.doi.org/10.1109/PCT.2007.4538512 | - |
dc.identifier.citation | 2007 IEEE Lausanne POWERTECH, Proceedings, p. 1350-1355. | - |
dc.identifier.uri | http://hdl.handle.net/11449/70027 | - |
dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/70027 | - |
dc.description.abstract | This 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.format.extent | 1350-1355 | - |
dc.language.iso | eng | - |
dc.source | Scopus | - |
dc.subject | Branch-and-bound algorithm | - |
dc.subject | DC model | - |
dc.subject | Higher order interior point method | - |
dc.subject | Mixed integer nonlinear programming | - |
dc.subject | Power transmission planning | - |
dc.subject | Boolean functions | - |
dc.subject | Computer networks | - |
dc.subject | Dynamic programming | - |
dc.subject | Electric power transmission | - |
dc.subject | Electric power transmission networks | - |
dc.subject | Linearization | - |
dc.subject | Mathematical programming | - |
dc.subject | Nonlinear programming | - |
dc.subject | Linear programming | - |
dc.title | Branch and bound algorithm for transmission network expansion planning using DC model | en |
dc.type | outro | - |
dc.contributor.institution | IEEE | - |
dc.contributor.institution | Universidade Estadual de Campinas (UNICAMP) | - |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
dc.description.affiliation | IEEE | - |
dc.description.affiliation | Department of Electric Energy Systems State University of Campinas, Campinas - SP | - |
dc.description.affiliation | Faculty of Engineering of Ilha Solteira Paulista State University, Ilha Solteira - SP | - |
dc.description.affiliationUnesp | Faculty of Engineering of Ilha Solteira Paulista State University, Ilha Solteira - SP | - |
dc.identifier.doi | 10.1109/PCT.2007.4538512 | - |
dc.rights.accessRights | Acesso restrito | - |
dc.relation.ispartof | 2007 IEEE Lausanne POWERTECH, Proceedings | - |
dc.identifier.scopus | 2-s2.0-50849145134 | - |
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.