Otimização do problema de reconfiguração de sistemas de distribuição de energia elétrica por meio das Meta-Heurísticas Busca Tabu, GRASP e Path Relinking
Carregando...
Arquivos
Data
2020-04-29
Autores
Marinho, Max Robert
Título da Revista
ISSN da Revista
Título de Volume
Editor
Universidade Estadual Paulista (Unesp)
Resumo
O problema de reconfiguração de sistemas de distribuição de energia elétrica consiste em encontrar uma configuração radial por meio da permutação do estado das chaves (abertura ou fechamento) dos ramos de um sistema elétrico. O objetivo é de se alcançar a minimização das perdas elétricas. Cada configuração radial só é considerada factível se respeitar certas restrições operacionais como o limite de tensão nas barras e os limites de correntes nos circuitos. O modelo tratado neste trabalho apresenta explosão combinatória e difícil tratabilidade por meio de métodos convencionais de otimização. O problema, computacionalmente falando, é considerado Não-Polinomial Completo (NPC), pois não possui uma resposta em tempo polinomial a partir de uma entrada definida. Neste trabalho são apresentadas três técnicas meta-heurísticas para se tratar o problema de reconfiguração de sistemas de distribuição de energia elétrica, totalmente diferentes entre uma e outra, atuando em conjunto, para somente um nível de demanda, no intuito de se encontrar a topologia ótima, com o objetivo de se minimizar as perdas elétricas ativas. Além disso, propôs-se modificar o paradigma clássico de implementação estático deste tipo de problema para o paradigma de programação dinâmica por meio de árvores com filhos variados a fim de que a estrutura de dados utilizada representasse fielmente um sistema de distribuição de energia elétrica na memória do computador. As meta-heurísticas implementadas foram a Greedy Randomized Adaptive Search Procedure (GRASP) como estratégia de obtenção de uma configuração inicial de boa qualidade; a Busca Tabu (BT) como procedimento de busca local; e a técnica de Path Relinking (PR) como mecanismo de pós-otimização. Todo o programa foi implementado em linguagem C com uso da IDE Code Blocks 17.12. Os testes foram realizados com sistemas de pequeno, médio e grande porte de 14, 33, 84, 136 e 415 barras. As técnicas comparativas envolveram resultados da literatura especializada e obtidos por meio de outros procedimentos meta-heurísticos.
The distribution network reconfiguration problem is based on finding a radial configuration through the electrical system branches switches permutation (opening or closing). The objective is to achieve the electrical losses minimization. Each radial configuration is only considered feasible if it complies with certain operational constraints such as the voltage levels on the buses and the current limits on the circuits. The model treated in this work has a combinatorial explosion and is difficult to treat using conventional optimization methods. The problem, computationally speaking, is considered Non-Polynomial Complete (NPC), as it does not have a polynomial time response from a defined input. In this work, three metaheuristic techniques are presented to deal with the distribution network reconfiguration, totally different from one to the other, acting together, for only one level of demand, in order to find the optimal topology, in order to minimize active electrical losses. In addition, it was proposed to modify the classic static implementation paradigm of this type of problem to the dynamic programming paradigm by means of trees with varied children so that the data structure used would faithfully represent an electrical energy distribution system in the computer memory. The implemented meta-heuristics were the Greedy Randomized Adaptive Search Procedure (GRASP) as a strategy to obtain a good quality initial configuration; Tabu Search (BT) as a local search procedure; and the Path Relinking (PR) technique as a postoptimization mechanism. The entire program was implemented in C language using Code Blocks 17.12 IDE. The tests were carried out with small, medium and large systems of 14, 33, 84, 136 and 415 buses. The comparative techniques involved results from the specialized literature and obtained through other meta-heuristic procedures.
The distribution network reconfiguration problem is based on finding a radial configuration through the electrical system branches switches permutation (opening or closing). The objective is to achieve the electrical losses minimization. Each radial configuration is only considered feasible if it complies with certain operational constraints such as the voltage levels on the buses and the current limits on the circuits. The model treated in this work has a combinatorial explosion and is difficult to treat using conventional optimization methods. The problem, computationally speaking, is considered Non-Polynomial Complete (NPC), as it does not have a polynomial time response from a defined input. In this work, three metaheuristic techniques are presented to deal with the distribution network reconfiguration, totally different from one to the other, acting together, for only one level of demand, in order to find the optimal topology, in order to minimize active electrical losses. In addition, it was proposed to modify the classic static implementation paradigm of this type of problem to the dynamic programming paradigm by means of trees with varied children so that the data structure used would faithfully represent an electrical energy distribution system in the computer memory. The implemented meta-heuristics were the Greedy Randomized Adaptive Search Procedure (GRASP) as a strategy to obtain a good quality initial configuration; Tabu Search (BT) as a local search procedure; and the Path Relinking (PR) technique as a postoptimization mechanism. The entire program was implemented in C language using Code Blocks 17.12 IDE. The tests were carried out with small, medium and large systems of 14, 33, 84, 136 and 415 buses. The comparative techniques involved results from the specialized literature and obtained through other meta-heuristic procedures.
Descrição
Palavras-chave
Busca Tabu, Path Relinking, GRASP, Reconfiguração de sistemas de distribuição de energia elétrica, Otimização de fluxo de potência, Tabu Search, Distribution network reconfiguration, Power flow optimization