PLANEJAMENTO DE REDE DE DISTRIBUIÇÃO DE ENERGIA ELÉTRICA COM RESTRIÇÕES GEOGRÁFICAS E ELÉTRICAS

• Ano de defesa: 2009
• Autor(a) principal: RIBEIRO, Geraldo Valeriano
• Orientador(a): MACHADO, Paulo César Miranda
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de Goiás
• Programa de Pós-Graduação: Mestrado em Engenharia Elétrica e de Computação
• Departamento: Engenharia
• País: BR
• Palavras-chave em Português: Planejamento de caminhos, Rede de Distribuição de Energia Elétrica, Otimização, Metaheurística, Hill-Climbing e Simulated Annealing.
• Palavras-chave em Inglês: Planning of paths, Electric Distribution Networks, Optimization, Metaheuristic, Hill-Climbing e Simulated Annealing.
• Área do conhecimento CNPq: CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAO::ENGENHARIA DE SOFTWARE
• Link de acesso: http://repositorio.bc.ufg.br/tede/handle/tde/979

This work presents two methods to solve the problem of Electric Distribution Networks (EDN) with geographical and power restrictions. The high cost of the project involving EDN together with lack of efficient methods when working with real applications justifies the development of this research. Taking into account concepts of heuristic and metaheuristic two methods are proposed: The first is based on the Hill-Climbing (HC) heuristic and the second is based on the Simulated Annealing (SA) metaheuristic. The possible paths are provided by the Delaunay triangulation and it is considered the natural and socio-political obstacles of the site where you want to locate a new energy network. The dimension of the EDN feeders is calculated using the power flow results from the Forward-Backward method. The initial solution is found using an intelligent method. Then the SA metaheuristic and/or HC heuristic are used providing a good solution for a new EDN in comparison with the heuristic used to find the initial solution. A comparison is also made between the two proposed methods