You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/71485
Title: 
An efficient codification to solve distribution network reconfiguration for loss reduction problem
Author(s): 
Institution: 
Universidade Estadual Paulista (UNESP)
Sponsorship: 
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Sponsorship Process Number: 
  • CNPq: 141281/2004-9
  • CNPq: 00294-2007
Abstract: 
Evolutionary algorithms have been used to try to solve distribution network reconfiguration for loss reduction problem with a certain degree of success. But some problems, specially related to a codification that is able to represent and work with a complex multiconstraint and combinatorial problem such as this one, have prevented the use of the full potential of these algorithms to find quality solutions for large systems with minor computational effort. This paper proposes a solution to this problem, with a new codification and using an efficient way for implementing the operator of recombination to guaranty, at all times, the production of new radial topologies. The algorithm is presented and tested in a real distribution system, showing excellent results and computational efficiency. ©2009 IEEE.
Issue Date: 
17-Dec-2009
Citation: 
2009 IEEE Power and Energy Society General Meeting, PES '09.
Keywords: 
  • Combinatorial problem
  • Computational effort
  • Distribution network reconfiguration
  • Large system
  • Loss reduction
  • Multi-constraints
  • Radial topology
  • Real distribution
  • Combinatorial mathematics
  • Distributed parameter networks
  • Evolutionary algorithms
  • Mathematical operators
  • Potential energy
  • Potential energy surfaces
  • Computational efficiency
Source: 
http://dx.doi.org/10.1109/PES.2009.5275750
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/71485
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.