Planejamento de reativos em sistemas de energia elétrica através de um algoritmo de Branch-and-Bound não linear
Carregando...
Data
2008-11-28
Autores
Estevam, Celia Regina Nugoli [UNESP]
Título da Revista
ISSN da Revista
Título de Volume
Editor
Universidade Estadual Paulista (Unesp)
Resumo
Neste trabalho, propõe-se um algoritmo Branch and Bound não linear para resolver o problema de planejamento e despacho ótimo de fontes de potência reativa em sistemas de energia elétrica. O modelo de planejamento é formulado como um problema de programação não linear inteiro misto, não convexo e de grande porte. Este modelo consiste na minimização dos custos das fontes reativas contínuas e ou discretas que devem ser alocadas no sistema. As restrições consideradas no modelo devem assegurar a qualidade e a confiabilidade do suprimento de energia para os consumidores, mantendo as magnitudes das tensões dentre seus limites pré-estabelecidos, atendendo as demandas de potência ativa e reativa e um conjunto de restrições físicas e operacionais dos equipamentos instalados no sistema tais como: limite nas capacidades de geradores, compensadores síncronos e estáticos e os limites na variação dos “taps” dos transformadores. O aspecto relevante deste trabalho é que o algoritmo proposto resolve diretamente problemas de programação não lineares inteiros misto, resolvendo em cada nó da árvore de Branch and Bound um problema de programação não linear que é o despacho ótimo de fontes reativas, em que as restrições de discretização das variáveis de alocação ou investimento dos bancos de capacitores e indutores são relaxadas. Estes problemas são resolvidos utilizando o método de pontos interiores (MPI) primal-dual preditor-corretor, que geralmente melhora o desempenho do MPI. O algoritmo Branch and Bound não linear proposto possui técnicas eficientes para a escolha do próximo subproblema que deve ser resolvido assim como a variável de separação dos subproblemas e os testes de sondagem. Para contornar os problemas de mínimos locais que são encontrados na resolução dos problemas de programação não linear, os testes de sondagem foram redefinidos...
A nonlinear Branch and Bound algorithm to solve the problem of reactive optimal dispatch and planning of electrical power systems is proposed in this work. The planning model is formulated as a nonlinear non convex and large scale programming problem. This model consists of minimizing the costs of the reactive continuous and/or discrete sources that must be allocated on the system. The constraints considered on the model must assure the quality and reliability of supplying energy to the users maintaining the voltage magnitudes within the predefined limits, attending the active and reactive power demand and a set of physical and operational constraints of the installed equipment such as: generator capacity limits, synchronous and static compensators and the tap of the transformers. The emphasis of this work is that the proposed algorithm solves the integer nonlinear problems directly. A nonlinear programming problem is solved in each node of the Branch and Bound tree which is the optimal reactive power dispatch where the constraints that adjust the capacitors and inductors banks are relaxed. These problems are solved using the interior point method (IPM) primaldual predictor corrector, which in general improves the performance of the IPM. The nonlinear Branch and Bound algorithm proposed has efficient techniques to choose the next sub problem that must be solved as well as the separation variable of the sub problems and the sounding tests. To minimize the local minima problem, that are found solving the nonlinear programming problem, the sounding test were redefined adding a predefined percent to the current incumbent, obtaining an additional security margin, where in nonlinear problems not always the objective function value to a posterior problem is greater than the predecessor. Results are presented for test systems as IEEE30, IEEE118 and IEEE300. By simulations... (Complete abstract click electronic access below)
A nonlinear Branch and Bound algorithm to solve the problem of reactive optimal dispatch and planning of electrical power systems is proposed in this work. The planning model is formulated as a nonlinear non convex and large scale programming problem. This model consists of minimizing the costs of the reactive continuous and/or discrete sources that must be allocated on the system. The constraints considered on the model must assure the quality and reliability of supplying energy to the users maintaining the voltage magnitudes within the predefined limits, attending the active and reactive power demand and a set of physical and operational constraints of the installed equipment such as: generator capacity limits, synchronous and static compensators and the tap of the transformers. The emphasis of this work is that the proposed algorithm solves the integer nonlinear problems directly. A nonlinear programming problem is solved in each node of the Branch and Bound tree which is the optimal reactive power dispatch where the constraints that adjust the capacitors and inductors banks are relaxed. These problems are solved using the interior point method (IPM) primaldual predictor corrector, which in general improves the performance of the IPM. The nonlinear Branch and Bound algorithm proposed has efficient techniques to choose the next sub problem that must be solved as well as the separation variable of the sub problems and the sounding tests. To minimize the local minima problem, that are found solving the nonlinear programming problem, the sounding test were redefined adding a predefined percent to the current incumbent, obtaining an additional security margin, where in nonlinear problems not always the objective function value to a posterior problem is greater than the predecessor. Results are presented for test systems as IEEE30, IEEE118 and IEEE300. By simulations... (Complete abstract click electronic access below)
Descrição
Palavras-chave
Sistemas de energia eletrica - Planejamento, Energia eletrica - Transmissão, Energia elétrica - Geração, Fluxo de potência ótimo, Otimização clássica, Electricity - Transmission
Como citar
ESTEVAM, Celia Regina Nugoli. Planejamento de reativos em sistemas de energia elétrica através de um algoritmo de Branch-and-Bound não linear. 2008. 145 f. Tese (doutorado) - Universidade Estadual Paulista, Faculdade de Engenharia de Ilha Solteira, 2008.