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
- Universidade Estadual Paulista (UNESP)
- Universidade de São Paulo (USP)
- Univ Estadual Oeste Parana
- 1751-8687
- 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.
- 1-Mar-2007
- Iet Generation Transmission & Distribution. Hertford: Institution Engineering Technology-iet, v. 1, n. 2, p. 318-323, 2007.
- 318-323
- Institution Engineering Technology-iet
- http://dx.doi.org/10.1049/iet-gtd:20060239
- Acesso restrito
- outro
- http://repositorio.unesp.br/handle/11449/33793
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.