A computer package for optimal multi-objective VAr planning in large scale power systems
This paper presents a simulated annealing based computer package for multi-objective, VAr planning in large scale power systems-SAMVAR. This computer package has three distinct features. First, the optimal VAr planning is reformulated as a constrained, multi-objective, nondifferentiable optimization...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on power systems 1994-05, Vol.9 (2), p.668-676 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper presents a simulated annealing based computer package for multi-objective, VAr planning in large scale power systems-SAMVAR. This computer package has three distinct features. First, the optimal VAr planning is reformulated as a constrained, multi-objective, nondifferentiable optimization problem. The new formulation considers four different objective functions related to system investment, system operational efficiency, system security and system service quality. The new formulation also takes into consideration load, operation and contingency constraints. Second, it allows both the objective functions and equality and inequality constraints to be nondifferentiable; making the problem formulation more realistic. Third, the package employs a two-stage solution algorithm based on an extended simulated annealing technique and the E-constraint method. The first-stage of the solution algorithm uses an extended simulated annealing technique to find a global, noninferior solution. The results obtained from the first-stage provide a basis for planners to prioritize the objective functions such that a primary objective function is chosen and tradeoff tolerances for the other objective functions are set. The primary objective function and the trade-off tolerances are then used to transform the constrained multi-objective optimization problem into a single-objective optimization problem with more constraints by employing the E-constraint method. The second-stage uses the simulated annealing technique to find the global optimal solution.< > |
---|---|
ISSN: | 0885-8950 1558-0679 |
DOI: | 10.1109/59.317676 |