You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/33793
Title: 
Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning
Author(s): 
Institution: 
  • Universidade Estadual Paulista (UNESP)
  • Universidade de São Paulo (USP)
  • Univ Estadual Oeste Parana
ISSN: 
1751-8687
Abstract: 
A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.
Issue Date: 
1-Mar-2007
Citation: 
Iet Generation Transmission & Distribution. Hertford: Institution Engineering Technology-iet, v. 1, n. 2, p. 318-323, 2007.
Time Duration: 
318-323
Publisher: 
Institution Engineering Technology-iet
Source: 
http://dx.doi.org/10.1049/iet-gtd:20060239
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/33793
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.