Bound Tightening for the Alternating Current Optimal Power Flow Problem

2016 ◽  
Vol 31 (5) ◽  
pp. 3729-3736 ◽  
Author(s):  
Chen Chen ◽  
Alper Atamturk ◽  
Shmuel S. Oren
2014 ◽  
Vol 494-495 ◽  
pp. 1627-1630
Author(s):  
Xiao Ying Zhang ◽  
Ning Ding ◽  
Chen Li

This paper introduces an homotopy algorithm which has convergence stability to solve the alternating current optimal power flow problem. The complicated Alternating Current Power Flow (ACPF) can simplify as simple Direct Current Power Flow (DCPF). The homotopy participation factor is introduced into the linear DCPF to make DCPF convert back into ACPF gradually to realize Alternating Current Power Flow Homotopy method (ACPFH). The homotopy curves are generated to solve a series of nonlinear problems.The traditional method can not solve the unstable points,because the calculate process always turn up Jacobian matrix.But the Homotopy method can calculate all results. It is a superiority for Homotopy,and then can explore power system problem more entirety.This novel algorithm is different from Newton - Raphson method, because it isnt sensitive to the initial point selection and has the global convergence.The homotopy algorithm is applied to IEEE - 3, 9, 14, 30, 36, 57, 118 node testing systems for power flow optional calculation, the simulation results show that the novel algorithm can solve power flow problem better and its calculating speed is much faster than the traditional algorithm, it can calculate the optimal value more direct.


4OR ◽  
2020 ◽  
Vol 18 (3) ◽  
pp. 249-292
Author(s):  
Dan Bienstock ◽  
Mauro Escobar ◽  
Claudio Gentile ◽  
Leo Liberti

2021 ◽  
Vol 13 (16) ◽  
pp. 8703
Author(s):  
Andrés Alfonso Rosales-Muñoz ◽  
Luis Fernando Grisales-Noreña ◽  
Jhon Montano ◽  
Oscar Danilo Montoya ◽  
Alberto-Jesus Perea-Moreno

This paper addresses the optimal power flow problem in direct current (DC) networks employing a master–slave solution methodology that combines an optimization algorithm based on the multiverse theory (master stage) and the numerical method of successive approximation (slave stage). The master stage proposes power levels to be injected by each distributed generator in the DC network, and the slave stage evaluates the impact of each power configuration (proposed by the master stage) on the objective function and the set of constraints that compose the problem. In this study, the objective function is the reduction of electrical power losses associated with energy transmission. In addition, the constraints are the global power balance, nodal voltage limits, current limits, and a maximum level of penetration of distributed generators. In order to validate the robustness and repeatability of the solution, this study used four other optimization methods that have been reported in the specialized literature to solve the problem addressed here: ant lion optimization, particle swarm optimization, continuous genetic algorithm, and black hole optimization algorithm. All of them employed the method based on successive approximation to solve the load flow problem (slave stage). The 21- and 69-node test systems were used for this purpose, enabling the distributed generators to inject 20%, 40%, and 60% of the power provided by the slack node in a scenario without distributed generation. The results revealed that the multiverse optimizer offers the best solution quality and repeatability in networks of different sizes with several penetration levels of distributed power generation.


Sign in / Sign up

Export Citation Format

Share Document