You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/71390
Title: 
On the efficiency of an alternative codification for multiobjective service restoration in electric distribution networks
Author(s): 
Institution: 
  • Universidade Federal do Pampa (UNIPAMPA)
  • Universidade Estadual Paulista (UNESP)
Abstract: 
This paper proposes an alternative codification to solve the service restoration in electric power distribution networks using a SPEA2 multiobjective evolutionary algorithm, assuming the minimization of both the load not supplied and the number of switching operations involved in the restoration plan. Constrains as the line, power source and voltage drop limits in order to avoid the activation of protective devices are all included in the proposed algorithm. Experimental results have shown the convenience on considering these new representations in the sense of feasibility maintenance and also in the sense of better approximation to the Pareto set. ©2009 IEEE.
Issue Date: 
1-Dec-2009
Citation: 
Proceedings of the Universities Power Engineering Conference.
Keywords: 
  • Distribution networks
  • Genetic algorithms
  • Multiobjective optimization
  • Power systems
  • Service restoration
  • Distribution network
  • Electric distribution networks
  • Electric power
  • Multi objective
  • Multi objective evolutionary algorithms
  • Pareto set
  • Power sources
  • Protective devices
  • Switching operations
  • Voltage drop
  • College buildings
  • Distributed parameter networks
  • Electric load distribution
  • Electric power distribution
  • Electric power transmission
  • Evolutionary algorithms
  • Restoration
Source: 
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5429524&tag=1
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/71390
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.