Real power loss minimization using interior point method

Rezania, Eiraj; Shahidehpour, Mohammad

doi:10.1016/s0142-0615(00)00028-4

Cited by 25 publications

(14 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the first stage, many traditional numerical methods called deterministic methods such as gradient search (GS) [3], Newton method (NM) [4], interior point method (IPM) [5][6][7], linear program (LP) [8][9][10], dynamic programming method (DPM) [11], quadratic programming method (QPM) [12,13], and Lagrangian method (LM) [14] have found optimal solutions with acceptable quality, but these methods have met many disadvantages such as highly time consuming manner, high number of iterations, huge number of computation processes, incapability of handling nondifferentiable constraints and objective functions, and easily falling into local optimum solution zone. In this regard, the ones should be retired to make room for new algorithms that have better search ability.…”

Section: Complexitymentioning

confidence: 99%

Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm

Nguyen

Tran

et al. 2019

Complexity

View full text Add to dashboard Cite

This paper applies a proposed modified stochastic fractal search algorithm (MSFS) for dealing with all constraints of optimal reactive power dispatch (ORPD) and finding optimal solutions for three different cases including power loss optimization, voltage deviation optimization, and L-index optimization. The proposed MSFS method is newly constructed in the paper by modifying three new solution update mechanisms on standard stochastic fractal search algorithm (SSFS). The first modification is to keep only one formula and abandon one formula in the diffusion process while the second modification and the third modification are used in the first update and the second update. In two updates of SSFS, solutions with low quality are updated with high probability while other solutions with high quality do not get chances to be updated. This manner results in the fact that some promising solutions around the high quality solutions can be missed. In order to tackle this restriction, the second modification of MSFS is to newly update the worst solutions in the first update and the best solutions in the second update. In the third modification, all existing formulas of SSFS in the two updates are abandoned and the same new proposed technique is used for updating such solutions in two updates. Compared to SSFS, the three modifications can bring advantages to MSFS such as using smaller number of produced solutions per iteration, spending shorter execution time, finding better optimal solutions, and owning more stable search ability. Furthermore, the proposed method also sees its effectiveness and robustness over SSFS by testing on IEEE 30-bus system and IEEE 118-bus system with three different single objectives for each system. The proposed method can find less minimum, average, and maximum for all the cases in addition to faster search speed. Besides, the proposed method is also compared to other methods such as PSO-based method group, GA-based method group, DE-based method group, and other recent methods. Result comparisons also indicate that the proposed method can be more efficient than almost all these methods with respect to less minimum and smaller values of control parameters. As a result, evaluation of the performance of the proposed method is that it should be used for seeking solutions of ORPD problem.

show abstract

Section: Complexitymentioning

confidence: 99%

Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm

Nguyen

Tran

et al. 2019

Complexity

View full text Add to dashboard Cite

show abstract

“…Towards this direction, relevant examples are already in literature and many different approaches have been examined. In [10] and [11] interior point method (IPM) algorithm is proposed for the formulation of OPF problem. IPM is based on the conversion of inequalities into equalities by introducing in the objective function a logarithmic barrier that is a function of the slack variables [12].…”

Section: Problem Formulationmentioning

confidence: 99%

“…In Fig. 3 [16] a comprehensive branch model is presented and the general equations in a matrix form are shown in (11). If no phase shift exists, t* = t.…”

Section: B Problem Formulation Considering Tap-changing Functionmentioning

confidence: 99%

Post-primary voltage control using optimal power flow for loss minimization within web-of-cells concept

Degefa

D’Arco

Morch

et al. 2017

2017 52nd International Universities Power Engineering Conference (UPEC)

View full text Add to dashboard Cite

show abstract

“…In the last decades of the 20th century, the ORPF problem has been successfully addressed by many conventional methodologies called deterministic methodologies such as the Newton method [3], linear programming [4][5][6][7], interior point method [8,9], quadratic programming method [10,11], and dynamic programming method [12]. With appearance of the mentioned methods, they proved their strong points in dealing with the ORPF problem having linear constraints and differentiable functions for application, but a large system or more complicated constraints and their applicability must be stopped to make rooms for new methods which have a promising ability.…”

Section: Introductionmentioning

confidence: 99%

Optimal Reactive Power Flow for Large-Scale Power Systems Using an Effective Metaheuristic Algorithm

Duong

Phan

et al. 2020

Journal of Electrical and Computer Engineering

View full text Add to dashboard Cite

In this paper, stochastic fractal search method (SFS) is employed for solving the optimal reactive power flow (ORPF) problem with a target of optimizing total active power losses (TPL), voltage deviation (VD), and voltage stability index (VSI). SFS is an effective metaheuristic algorithm consisting of diffusion process and two update processes. ORPF is a complex problem giving challenges to applied algorithms by taking into account many complex constraints such as operating voltage from generators and loads, active and reactive power generation of generators, limit of capacitors, apparent power limit from branches, and tap setting of transformers. For verifying the performance, solutions of IEEE 30 and 118-bus system with TPL, VD, and VSI objectives are found by the SFS method with different control parameter settings. Result comparisons indicate that SFS is more favorable than other methods about finding effective solutions and having faster speed. As a result, it is suggested that SFS should be used for ORPF problem, and modifications performed on SFS are encouraged for better results.

show abstract

Real power loss minimization using interior point method

Cited by 25 publications

References 16 publications

Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm

Optimal Dispatch of Reactive Power Using Modified Stochastic Fractal Search Algorithm

Post-primary voltage control using optimal power flow for loss minimization within web-of-cells concept

Optimal Reactive Power Flow for Large-Scale Power Systems Using an Effective Metaheuristic Algorithm

Contact Info

Product

Resources

About