You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/9804
Title: 
A Constructive Heuristic Algorithm for Distribution System Planning
Author(s): 
Institution: 
  • Universidade Estadual de Campinas (UNICAMP)
  • Universidade Estadual Paulista (UNESP)
ISSN: 
0885-8950
Abstract: 
A constructive heuristic algorithm (CHA) to solve distribution system planning (DSP) problem is presented. The DSP is a very complex mixed binary nonlinear programming problem. A CHA is aimed at obtaining an excellent quality solution for the DSP problem. However, a local improvement phase and a branching technique were implemented in the CHA to improve its solution. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution system. This sensitivity index is obtained by solving the DSP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. Results of two tests systems and one real distribution system are presented in this paper in order to show the ability of the proposed algorithm.
Issue Date: 
1-Aug-2010
Citation: 
IEEE Transactions on Power Systems. Piscataway: IEEE-Inst Electrical Electronics Engineers Inc, v. 25, n. 3, p. 1734-1742, 2010.
Time Duration: 
1734-1742
Publisher: 
Institute of Electrical and Electronics Engineers (IEEE)
Keywords: 
  • AMPL
  • constructive heuristic algorithm
  • distribution system planning
  • KNITRO
  • mixed binary nonlinear programming
  • power systems optimization
Source: 
http://dx.doi.org/10.1109/TPWRS.2009.2038164
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/9804
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.