A metaheuristic to solve the transmission expansion planning

Romero, Ruben; Rider, M. J.; Silva, Irenio de J.

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/31230

Title:

A metaheuristic to solve the transmission expansion planning

Author(s):

Institution:

Universidade Estadual Paulista (UNESP)
Universidade Estadual de Campinas (UNICAMP)

ISSN:

0885-8950

Abstract:

In this letter, a genetic algorithm (GA) is applied to solve - the static and multistage transmission expansion planning (TEP) problem. The characteristics of the proposed GA to solve the TEP problem are presented. Results using some known systems show that the proposed GA solves a smaller number of linear programming problems in order to find the optimal solutions and obtains a better solution for the multistage TEP problem.

Issue Date:

1-Nov-2007

Citation:

IEEE Transactions on Power Systems. Piscataway: IEEE-Inst Electrical Electronics Engineers Inc., v. 22, n. 4, p. 2289-2291, 2007.

Time Duration:

2289-2291

Publisher:

Institute of Electrical and Electronics Engineers (IEEE)

Keywords:

combinatorial optimization
genetic algorithm
metaheuristics
transmission expansion planning

Source:

http://dx.doi.org/10.1109/TPWRS.2007.907592

URI:

Access Rights:

Acesso restrito

Type:

outro

Source:

http://repositorio.unesp.br/handle/11449/31230

Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.

Show full item record View Statistics