An implementation of an interior point method to the optimal reactive dispatch problem is described. The interior point method used is based on the primal-dual algorithm and the numerical results in large scale networks (1832 and 3467 bus systems) have shown that this technique can be very effective to some optimal power flow applications. >

Optimal reactive dispatch through interior point methods

Reactive power dispatch (RPD) is an optimization problem that reduces grid congestion by minimizing the active power losses for a fixed economic power dispatch. RPD reduces power system losses by adjusting the reactive power control variables such as generator voltages, transformer tap-settings and other sources of reactive power such as capacitor banks and provides better system voltage control, resulting in an improved voltage profile, system security, power transfer capability and over all system operation. In this paper, RPD problem is solved using particle swarm optimization (PSO). To overcome the drawback of premature convergence in PSO, a learning strategy is introduced in PSO, and this approach called, comprehensive learning particle swarm optimization (CLPSO) is also applied to this problem and a comparison of results is made between these two. Three different test cases have been studied such as minimization of real power losses, improvement of voltage profile and enhancement of voltage stability through a standard IEEE 30-bus and 118-bus test systems and their results have been reported. The study results show that the approaches developed are feasible and efficient.

Comprehensive learning particle swarm optimization for reactive power dispatch

The key of reactive power planning (RPP), or Var planning, is the optimal allocation of reactive power sources considering location and size. Traditionally, the locations for placing new Var sources were either simply estimated or directly assumed. Recent research works have presented some rigorous optimization-based methods in RPP. This paper will first review various objectives of RPP. The objectives may consider many cost functions such as variable Var cost, fixed Var cost, real power losses, and fuel cost. Also considered may be the deviation of a given voltage schedule, voltage stability margin, or even a combination of different objectives as a multi-objective model. Secondly, different constraints in RPP are discussed. These different constraints are the key of various optimization models, identified as optimal power flow (OPF) model, security-constrained OPF (SCOPF) model, and SCOPF with voltage-stability consideration. Thirdly, the optimization-based models will be categorized as conventional algorithms, intelligent searches, and fuzzy set applications. The conventional algorithms include linear programming, nonlinear programming, mixed-integer nonlinear programming, etc. The intelligent searches include simulated annealing, evolutionary algorithms, and tabu search. The fuzzy set applications in RPP address the uncertainties in objectives and constraints. Finally, this paper will conclude the discussion with a summary matrix for different objectives, models, and algorithms.

/pdf/review-of-reactive-power-planning-objectives-constraints-and-2wqt7d9o7e.pdf

Review of Reactive Power Planning: Objectives, Constraints, and Algorithms

A procedure for solving the power capacitor placement problem is presented. The objective is to determine the minimum investment required to satisfy suitable reactive constraints. Due to the discrete nature of reactive compensation devices, optimal capacitor placement leads to a nonlinear programming problem with mixed (discrete and continuous) variables. It is solved with an iterative algorithm based on successive linearizations of the original nonlinear model. The mixed integer linear programming problem to be solved at each iteration of the procedure is tackled by applying both a deterministic method (branch and bound) and genetic algorithm techniques. A hybrid procedure, aiming to exploit the best features of both algorithms is also considered. The proposed procedures are tested and compared with reference to a small CIGRE system and two actual networks derived from the Italian transmission and distribution system.

Optimal capacitor placement using deterministic and genetic algorithms

The authors propose an algorithm for solving reactive power planning problems. The optimization approach is based on a recursive mixed-integer programming technique using an approximation method. A fundamental feature of this algorithm is that the number of capacitor or reactor units can be treated as a discrete variable in solving large-scale VAr (volt-ampere reactive) planning problems. Numerical results have verified the validity and efficiency of the algorithm. >

Optimal VAr planning by approximation method for recursive mixed-integer linear programming

An integrated methodology for VAr sources expansion planning is described. The methodology extends and generalizes a previously proposed two-level hierarchical approach to represent multiple load levels and multiple contingencies, calculate the trade-off between investment cost and supply reliability, and select the most adequate set of candidate nodes for expansion. Case studies with the IEEE-118 bus system are used to illustrate the capabilities of the approach. >

M.V.P. Pereira

Papers

An integrated methodology for VAr sources planning