Algoritmo especializado aplicado ao planejamento da expansão de redes aéreas de sistemas de distribuição

Detalhes bibliográficos
Ano de defesa: 2014
Autor(a) principal: Mendonça, Willian Douglas Ferrari lattes
Orientador(a): Rocha, Carlos Roberto Mendonça da lattes
Banca de defesa: Florez, Hugo Andrés Ruiz lattes, Franco, Edgar Manuel Carreño lattes
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 de Sistemas Dinâmicos e Energéticos
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/1077
Resumo: In this Master's Dissertation is presented the development of a specialized algorithm for planning the expansion of pole networks of distribution systems. The technique used for solution is the Constructive Heuristics that has been used together with mathematical optimization models to solve the problem. However the presented algorithm does not employ a mathematical optimization model, in other words, a model compound of objective function and constraints. So, instead of working with variables, we seek to work with parameters, with the objective of providing greater speed to the research process, simplifying the search process for the final topology always keeping committed to finding a solution of good quality. Despite not having a guarantee that the solution is the global optimum, the solutions obtained by this type of algorithm solutions are almost always of excellent quality and can be used as a starting point for algorithms that use techniques or more complex mathematical models. To assist the Constructive Heuristic Algorithm in the search for the final topology is used a specialized routine for the calculation of AC power flow The methodology used by the subroutine for these calculations is based on the Backward Forward Sweep algorithm.