Algoritmo híbrido aplicado ao planejamento da expansão de redes aéreas de média tensão
| Ano de defesa: | 2016 |
|---|---|
| Autor(a) principal: |
Cuno, Miguel Angel Sánchez
 |
| Orientador(a): |
Rocha , Carlos Roberto Mendonça da
|
| Banca de defesa: |
Rocha, Carlos Roberto Mendonça da
,
Freitas, Ricardo Luiz Barros de
,
Romero Lázaro, Rúben Augusto
|
| Tipo de documento: | Dissertação |
| Tipo de acesso: | Acesso aberto |
| Idioma: | por |
| Instituição de defesa: |
Universidade Estadual do Oeste do Paraná
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: |
Brasil
|
| Palavras-chave em Português: | |
| Palavras-chave em Inglês: | |
| Área do conhecimento CNPq: | |
| Link de acesso: | http://tede.unioeste.br/handle/tede/3401 |
Resumo: | This work presents the development of a Hybrid Algorithm to solve the problem of Planning the Expansion of Medium Voltage Overhead Networks. The Hybrid Algorithm uses two strategies to solve the problem. First uses a Constructive Heuristic Algorithm that tries to work with parameters instead of working with variables, with the objective of reducing the convergence time to the research process trying not to impair the quality of the solution. The second strategy is based in a Branch and Bound Algorithm, that uses the solution of the problem obtained as a starting point while the first strategy is running. Thus, this solution is used like incumbent in the second process. In this context the hybrid algorithm developed and implemented in this work, takes advantage of reducing the convergence time of the Constructive Heuristic Algorithm and the advantage of guarantee that the solution has the best quality, which are the solutions produced by algorithms type Branch and Bound. The Algorithm has been tested in three test systems, being established a plan to expand overhead medium voltage networks for each system. |