You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/9780
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEstevam, C. R. N.-
dc.contributor.authorRider, M. J.-
dc.contributor.authorAmorim, E.-
dc.contributor.authorMantovani, J. R. S.-
dc.date.accessioned2014-05-20T13:29:07Z-
dc.date.accessioned2016-10-25T16:48:34Z-
dc.date.available2014-05-20T13:29:07Z-
dc.date.available2016-10-25T16:48:34Z-
dc.date.issued2010-08-01-
dc.identifierhttp://dx.doi.org/10.1049/iet-gtd.2009.0422-
dc.identifier.citationIet Generation Transmission & Distribution. Hertford: Inst Engineering Technology-iet, v. 4, n. 8, p. 963-973, 2010.-
dc.identifier.issn1751-8687-
dc.identifier.urihttp://hdl.handle.net/11449/9780-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/9780-
dc.description.abstractThis study proposes the use of a non-linear branch-and-bound (B&B) algorithm to solve the reactive power dispatch and planning problem of an electrical power system. The problem is formulated as a mixed integer non-linear programming (MINLP) problem. The MINLP is relaxed resulting in a set of non-linear programming (NLP) problems, which are solved at each node of the B&B tree through a primal dual-interior point algorithm. The non-linear B&B algorithm proposed has special fathoming criteria to deal with non-linear and multimodal optimisation models. The fathoming tests are redefined, adding a safety margin value to the objective function of each NLP problem before they are fathomed through the objective function criteria, avoiding convergence to local optimum solutions. The results are presented using three test systems from the specialised literature. The B&B algorithm found several optimum local solutions and the best solution was found after solving some NLP problems, with little computational effort.en
dc.description.sponsorshipCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)-
dc.description.sponsorshipConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)-
dc.format.extent963-973-
dc.language.isoeng-
dc.publisherInst Engineering Technology-iet-
dc.sourceWeb of Science-
dc.titleReactive power dispatch and planning using a non-linear branch-and-bound algorithmen
dc.typeoutro-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.contributor.institutionUniversidade Federal de Mato Grosso do Sul (UFMS)-
dc.description.affiliationUNESP Univ Estadual Paulista, Fac Engn Ilha Solteira, Dept Engn Elet, Ilha Solteira, SP, Brazil-
dc.description.affiliationUniv Fed Mato Grasso Sul UFMS, Dept Engn Elet, Campo Grande, MS, Brazil-
dc.description.affiliationUnespUNESP Univ Estadual Paulista, Fac Engn Ilha Solteira, Dept Engn Elet, Ilha Solteira, SP, Brazil-
dc.description.sponsorshipIdCNPq: 301060/2006-1-
dc.identifier.doi10.1049/iet-gtd.2009.0422-
dc.identifier.wosWOS:000280564200007-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofIet Generation Transmission & Distribution-
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.