Algoritmo heurístico especializado aplicado ao planejamento da expansão de sistemas de distribuição de energia elétrica
Ano de defesa: | 2016 |
---|---|
Autor(a) principal: | |
Orientador(a): | |
Banca de defesa: | , |
Tipo de documento: | Dissertação |
Tipo de acesso: | Acesso aberto |
Idioma: | por |
Instituição de defesa: |
Universidade Estadual do Oeste do Parana
Foz do Iguaçu |
Programa de Pós-Graduação: |
Programa de Pós-Graduação em Engenharia Elétrica e Computação
|
Departamento: |
Centro de Engenharias e Ciências Exatas
|
País: |
BR
|
Palavras-chave em Português: | |
Palavras-chave em Inglês: | |
Área do conhecimento CNPq: | |
Link de acesso: | http://tede.unioeste.br:8080/tede/handle/tede/1035 |
Resumo: | In this Master`s Dissertation is presented the development of a specialized heuristic algorithm for planning the expansion of distribution systems. This new heuristic algorithm has the constructive character, because in each iteration goes to search for a new solution to the problem. The algorithm used in this work does not use an objective function with the system bus data and system line data to find a new solution. Another advantage of this algorithm is the technique used to find the final topology, the specialized heuristic algorithm uses destructive technique for finding the final topology, on which, for each iteration, one line that is present in the current system configuration, is removed. To select the line to be removed, the algorithm used a subroutine of a power flow calculation by the Newton Raphson method, and the results obtained are used to compose the sensitivity indicators. Which the established indicators, the algorithm checks violation load service, and if there is no violation, the line is removed from the system and proceeds to the next iteration . This process is performed to find a final topology for the problem with the commitment to find a good solution. The algorithm was used to solve the problem considering testing system known in the specialized literature and the results which were obtained show that the algorithm is robust and fast to determine the final topology for the system. |