You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/72455
Title: 
A combinatorial approach for transmission expansion & reactive power planning
Author(s): 
Institution: 
  • Universidade Estadual Paulista (UNESP)
  • Shahid Bahonar University of Kerman
  • International Center for Science and Technology and Environmental Sciences
  • Universidade Estadual do Oeste do Paraná (UNIOESTE)
Abstract: 
A metaheuristic technique for solving the short-term transmission network expansion and reactive power planning problems, at the same time, in regulated power systems using the AC model is presented. The problem is solved using a real genetic algorithm (RGA). For each topology proposed by RGA an indicator is employed to identify the weak buses for new reactive power sources allocation. The fitness function is calculated using the cost of each configuration as well as constraints deviation of an AC optimal power flow (OPF) in which the minimum reactive generation of new reactive sources and the active power losses are objectives. With allocation of reactive power sources at load buses, the circuit capacity increases and the cost of installation could be decreased. The method is tested in a well known test system, presenting good results when compared with other approaches. © 2011 IEEE.
Issue Date: 
31-May-2011
Citation: 
2010 IEEE/PES Transmission and Distribution Conference and Exposition: Latin America, T and D-LA 2010, p. 529-536.
Time Duration: 
529-536
Keywords: 
  • L indicator
  • reactive power planning
  • reactive sources
  • real genetic algorithm
  • transmission expansion planning
  • weak buses
  • Buses
  • Electric power transmission
  • Expansion
  • Genetic algorithms
  • Reactive power
Source: 
http://dx.doi.org/10.1109/TDC-LA.2010.5762933
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/72455
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.