You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/9842
Title: 
Efficient heuristic algorithm used for optimal capacitor placement in distribution systems
Author(s): 
Institution: 
  • Universidade Estadual de Campinas (UNICAMP)
  • Universidade Estadual Paulista (UNESP)
ISSN: 
0142-0615
Abstract: 
An efficient heuristic algorithm is presented in this work in order to solve the optimal capacitor placement problem in radial distribution systems. The proposal uses the solution from the mathematical model after relaxing the integrality of the discrete variables as a strategy to identify the most attractive bus to add capacitors to each step of the heuristic algorithm. The relaxed mathematical model is a nonlinear programming problem and is solved using a specialized interior point method, The algorithm still incorporates an additional strategy of local search that enables the finding of a group of quality solutions after small alterations in the optimization strategy. Proposed solution methodology has been implemented and tested in known electric systems getting a satisfactory outcome compared with metaheuristic methods.The tests carried out in electric systems known in specialized literature reveal the satisfactory outcome of the proposed algorithm compared with metaheuristic methods. (C) 2009 Elsevier Ltd. All rights reserved.
Issue Date: 
1-Jan-2010
Citation: 
International Journal of Electrical Power & Energy Systems. Oxford: Elsevier B.V., v. 32, n. 1, p. 71-78, 2010.
Time Duration: 
71-78
Publisher: 
Elsevier B.V.
Keywords: 
  • Optimal capacitor placement
  • Distribution systems
  • Heuristic algorithms
  • Non-linear programming
  • Radial power flow
Source: 
http://dx.doi.org/10.1016/j.ijepes.2009.06.024
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/9842
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.