Metaheurística para o problema de planejamento de redes de transmissão de energia elétrica com redimensionamento

• Autor(a) principal: Silva, Pedro Henrique González
• Data de Publicação: 2012
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Biblioteca Digital de Teses e Dissertações da UERJ
• Texto Completo: http://www.bdtd.uerj.br/handle/1/7683
• topic: Combinatorial optimization; Transmission network; Network design; Meta-heuristics; Otimização combinatória; Redes elétricas; Programação heurística; Otimização Combinatória; Redes de transmissão; Planejamento de redes; Metaheurística; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO

At times, the electrical load in diferent areas varies, claiming the construction of new electric generators and the expansion of the electrical transmission network. In this dissertation we focus on the transmission expansion planning problem, assuming that new generators are built to meet the new demands. This expansion requires large investments, which need to be carefully planned. This problem can be modeled as a mixed nonlinear programming problem, considered to be a NP-hard problem. Therefore a heuristic approach may be appropriate for its solution because it might be able to provide good solutions in satisfactory computational time. This dissertation intends to present a study of both the static and multistage transmission expansion planning problem. We present first a review of the most interesting works found in the technical literature. Then, we present metaheuristics for the static and multistage problems with re-design. These etaheuristics extend known algorithms for the problems without re-design. For the static problem, we extend a GRASP procedure and for the multistage problem, we embed the GRASP (or an exact method) into a backward-forward algorithm. We test our algorithms on real-based power transmission networks and compare them to the results found in the litterature.