an investigation of reactive power planning based on chance constrained programming

Download An investigation of reactive power planning based on chance constrained programming

Post on 21-Jun-2016




3 download

Embed Size (px)


  • ivin



    g, Z


    Deregulation in the electricity supply industry has brought many new challenges to the problem of reactive power planning. Although

    Reactive power planning is well recognized to be one of

    programming [5], and methods of decomposition [6].As the electricity supply industry all over the world is

    moving towards general deregulation, the philosophy of

    competition, coordination between market participants,

    centrally coordinated planning of new generation or of theclosure of existing plants. The locations, capacities, andcommissioning time of new power plants, as well as the clo-sure of old generators or power plants are basically at thediscretion of the power generation companies, who usuallyonly need to give short notice to the market operation

    * Corresponding author. Tel.: +852 2766 6184; fax: +852 2330 1544.E-mail address: (C.W. Yu).

    Electrical Power and Energy Systethe most complex problems for power systems engineers, asit requires the simultaneous minimization of two objectivefunctions [1]. The rst objective deals with the minimiza-tion of operating costs by reducing the loss of real powerand improving the voltage prole. The second objectiveminimizes the cost of investing in additional sources ofreactive power. Reactive power planning is a nonlinearoptimization problem for large-scale systems with manyuncertainties. The problem has been approached in manydierent ways such as through the use of linear [2], nonlin-ear [3], or mixed integer programming [4], evolutionary

    and security requirements can be identied. In a verticallyintegrated utility, reactive power facilities are owned andoperated by a single utility. The costs and contribution ofa reactive power supply are not precisely evaluated. Undera deregulated environment, the obligations and rights ofthe owners of reactive power facilities become essentialissues that aect not only the investment returns of thepower industry but also the security of the power system.The situation is even more complicated when several self-supported systems are interconnected [7].

    In a deregulated electricity market, there is generally nothe problem has been extensively studied, available standard optimization models and methods do not oer good solutions to this prob-lem, especially in a competitive electricity market environment where many factors are uncertain. Given this background, a novel methodfor reactive power planning based on chance constrained programming is presented in this paper, with uncertain factors taken intoaccount. A stochastic optimization model is rst formulated under the presumption that the generator outputs and load demandscan be modeled as specied probability distributions. A method is then presented for solving the optimization problem using the MonteCarlo simulation method and genetic algorithm. Finally, a case study is used to illustrate the validity and essential features of the pro-posed model and methodology. 2007 Elsevier Ltd. All rights reserved.

    Keywords: Reactive power planning; Uncertainties; Chance constrained programming; Monte Carlo simulation; Genetic algorithm

    1. Introduction reactive power management and power system operationis expected to change greatly, so that the signicance ofAn investigation of reacton chance constra

    Ning Yang a,b, C.W. Yu a,*,a Department of Electrical Engineering, The

    b Department of Electrical Engineerin

    Received 23 March 2005; received in revised

    Abstract0142-0615/$ - see front matter 2007 Elsevier Ltd. All rights reserved.doi:10.1016/j.ijepes.2006.09.008e power planning baseded programming

    shuan Wen b, C.Y. Chung a

    g Kong Polytechnic University, Hong Kong

    hejiang University, Hangzhou, China

    4 August 2006; accepted 5 September 2006

    ms 29 (2007) 650656

  • d Emanagement. These are all uncertainties in reactive powerplanning and are very dicult to manage. Moreover, thereare many other uncertainties such as those of future loadchanging, of cooperation and competition in the electricitymarket in the future, and uncertainties resulting from eco-nomic development, the environment, or policy regulation.All of these can bring new challenges to reactive powerplanners.

    Given this background, a novel method for optimalreactive power planning based on chance constrained pro-gramming is presented in this paper. Chance constrainedprogramming (CCP) [8,9], which has gained increasinginterest in various eld as well as in power systems, is akind of stochastic programming and is especially suitablefor solving optimal problems with uncertain factors. Xiaoet al. [10], recognizing the uncertainties of power systemsand taking the advantage of CCP, formulated an eectivestochastic model to evaluate available transfer capabilityof prescribed interfaces in interconnected power networks,in which the availability of generators and circuits as wellas load forecast errors are considered as random variables.In Ref. [11], a chance constrained programming formula-tion was developed for scheduling units of a power gener-ating system by taking into consideration thestochasticity of the hourly load and its correlation struc-ture. The deterministic form of the stochastic constraintwas used in solving the unit commitment problemiteratively.

    CCP can be used in reactive power planning under acompetitive electricity market environment. Consideringthe randomness of generator outputs and load changing,without loss of generality, the following presumptions aremade: the daily operating time is classied into three timeperiods (peak, shoulder, and o-peak periods); and thegenerator outputs and the future load demands have spe-cic probability distributions such as normal probabilitydistributions. It should be noted that the method proposedbelow is also good for other probability distributions. Inthis paper the reactive power planning time is one yearand the optimal objective is to minimize the operationand investment cost of the candidate compensationdevices. With advancements in technology and improve-ments in management as well as the deepening of therestructuring of the electricity industry, engineers havethe capability and need to intervene and regulate powerow patterns to some extent. This will pose higher require-ments for exibility in reactive power planning. Therefore,the optimal result will be on the conservative side if theconstraints are handled by deterministic methods. CCP isa good means of solving this kind of problem. In the elec-tricity market environment more exibility and robustnessare required for reactive power planning and CCP couldwell meet such requirements by imposing appropriate con-dence levels.

    After building the CCP-based reactive power planning

    N. Yang et al. / Electrical Power anmodel, an approach based on Monte Carlo simulationand a genetic algorithm is developed to solve the problem.The paper is organized as follows: A brief introduction tochance constrained programming and stochastic simula-tion is given in Section 2. A chance constrained program-ming model is formulated in Section 3 under thepresumption that the generator outputs and the future loaddemand can be modeled as specied probability distribu-tions. The formulation of an approach based on MonteCarlo simulation and a genetic algorithm to solve the prob-lem of optimization is outlined in Section 4. In Section 5, acase study is used to illustrate the validity and essential fea-tures of the proposed method. Finally, conclusions aregiven in Section 6.

    2. Brief introduction of chance constrained programming

    Chance constrained programming is a kind of stochasticprogramming in which the constraints or objective functionof an optimization problem contain stochastic parameters.The programming attempts to reconcile optimization overuncertain constraints. The constraints, which contain sto-chastic parameters, are guaranteed to be satised with acertain probability at the optimum solution point [8,9].

    A typical chance constrained programming problem hasthe following form:

    min f


    P r ff x; n 6 f gP bP r fgjx; n 6 0; j 1; 2; . . . ; kgP a



    where x 2 Rn is a decision variable vector; n is a stochasticvector with a given joint probability density function U(n);f(x,n) is the objective function; gj(x,n) (j = 1,2, . . .,k) arethe constraint functions; Pr{} denotes the probability ofthe event {}; and a and b are the specied condence levelsof the constraint functions and the objective function,respectively.

    The traditional technique to solve the chance con-strained programming is to convert the stochastic con-straints to their respective deterministic equivalentsaccording to the predetermined condence level. Unfortu-nately, this approach is not successful for some compli-cated cases. In this paper, Monte Carlo simulation [12,13]provides a general approach to solving this problem.

    For any given decision vector x, the procedure of usingMonte Carlo simulation to check the constraint

    P rfgjx; n 6 0; j 1; 2; . . . ; kgP a 2is shown as follows.

    First, we generate N independent random vectors n1,n2, . . . ,nN from a given joint probability distributionU(n). Let N 0 be the number of occasions in which theinequality

    gjx; ni 6 0 i 1; 2; . . . ;N 3

    nergy Systems 29 (2007) 650656 651is satised, i.e., the number of random vectors satisfyingthe constraints. Mathematically, Pr{gj(x,n) 6 0} can be

  • d Eestimated by N 0/N if N is large enough. This means that thechance constraint in Eq. (2) holds if and only if N 0/NP a.

    Similarly, for a given vector x, we can use the MonteCarlo technique to compute the maximum value f , satisfy-ing the objective function in Eq. (1).

    P rff x; n 6 f gP b 4F


View more >