You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/72738
Title: 
An application of a modified constructive heuristic algorithm to transmission expansion planning
Author(s): 
Institution: 
  • Shahid Bahonar University of Kerman
  • Kerman Branch
  • Universidade Estadual Paulista (UNESP)
Abstract: 
Transmission expansion planning (TEP) is a non-convex optimization problem that can be solved via different heuristic algorithms. A variety of classical as well as heuristic algorithms in literature are addressed to solve TEP problem. In this paper a modified constructive heuristic algorithm (CHA) is proposed for solving such a crucial problem. Most of research papers handle TEP problem by linearization of the non-linear mathematical model while in this research TEP problem is solved via CHA using non-linear model. The proposed methodology is based upon Garver's algorithm capable of applying to a DC model. Simulation studies and tests results on the well known transmission network such as: Garver and IEEE 24-bus systems are carried out to show the significant performance as well as the effectiveness of the proposed algorithm. © 2011 IEEE.
Issue Date: 
5-Oct-2011
Citation: 
2011 IEEE PES Trondheim PowerTech: The Power of Technology for a Sustainable Society, POWERTECH 2011.
Keywords: 
  • Constructive heuristic algorithm
  • DC model
  • Load-Shedding
  • Non-linear problem
  • Transmission expansion planning
  • Load-shedding
  • Nonlinear problems
  • Computer simulation
  • Convex optimization
  • DC power transmission
  • Expansion
  • Mathematical models
  • Problem solving
  • Sustainable development
  • Thermoelectric power
  • Heuristic algorithms
Source: 
http://dx.doi.org/10.1109/PTC.2011.6019239
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/72738
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.