2008
DOI: 10.1108/03321640810890852
|View full text |Cite
|
Sign up to set email alerts
|

New reactive power sources dispatch applied to the IEEE 57 nodes

Abstract: This paper deals with a new dispatching and optimisation of reactive power sources in power systems. The methodology is first based on an optimal movement of existing reactive sources as a first phase, then an optimal investment in a second phase and finally a combination of the two previous phases as the third one [1]. The methodology showed also the advantage of a two levels procedure, considering an initial minimal compensation before minimizing the active losses. The solution of the global non-linear probl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
5
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…Minimizing power losses while satisfying a series of constraints is the primary objective of traditional optimal VAR dispatch (VARD) problem (Yan et al, 2006;Belazzoug et al, 2008). In the practical application, only considering single objective to minimize power losses seems to be insufficient in order to fully improve the performance of power systems.…”
Section: Introductionmentioning
confidence: 99%
“…Minimizing power losses while satisfying a series of constraints is the primary objective of traditional optimal VAR dispatch (VARD) problem (Yan et al, 2006;Belazzoug et al, 2008). In the practical application, only considering single objective to minimize power losses seems to be insufficient in order to fully improve the performance of power systems.…”
Section: Introductionmentioning
confidence: 99%
“…Many conventional optimization algorithms have been applied to solve the problem of reactive power planning. Among these methods: linear and successive linear programming , projected and augmented Lagrange method , quadratic and sequential quadratic programming , and others. Unfortunately, these methods suffer from algorithmic complexity, poor computational time, sensitivity to initial search point, and do not guarantee the convergence to the global optimum point.…”
Section: Introductionmentioning
confidence: 99%
“…In [13] mathematical modeling of FACTS has been discussed. Srinivas and Deb introduced NSGA [14]. NSGA has shown its limitation for complexity in computational, lack of elitism and for choosing the optimal parameter value for sharing parameter.…”
Section: Introductionmentioning
confidence: 99%