# Opposition-Based Improved PSO for Optimal Reactive Power Dispatch and Voltage Control

Authors: Shengrang Cao; Xiaoqun Ding; Qingyan Wang; Bingyan Chen
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

An opposition-based improved particle swarm optimization algorithm (OIPSO) is presented for solving multiobjective reactive power optimization problem. OIPSO uses the opposition learning to improve search efficiency, adopts inertia weight factors to balance global and local exploration, and takes crossover and mutation and neighborhood model strategy to enhance population diversity. Then, a new multiobjective model is built, which includes system network loss, voltage dissatisfaction, and switching operation. Based on the market cost prices, objective functions are converted to least-cost model. In modeling process, switching operation cost is described according to the life cycle cost of transformer, and voltage dissatisfaction penalty is developed considering different voltage quality requirements of customers. The experiment is done on the new mathematical model. Through the simulation of IEEE 30-, 118-bus power systems, the results prove that OIPSO is more efficient to solve reactive power optimization problems and the model is more accurate to reflect the real power system operation.


---

## Body

## 1. Introduction

Particle swarm optimization (PSO) proposed by Dr. Eberhart and Dr. Kennedy in 1995 is a population-based evolutionary algorithm that emulates the social behavior of bird flocks in an attempt to optimally explore some given problem space. In the past decade, PSO has been studied and applied in many research and application areas. However, many experiments have shown that PSO converges too fast and easily falls into local optima especially when solving complex multimodal problems [1]. Many researchers have put forward improved programs. In general, there are three kinds of improved methods, that is, parameter factor [2, 3], neighborhood topology [4], and hybridization with other algorithms [5, 6]. Each of them has its own advantages but also has defects. The hybridization of PSO with other algorithms has been proved to be a promising technique. There are two ways to combine. One is with evolutionary algorithms, for instance, [5] is PSO combined with genetic algorithm, in which genetic algorithm was used to increase exploration ability of particles, [6] is the combination hybridized PSO with ant algorithm, and uses the characteristic of positive feedback to enhance the search ability of particles. The other is with nonevolutionary algorithms, such as hybridizing PSO with Filter [7], Cauchy mutation [8], and opposition-based learning [9], in which opposition-based learning has a good character; it can accelerate the convergence speed of the algorithm, and this concept was first proposed by Dr. Tizhoosh. When we seek the solution in a direction, it is beneficial to consider the opposite direction [10]. By comparison of fitness values of the two directions, the optimal candidate solution is chosen from them. For this reason, many algorithms were enhanced by opposition-based learning [11, 12].In this paper, a new improved particle swarm optimization algorithm OIPSO is proposed, which makes some expansion and correction by inertia weight factors, crossover and mutation, neighborhood model, and opposition-based learning. Through these strategies, the new OIPSO algorithm can enhance population diversity and avoid premature convergence and stagnation.The improved algorithm would be developed to multiobjective reactive power optimization. It is known that the purpose of power system reactive optimization is to find the best compensation methods to make the power system safe and economic under the demand of reactive load power system [13]. For that, we establish a mathematical model, including system network loss, voltage dissatisfaction, and switching operator. In the modeling process, introduce life cycle cost of the transformer, define switching operator cost, and also give descriptions of the customers’ loss, voltage quality requirement, and dissatisfaction degree and then reactive power optimization tests through IEEE 30- and 118-bus systems.The remaining of this paper is organized as follows: Section2 provides an overview of PSO algorithm, opposition-based learning, and other improvement strategies. In Section 3, the multiobjective model of reactive power system is established. Combined with reactive power optimization, main steps of the improved OIPSO algorithm are given in Section 4. Then, the algorithm is applied to IEEE 30- and 118-bus systems in Section 5. Finally, Section 6 concludes the paper with a summary.


## 2. PSO Algorithm and Its Improvement

The essence of PSO algorithm is that by letting the information about good solutions spread out through the swarm, the particles would tend to move to good areas [14, 15]. At each iteration time t, particle i is moved to a new position by adding a velocity term to its current position according to formulas (1) and (2) as follows:(1)Xit+1=Xit+Vit+1,(2)Vit+1=ωVit+c1rand1Pbest,i-Xit+c2rand2Gbest-Xit,where i=1,2,…,pop, pop is the size of swarm particles, Pbest,i is the best position of particle i, Gbest is the global best position, ω is called inertia weight, and c1 and c2 are acceleration factors.PSO algorithm converges fast, but it is also easy to fall into the local optimal. The reason is that, in the optimal process, all particles consider the global best positionGbest as the goal and search directions run towards it. This situation worsens in the later process and leads to reduction of the ability to explore unknown area. Therefore, it is very important to enhance the diversity of particles. This paper makes some expansion and modification to the basic particle swarm algorithm. The main improvement measures are as follows.


### 2.1. Opposition-Based Learning

In PSO algorithm, starting points are given randomly. If the starting points are close to the optimal point, convergence speed would be faster. The opposite operation used in the selection of the starting points has proven that utilizing opposition in learning yields more efficient algorithms than using only pure randomness [10, 16]. Besides the opposition point used in the initial population, this paper would intersectionally use the opposition point and the following crossover and mutation to increase the diversity of particles. The definition of opposition is given as follows.Definition 1 (opposite point).
LetX=(x1,x2,…,xn) be a point in n-dimensional space and let xi∈[ai,bi] be a real number, where i=1,2,…,n. The opposite point X′=(x1′,x2′,…,xn′) is defined by its components xi′=ai+bi-xi.


### 2.2. Inertia Weight Factor

Generally, for initial stage of search process, large inertia weight can enhance the global exploration and, for last stage, the small inertia weight is good for local exploration, so time-varying inertia weight, which typically decreases linearly from about 0.9 to 0.4 [17], can balance the global and local search; specific measures are as follows:(3)ω=ωmax⁡-ttmax⁡ωmax⁡-ωmin⁡,where ωmax⁡ and ωmin⁡ are the maximum and minimum of ω, tmax⁡ is the maximum iterating times, and t is the current iteration.


### 2.3. Neighborhood Exchange

In particle swarm algorithm, each particle generally learns from its own best position and global best position. In social cognitive system, an individual, besides its own experience and excellent information obtained from the whole society, should exchange with other better individuals to improve itself [13, 18]. Based on this idea, PSO algorithm is modified as follows:(4)Vit+1=ωVit+c1rand1Pbest,i-Xit+c2rand2Gbest-Xit+c3rand3Pbest,n-Xit,where Pbest,n is position vector of the better individual in domain and c3 is an accelerating constant. Larger c3 can increase the ability of the individual to explore unknown better area, especially in the later process. In contrast, the set value of c2 is related to convergence rate; based on their own characteristics, parameters c2, c3 are improved as follows:(5)c3=c3min⁡+ttmax⁡c3max⁡-c3min⁡,c2=c2max⁡-ttmax⁡c2max⁡-c2min⁡,where c2max⁡ and c2min⁡ are the maximum and minimum of c2 and c3max⁡ and c3min⁡ are the maximum and minimum of c3.


### 2.4. Crossover and Mutation

Crossover and mutation operators are key technologies in genetic algorithm, which are used to enhance the diversity of the species. The particles of PSO algorithm can be crossed and varied [13, 18]. For particle i, the crossover operation is described as follows:(6)Vit+1=Vit+VntVit+VntVit,Xit+1=rXit+1-rXnt,where r is a random variable in the range [0,1].The method of mutation operator is(7)Vit+1=Vit+Vit+1Vit+Vit+1Vit,Xit+1=γXit+1-rXimax⁡-Ximin⁡,where γ is a random coefficient in the range [0,1]. Ximax⁡, Ximin⁡ are the maximum and minimum of Xi. A variable parameter Pm selected from [0,1] determines the mutation operator.


## 2.1. Opposition-Based Learning

In PSO algorithm, starting points are given randomly. If the starting points are close to the optimal point, convergence speed would be faster. The opposite operation used in the selection of the starting points has proven that utilizing opposition in learning yields more efficient algorithms than using only pure randomness [10, 16]. Besides the opposition point used in the initial population, this paper would intersectionally use the opposition point and the following crossover and mutation to increase the diversity of particles. The definition of opposition is given as follows.Definition 1 (opposite point).
LetX=(x1,x2,…,xn) be a point in n-dimensional space and let xi∈[ai,bi] be a real number, where i=1,2,…,n. The opposite point X′=(x1′,x2′,…,xn′) is defined by its components xi′=ai+bi-xi.


## 2.2. Inertia Weight Factor

Generally, for initial stage of search process, large inertia weight can enhance the global exploration and, for last stage, the small inertia weight is good for local exploration, so time-varying inertia weight, which typically decreases linearly from about 0.9 to 0.4 [17], can balance the global and local search; specific measures are as follows:(3)ω=ωmax⁡-ttmax⁡ωmax⁡-ωmin⁡,where ωmax⁡ and ωmin⁡ are the maximum and minimum of ω, tmax⁡ is the maximum iterating times, and t is the current iteration.


## 2.3. Neighborhood Exchange

In particle swarm algorithm, each particle generally learns from its own best position and global best position. In social cognitive system, an individual, besides its own experience and excellent information obtained from the whole society, should exchange with other better individuals to improve itself [13, 18]. Based on this idea, PSO algorithm is modified as follows:(4)Vit+1=ωVit+c1rand1Pbest,i-Xit+c2rand2Gbest-Xit+c3rand3Pbest,n-Xit,where Pbest,n is position vector of the better individual in domain and c3 is an accelerating constant. Larger c3 can increase the ability of the individual to explore unknown better area, especially in the later process. In contrast, the set value of c2 is related to convergence rate; based on their own characteristics, parameters c2, c3 are improved as follows:(5)c3=c3min⁡+ttmax⁡c3max⁡-c3min⁡,c2=c2max⁡-ttmax⁡c2max⁡-c2min⁡,where c2max⁡ and c2min⁡ are the maximum and minimum of c2 and c3max⁡ and c3min⁡ are the maximum and minimum of c3.


## 2.4. Crossover and Mutation

Crossover and mutation operators are key technologies in genetic algorithm, which are used to enhance the diversity of the species. The particles of PSO algorithm can be crossed and varied [13, 18]. For particle i, the crossover operation is described as follows:(6)Vit+1=Vit+VntVit+VntVit,Xit+1=rXit+1-rXnt,where r is a random variable in the range [0,1].The method of mutation operator is(7)Vit+1=Vit+Vit+1Vit+Vit+1Vit,Xit+1=γXit+1-rXimax⁡-Ximin⁡,where γ is a random coefficient in the range [0,1]. Ximax⁡, Ximin⁡ are the maximum and minimum of Xi. A variable parameter Pm selected from [0,1] determines the mutation operator.


## 3. Mathematical Model of Power System Reactive Power Optimization

Objective function of reactive power optimization model is commonly the minimization of active power loss and ignores many security and economic factors. On security grounds, its optimal results often approach the upper limits of voltage level on load buses. Although the results satisfy equality and inequality constraints, it is not conducive to the safe operation of power system. In this paper, we introduce voltage dissatisfaction and use penalty to punish voltage dissatisfaction. And, in economic terms, transformer tap has mechanical life and the total number of switching times has a limit. Therefore, the switching operation cost should not be neglected. In this section, we present transformer operation cost by life cycle cost and use it as an objective function.


### 3.1. Active Power Loss

Reactive power is usually used as the objective function. Utilize the following equal to convert power loss into expense:(8)CPloss=λ1×Ploss=λ1×∑i∈Nj∈NiGijVi2+Vj2-2ViVjcos⁡θij,where λ1 is the unit price for system network loss and its value depends on market electricity prices, Ploss is system network loss, N is set of branches numbers, and Ni is the collection of nodes number associated with the node i (including i itself).


### 3.2. Voltage Dissatisfaction

The cost of voltage dissatisfaction describes the users’ losses caused by overlimit voltages on the load buses. When the voltage amplitudes are far from the ideal range, the losses would become more heavy. Voltage dissatisfaction can be expressed by the following mathematical description [19]:(9)CVVIO=λ2×SV=λ2×∑i=1NloadSVi,SVi=ai×PDi×Vimin⁡-ViθVi<Vimin⁡0Vimin⁡<Vi<Vimax⁡bi×PDi×Vi-Vimax⁡Vimax⁡<Vi,where λ2 is the penalty for voltage dissatisfaction; SV is the sum of nodal voltage dissatisfaction degree; PDi is the active power load of node i; ai, bi are the voltage dissatisfaction degree when the voltage values overstep the lower or upper limit, which are declared by the relevant users; θ is the index parameter about the relationship of the losses and voltage deviation; we set θ=1 in this paper. In general, voltage range is [0.94,1.06], but some power consumption equipment needs high security and stability. It is obvious that the voltages are better to control in a satisfactory interval, instead of approaching upper limits, so we change voltage range into satisfactory interval. The satisfactory interval is set by users at different load buses. In this paper, we set satisfactory interval to be [0.95,1.05] if voltages satisfy equality and inequality constraints but overstep the satisfactory interval, and dissatisfactory penalty can be relatively small and can be set based on users’ requirement of electricity quality.


### 3.3. Switching Operations

Transformer operation cost is mainly composed of construction, installation, equipment acquisition, maintenance, and so on. DefineSTi as the change of the ratio at transformer i before and after optimization and it is described as(10)STi=Ti-Ti0ΔTi,where Ti is the ratio of transformer i after optimization; Ti0 is the ratio of transformer i before optimization; ΔTi is the step of transformer i. After optimization, tap operation costs are(11)CTC=λ3×ST=λ3×∑i=1NTSTi,where NT is the total of transformers and λ3 is the unit price of each action, which depends on the annual value of investment, operation, and maintenance cost, where each of them is described as follows.


#### 3.3.1. Construction Cost

Construction cost of the transformer is composed of construction project cost, installation project cost, equipment acquisition cost, and other cost, called static investment [20, 21]. Generally, construction cost is expressed as(12)C1=V1·γ·1+γn1+γn-1,where C1 is the annual value of the lump-sum investment, V1 is the lump-sum investment, and γ is the interest rate.


#### 3.3.2. Scrap Value

Scrap value of the transformer can be divided into residual recovery income, early retirement loss cost, and disposal expenses. Its annual value is described as [19](13)C2=-ρ·C1+n-n′n·C1+dc·γ·1+γn1+γn-1.ρ is the recovery factor, and we set it as 20%~30%. The minus sign expresses that the income is negative relative to the expenditure; dc is the current value of the disposal expense; n is the actual operating life; n′ is the expected operating life. When the actual operating life is greater than or equal to the expected life, early retirement loss cost is 0.


#### 3.3.3. Maintenance Cost

The maintenance method adopts scheduling repair; its model is described as(14)V3=∑t=130Me·1-exp⁡-t15.981.35,where Me is early operation and maintenance cost; t is the year number; and V3 is the total cost of maintenance in 30 years. Use the uniform annual value method for conversion; maintenance cost of each year can be expressed as(15)C3=V3·γ·1+γn1+γn-1.Through the above models, the life cycle cost (LLC) is defined as(16)LCC=C1+C2+C3.Take the 110 kv conventional substation [18]. For example, set the expected life of the transformer n′ to be 30 years. γ is 8%, the mechanical life of tap is 10000 times, and average annual switching operations are 333 times. For transformer tap, its unit price of one action in the tth year is(17)Ct_avg=C1+C2+C3333.In this paper, we set λ3=C1_avg.


### 3.4. Objective Function and Constraints

To satisfy the cost savings and security purposes, this paper combines system network loss, voltage dissatisfaction, and switching operation as the optimization objective. Voltage dissatisfaction can be converted into economic cost, so the objective function can be expressed as(18)min⁡Ctot=CPloss+CVVIO+CTC.The function should satisfy the equality and inequality constraints, where equality constraints reflect the physics of the power system shown as(19)PGi-PLi=Vi∑j=1NVjGijcos⁡δij+Bijsinδij,QGi-QLi+QCi=Vi∑j=1NVjGijsinδij-Bijcos⁡δij,where N is node number; PGi and PLi are generator active power output and active power of load at node i; and QGi, QLi, and QCi are generator reactive power input, load reactive power, and reactive power of the compensator capacitor at node i.Inequality constraints are about the limits of active power, reactive power, voltage, capacitance, and the times of switching operations and are created to ensure system security [12] expressed as(20)PGimin⁡≤PGi≤PGimax⁡i∈NG,QGimin⁡≤QGi≤QGimax⁡i∈NG,Vimin⁡≤Vi≤Vimax⁡i∈N,QCimin⁡≤QCi≤QCimax⁡i∈NC,Timin⁡≤Ti≤Timax⁡i∈NT,where NG is the set of generation units; NT is the set of tap transformers; and NC is the set of compensator capacitors.


## 3.1. Active Power Loss

Reactive power is usually used as the objective function. Utilize the following equal to convert power loss into expense:(8)CPloss=λ1×Ploss=λ1×∑i∈Nj∈NiGijVi2+Vj2-2ViVjcos⁡θij,where λ1 is the unit price for system network loss and its value depends on market electricity prices, Ploss is system network loss, N is set of branches numbers, and Ni is the collection of nodes number associated with the node i (including i itself).


## 3.2. Voltage Dissatisfaction

The cost of voltage dissatisfaction describes the users’ losses caused by overlimit voltages on the load buses. When the voltage amplitudes are far from the ideal range, the losses would become more heavy. Voltage dissatisfaction can be expressed by the following mathematical description [19]:(9)CVVIO=λ2×SV=λ2×∑i=1NloadSVi,SVi=ai×PDi×Vimin⁡-ViθVi<Vimin⁡0Vimin⁡<Vi<Vimax⁡bi×PDi×Vi-Vimax⁡Vimax⁡<Vi,where λ2 is the penalty for voltage dissatisfaction; SV is the sum of nodal voltage dissatisfaction degree; PDi is the active power load of node i; ai, bi are the voltage dissatisfaction degree when the voltage values overstep the lower or upper limit, which are declared by the relevant users; θ is the index parameter about the relationship of the losses and voltage deviation; we set θ=1 in this paper. In general, voltage range is [0.94,1.06], but some power consumption equipment needs high security and stability. It is obvious that the voltages are better to control in a satisfactory interval, instead of approaching upper limits, so we change voltage range into satisfactory interval. The satisfactory interval is set by users at different load buses. In this paper, we set satisfactory interval to be [0.95,1.05] if voltages satisfy equality and inequality constraints but overstep the satisfactory interval, and dissatisfactory penalty can be relatively small and can be set based on users’ requirement of electricity quality.


## 3.3. Switching Operations

Transformer operation cost is mainly composed of construction, installation, equipment acquisition, maintenance, and so on. DefineSTi as the change of the ratio at transformer i before and after optimization and it is described as(10)STi=Ti-Ti0ΔTi,where Ti is the ratio of transformer i after optimization; Ti0 is the ratio of transformer i before optimization; ΔTi is the step of transformer i. After optimization, tap operation costs are(11)CTC=λ3×ST=λ3×∑i=1NTSTi,where NT is the total of transformers and λ3 is the unit price of each action, which depends on the annual value of investment, operation, and maintenance cost, where each of them is described as follows.


### 3.3.1. Construction Cost

Construction cost of the transformer is composed of construction project cost, installation project cost, equipment acquisition cost, and other cost, called static investment [20, 21]. Generally, construction cost is expressed as(12)C1=V1·γ·1+γn1+γn-1,where C1 is the annual value of the lump-sum investment, V1 is the lump-sum investment, and γ is the interest rate.


### 3.3.2. Scrap Value

Scrap value of the transformer can be divided into residual recovery income, early retirement loss cost, and disposal expenses. Its annual value is described as [19](13)C2=-ρ·C1+n-n′n·C1+dc·γ·1+γn1+γn-1.ρ is the recovery factor, and we set it as 20%~30%. The minus sign expresses that the income is negative relative to the expenditure; dc is the current value of the disposal expense; n is the actual operating life; n′ is the expected operating life. When the actual operating life is greater than or equal to the expected life, early retirement loss cost is 0.


### 3.3.3. Maintenance Cost

The maintenance method adopts scheduling repair; its model is described as(14)V3=∑t=130Me·1-exp⁡-t15.981.35,where Me is early operation and maintenance cost; t is the year number; and V3 is the total cost of maintenance in 30 years. Use the uniform annual value method for conversion; maintenance cost of each year can be expressed as(15)C3=V3·γ·1+γn1+γn-1.Through the above models, the life cycle cost (LLC) is defined as(16)LCC=C1+C2+C3.Take the 110 kv conventional substation [18]. For example, set the expected life of the transformer n′ to be 30 years. γ is 8%, the mechanical life of tap is 10000 times, and average annual switching operations are 333 times. For transformer tap, its unit price of one action in the tth year is(17)Ct_avg=C1+C2+C3333.In this paper, we set λ3=C1_avg.


## 3.3.1. Construction Cost

Construction cost of the transformer is composed of construction project cost, installation project cost, equipment acquisition cost, and other cost, called static investment [20, 21]. Generally, construction cost is expressed as(12)C1=V1·γ·1+γn1+γn-1,where C1 is the annual value of the lump-sum investment, V1 is the lump-sum investment, and γ is the interest rate.


## 3.3.2. Scrap Value

Scrap value of the transformer can be divided into residual recovery income, early retirement loss cost, and disposal expenses. Its annual value is described as [19](13)C2=-ρ·C1+n-n′n·C1+dc·γ·1+γn1+γn-1.ρ is the recovery factor, and we set it as 20%~30%. The minus sign expresses that the income is negative relative to the expenditure; dc is the current value of the disposal expense; n is the actual operating life; n′ is the expected operating life. When the actual operating life is greater than or equal to the expected life, early retirement loss cost is 0.


## 3.3.3. Maintenance Cost

The maintenance method adopts scheduling repair; its model is described as(14)V3=∑t=130Me·1-exp⁡-t15.981.35,where Me is early operation and maintenance cost; t is the year number; and V3 is the total cost of maintenance in 30 years. Use the uniform annual value method for conversion; maintenance cost of each year can be expressed as(15)C3=V3·γ·1+γn1+γn-1.Through the above models, the life cycle cost (LLC) is defined as(16)LCC=C1+C2+C3.Take the 110 kv conventional substation [18]. For example, set the expected life of the transformer n′ to be 30 years. γ is 8%, the mechanical life of tap is 10000 times, and average annual switching operations are 333 times. For transformer tap, its unit price of one action in the tth year is(17)Ct_avg=C1+C2+C3333.In this paper, we set λ3=C1_avg.


## 3.4. Objective Function and Constraints

To satisfy the cost savings and security purposes, this paper combines system network loss, voltage dissatisfaction, and switching operation as the optimization objective. Voltage dissatisfaction can be converted into economic cost, so the objective function can be expressed as(18)min⁡Ctot=CPloss+CVVIO+CTC.The function should satisfy the equality and inequality constraints, where equality constraints reflect the physics of the power system shown as(19)PGi-PLi=Vi∑j=1NVjGijcos⁡δij+Bijsinδij,QGi-QLi+QCi=Vi∑j=1NVjGijsinδij-Bijcos⁡δij,where N is node number; PGi and PLi are generator active power output and active power of load at node i; and QGi, QLi, and QCi are generator reactive power input, load reactive power, and reactive power of the compensator capacitor at node i.Inequality constraints are about the limits of active power, reactive power, voltage, capacitance, and the times of switching operations and are created to ensure system security [12] expressed as(20)PGimin⁡≤PGi≤PGimax⁡i∈NG,QGimin⁡≤QGi≤QGimax⁡i∈NG,Vimin⁡≤Vi≤Vimax⁡i∈N,QCimin⁡≤QCi≤QCimax⁡i∈NC,Timin⁡≤Ti≤Timax⁡i∈NT,where NG is the set of generation units; NT is the set of tap transformers; and NC is the set of compensator capacitors.


## 4. Reactive Power Optimization Using the Opposition-Based Improved PSO

Crossover and mutation operation and opposition-based learning are two improvement strategies. We combine and apply them to enhance diversity of particles. The specific process is shown in Figure1. The main steps are as follows.Figure 1
Subroutine of evolution strategies.Step 1.
Define the input data. The input data include the generator voltages and the transformer tap settings, reactive power of switchable VAR sources, the population size of the particle swarm, the maximum number of iterations, and accelerated constants.Step 2.
Initialize the population. The initial population is generated randomly, which must meet the constraints. Calculate the opposition pointXi′(t) of Xi(t).Step 3.
Do flow calculation. Correct the system parameters for the flow calculation. Get the power system operation parameters, determine whether particles meet the bus voltage and generator reactive power and other constraints, modify the cross border values, and calculate their fitness.Step 4.
Compare the fitness ofXi(t) and Xi′(t); select the better one as the current generation.Step 5.
Record the individual optimal solution and the global optimal solution. For each particle, update the individual optimal solution. Then, select the best solution of the individual optimal solutions as the global optimal solution,t=t+1.Step 6.
Calculate the current flight speed according to formula (4), and fix the particle position according to formula (1).Step 7.
Select the evolutionary strategies. Go into subroutine (see Figure1); if mod⁡(t,δ)=0, calculate the opposition points as candidate solutions. Else, do crossover and mutation operations and generate candidate solutions according to formula (6) and (7).Step 8.
Update the particle position and modify the cross border values. After reactive compensation and transformer tap variables are discrete, do flow calculation (same as Step3), compare the fitness of the candidate solution and contemporary individual, and select better one as the next generation.Step 9.
Determine whether it is under terminating condition. If the number of iterations at this timet is less than the maximum number of iterations, go to Step 5, or end the iteration and go to Step 10.Step 10.
Output the optimal solution. Optimal solution includes not only the control strategy of the control variables of each node but also the data of state variables, such as the system voltage of every node, system power loss, and generator reactive power output.


## 5. Results and Discussion

In order to validate the availability of the new opposition-based improved PSO (OIPSO) in solving power system reactive power optimization problems, IEEE 30- and IEEE 118-bus systems are employed to be the simulation studies. Two cases are presented in this section. In the first case, run with minimization of real power loss as the objective function and then compare the results with different methods. In the second case, take system network loss, voltage dissatisfaction, and switching operation as the optimization objective and give the optimal settings of control variables.


### 5.1. IEEE 30-Bus System

IEEE 30-bus system data and operating conditions are given in [21], which has 41 branches, 22 load buses, 6 generators (bus 1, bus 2, bus 5, bus 8, bus 11, and bus 13, while bus 1 is the slack bus and others are PV bus), 4 branches containing four adjustable transformers (branch 9-6, branch 10-6, branch 12-4, and branch 28-27, corresponding to transformers T1, T2, T3, and T4), and 2 shunt capacitors on buses 10 and 24, respectively. In the initial conditions, set the initial generator bus voltages and transformer taps to 1.0 and capacitor values to 0. The total power loss before optimization is 0.0537 p.u. In this paper, set the population size of particle swarm to be 36, and the number of iterations is 1000, δ=2. In case one, active power loss is studied, and the result is compared with genetic algorithm (GA) [22], gravitational search algorithm (GSA) [23], differential evolution approach (DE) [24], an opposition-based gravitational search algorithm (OGSA) [25], particle swarm optimization (PSO) [26], and comprehensive learning particle swarm optimization (CLPSO) [26]. Do 50 trials and choose the best one shown in Table 1.Table 1
Comparison of optimal results for different methods.
Parameters
Losses (p.u.)
GA [22]
CR
=
0.6; F=0.01
0.04650
GSA [23]
G
0
=
100; α=10
0.04617
DE [24]
F
=
0.2; CR=0.6
0.04550*
OGSA [25]
G
0
=
100; α=10
0.04498*
PSO [26]
w
max
⁡
=
0.9; wmin⁡=0.4; c1=2
0.04814
CLPSO [26]
w
0
=
0.9; pc=0.4
0.04721
OIPSO
w
max
⁡
=
0.9; wmin⁡=0.4; c1=2; c2max⁡=2.05; c2min⁡=0.5; c3max⁡=5; c3min⁡=0.5
0.04594
CR is crossover rate;F is mutation rate; G0 is the gravitational constant; pc is learning probability, *The reactive compensation and transformer tap variables are continuous.Although DE [24] and OGSA [25] have obtained the optimal values 0.04550 and 0.4498, their reactive compensation and transformer tap variables are continuous, which could not satisfy actual operations. The best solution is 0.045936 calculated by the proposed OIPSO algorithm; its average consumption would be 135 s more than the CPU time of PSO (i.e., 130 s [26]), due to its discrete control variables and flow calculation of opposition point. And it improves 14.45%, more than 14% by GSA, and 10.35% by PSO.In case two, apply OIPSO to the proposed multiobjective problem, which includes system network loss, voltage dissatisfaction of on-load nodes, and switching operations of adjustable transformer. All expenses involved are shown in Table2. The results are shown in Table 3.Table 2
All expenses of reactive power optimization.
Unit network loss convert expensedλ1 (10000 RMB/MW)
Voltage dissatisfaction penaltyλ2 (10000 RMB)
Unit operation cost of transformer tapλ3 (10000 RMB)
69
3
0.5Table 3
The values of control variables after optimization.
Variables
Bus number
PSO [26]
OIPSO
V
1
1
1.0995
1.0995
V
2
2
1.0933
1.0945
V
5
5
1.0697
1.0747
V
8
8
1.0719
1.0764
V
11
11
1.0480
1.0945
V
13
13
1.0945
1.0989
Q
10
10
0.3000
0.2000
Q
24
24
0.0500
0.0500
T
1
9~6
0.9375
0.9500
T
2
6~10
1.0000
1.0000
T
3
12~4
1.0125
1.0000
T
4
28~27
0.9750
0.9875
P
loss
—
0.04702
0.04625
S
V
—
0.001355
0.00573
S
T
—
7
5Table3 shows the optimal value of the control variables of OIPSO solving reactive power optimization. Comparing with PSO, the OIPSO makes small changes in transformer tap and uses little reactive power compensation to improve voltage quality and increase economic efficiency. Meanwhile, the results also reflect that satisfactory interval is necessary, if some voltage values exceed the satisfactory interval, but do not go beyond the constraints, the power system could give up a little of satisfactory degree in exchange for active power loss minimum. This situation would not cause security problems; the dissatisfactory penalty could arouse some attention of operators. The satisfactory interval has a function of forecast.


### 5.2. IEEE 118-Bus System

To test the potential of OIPSO algorithm in solving bigger systems, IEEE 118-bus system is considered, which has 54 generator buses, 64 load buses, 186 transmission lines, 9 transformer taps, and 14 reactive power sources. The system data and operating conditions are given in [26]. The total power loss before optimization is 1.3359 p.u. For case one, Table 4 shows the comparison of results obtained by GSA [23], DE [25], OGSA [25], PSO [26], CLPSO [26], and OIPSO.Table 4
Comparison of optimal results for different methods.
P
loss (p.u.)
CPU time (s)
Success rate (%)
GSA [23]
1.2776
1199
NR*
DE [25]
1.2832
NR*
NR*
OGSA [25]
1.2699
1101.3
NR*
PSO [26]
1.3191
1215
59
CLPSO [26]
1.3096
1472
73
OIPSO
1.0518
1453
70
NR*: not reported.OIPSO discovered the best solution, that is, 1.0518 p.u., in which the improvement is 21.27%, more than 4.36% by GSA, 3.95% by DE, 4.94% by OGSA, 1.26% by PSO, and 2% by CLPSO. Its success rate lags behind CLPSO by 3 points, and CPU process is 1.196 times as PSO does, but OIPSO has more than 20 times as improvement as CLPSO and PSO. The results in this table indicate the superiority of OIPSO. Comparative PSO- and OIPSO-based convergence profiles of power losses for this test system are presented in Figure2.Figure 2
Comparative convergence profiles of power loss.In case two, the multiobjective results of IEEE 118-bus system are given in Table5; these values of the parameters provide actual operation variables, which is more effective and practical.Table 5
The values of control variables after optimization.
Variables
Bus number
PSO [26]
OIPSO
V
1
1
0.9736
1.0844
V
4
4
1.0145
1.0958
V
6
6
0.9969
1.0977
V
8
8
1.0169
1.0956
V
10
10
1.0344
1.0967
V
12
12
0.9868
1.0925
V
15
15
0.9867
1.0899
V
18
18
0.985
1.0929
V
19
19
0.9868
1.0893
V
24
24
0.9799
1.0917
V
25
25
1.0014
1.0981
V
26
26
1.0424
1.0955
V
27
27
1.002
1.0864
V
31
31
1.002
1.0855
V
32
32
1.001
1.0866
V
34
34
0.9964
1.097
V
36
36
0.9881
1.0932
V
40
40
0.9699
1.0731
V
42
42
1.0282
1.088
V
46
46
1.0165
1.0758
V
49
49
1.0213
1.0919
V
54
54
1.0147
1.081
V
55
55
1.0113
1.0819
V
56
56
1.0131
1.0814
V
59
59
1.0424
1.096
V
61
61
1.0252
1.0911
V
62
62
1.0284
1.0873
V
65
65
1.0377
1.0945
V
66
66
1.0381
1.0983
V
69
69
1.0161
1.0972
V
70
70
0.9551
1.0795
V
72
72
0.9793
1.087
V
73
73
0.9269
1.0852
V
74
74
0.9466
1.0593
V
76
76
0.938
1.0639
V
77
77
1.0049
1.0777
V
80
80
1.0194
1.0918
V
85
85
1.0303
1.095
V
87
87
1.09
1.0848
V
89
89
1.0361
1.0979
V
90
90
0.9907
1.0811
V
91
91
1.0087
1.0864
V
92
92
1.0183
1.0965
V
99
99
1.0311
1.084
V
100
100
1.0112
1.0975
V
103
103
1.0027
1.0885
V
104
104
1
1.091
V
105
105
1.0101
1.0829
V
107
107
0.9857
1.0867
V
110
110
0.9663
1.0647
V
111
111
0.972
1.0728
V
112
112
0.9529
1.0521
V
113
113
1.0241
1.0938
V
116
116
1.0285
1.0979
Q
5
5
0
−0.3
Q
34
34
0.1
0
Q
37
37
−0.25
−0.25
Q
44
44
0.1
0.05
Q
45
45
0.15
0.05
Q
46
46
0.2
0.1
Q
48
48
0.05
0.1
Q
74
74
0.1
0.05
Q
79
79
0.15
0.15
Q
82
82
0.2
0.2
Q
83
83
0.3
0
Q
105
105
1
1.05
Q
107
107
0.2
0.1
Q
110
110
0.05
0.05
T
1
5~8
1.025
1.0125
T
2
25~26
1.0125
1.0125
T
3
17~30
0.9875
0.975
T
4
37~38
0.9875
0.9875
T
5
59~63
1
1
T
6
61~64
1
0.9875
T
7
66~65
1
0.9875
T
8
69~68
0.975
1
T
9
80~81
1.025
0.9875
P
loss
—
1.2033
1.1605
S
V
—
0.000585
0.007313
S
T
—
18
8


## 5.1. IEEE 30-Bus System

IEEE 30-bus system data and operating conditions are given in [21], which has 41 branches, 22 load buses, 6 generators (bus 1, bus 2, bus 5, bus 8, bus 11, and bus 13, while bus 1 is the slack bus and others are PV bus), 4 branches containing four adjustable transformers (branch 9-6, branch 10-6, branch 12-4, and branch 28-27, corresponding to transformers T1, T2, T3, and T4), and 2 shunt capacitors on buses 10 and 24, respectively. In the initial conditions, set the initial generator bus voltages and transformer taps to 1.0 and capacitor values to 0. The total power loss before optimization is 0.0537 p.u. In this paper, set the population size of particle swarm to be 36, and the number of iterations is 1000, δ=2. In case one, active power loss is studied, and the result is compared with genetic algorithm (GA) [22], gravitational search algorithm (GSA) [23], differential evolution approach (DE) [24], an opposition-based gravitational search algorithm (OGSA) [25], particle swarm optimization (PSO) [26], and comprehensive learning particle swarm optimization (CLPSO) [26]. Do 50 trials and choose the best one shown in Table 1.Table 1
Comparison of optimal results for different methods.
Parameters
Losses (p.u.)
GA [22]
CR
=
0.6; F=0.01
0.04650
GSA [23]
G
0
=
100; α=10
0.04617
DE [24]
F
=
0.2; CR=0.6
0.04550*
OGSA [25]
G
0
=
100; α=10
0.04498*
PSO [26]
w
max
⁡
=
0.9; wmin⁡=0.4; c1=2
0.04814
CLPSO [26]
w
0
=
0.9; pc=0.4
0.04721
OIPSO
w
max
⁡
=
0.9; wmin⁡=0.4; c1=2; c2max⁡=2.05; c2min⁡=0.5; c3max⁡=5; c3min⁡=0.5
0.04594
CR is crossover rate;F is mutation rate; G0 is the gravitational constant; pc is learning probability, *The reactive compensation and transformer tap variables are continuous.Although DE [24] and OGSA [25] have obtained the optimal values 0.04550 and 0.4498, their reactive compensation and transformer tap variables are continuous, which could not satisfy actual operations. The best solution is 0.045936 calculated by the proposed OIPSO algorithm; its average consumption would be 135 s more than the CPU time of PSO (i.e., 130 s [26]), due to its discrete control variables and flow calculation of opposition point. And it improves 14.45%, more than 14% by GSA, and 10.35% by PSO.In case two, apply OIPSO to the proposed multiobjective problem, which includes system network loss, voltage dissatisfaction of on-load nodes, and switching operations of adjustable transformer. All expenses involved are shown in Table2. The results are shown in Table 3.Table 2
All expenses of reactive power optimization.
Unit network loss convert expensedλ1 (10000 RMB/MW)
Voltage dissatisfaction penaltyλ2 (10000 RMB)
Unit operation cost of transformer tapλ3 (10000 RMB)
69
3
0.5Table 3
The values of control variables after optimization.
Variables
Bus number
PSO [26]
OIPSO
V
1
1
1.0995
1.0995
V
2
2
1.0933
1.0945
V
5
5
1.0697
1.0747
V
8
8
1.0719
1.0764
V
11
11
1.0480
1.0945
V
13
13
1.0945
1.0989
Q
10
10
0.3000
0.2000
Q
24
24
0.0500
0.0500
T
1
9~6
0.9375
0.9500
T
2
6~10
1.0000
1.0000
T
3
12~4
1.0125
1.0000
T
4
28~27
0.9750
0.9875
P
loss
—
0.04702
0.04625
S
V
—
0.001355
0.00573
S
T
—
7
5Table3 shows the optimal value of the control variables of OIPSO solving reactive power optimization. Comparing with PSO, the OIPSO makes small changes in transformer tap and uses little reactive power compensation to improve voltage quality and increase economic efficiency. Meanwhile, the results also reflect that satisfactory interval is necessary, if some voltage values exceed the satisfactory interval, but do not go beyond the constraints, the power system could give up a little of satisfactory degree in exchange for active power loss minimum. This situation would not cause security problems; the dissatisfactory penalty could arouse some attention of operators. The satisfactory interval has a function of forecast.


## 5.2. IEEE 118-Bus System

To test the potential of OIPSO algorithm in solving bigger systems, IEEE 118-bus system is considered, which has 54 generator buses, 64 load buses, 186 transmission lines, 9 transformer taps, and 14 reactive power sources. The system data and operating conditions are given in [26]. The total power loss before optimization is 1.3359 p.u. For case one, Table 4 shows the comparison of results obtained by GSA [23], DE [25], OGSA [25], PSO [26], CLPSO [26], and OIPSO.Table 4
Comparison of optimal results for different methods.
P
loss (p.u.)
CPU time (s)
Success rate (%)
GSA [23]
1.2776
1199
NR*
DE [25]
1.2832
NR*
NR*
OGSA [25]
1.2699
1101.3
NR*
PSO [26]
1.3191
1215
59
CLPSO [26]
1.3096
1472
73
OIPSO
1.0518
1453
70
NR*: not reported.OIPSO discovered the best solution, that is, 1.0518 p.u., in which the improvement is 21.27%, more than 4.36% by GSA, 3.95% by DE, 4.94% by OGSA, 1.26% by PSO, and 2% by CLPSO. Its success rate lags behind CLPSO by 3 points, and CPU process is 1.196 times as PSO does, but OIPSO has more than 20 times as improvement as CLPSO and PSO. The results in this table indicate the superiority of OIPSO. Comparative PSO- and OIPSO-based convergence profiles of power losses for this test system are presented in Figure2.Figure 2
Comparative convergence profiles of power loss.In case two, the multiobjective results of IEEE 118-bus system are given in Table5; these values of the parameters provide actual operation variables, which is more effective and practical.Table 5
The values of control variables after optimization.
Variables
Bus number
PSO [26]
OIPSO
V
1
1
0.9736
1.0844
V
4
4
1.0145
1.0958
V
6
6
0.9969
1.0977
V
8
8
1.0169
1.0956
V
10
10
1.0344
1.0967
V
12
12
0.9868
1.0925
V
15
15
0.9867
1.0899
V
18
18
0.985
1.0929
V
19
19
0.9868
1.0893
V
24
24
0.9799
1.0917
V
25
25
1.0014
1.0981
V
26
26
1.0424
1.0955
V
27
27
1.002
1.0864
V
31
31
1.002
1.0855
V
32
32
1.001
1.0866
V
34
34
0.9964
1.097
V
36
36
0.9881
1.0932
V
40
40
0.9699
1.0731
V
42
42
1.0282
1.088
V
46
46
1.0165
1.0758
V
49
49
1.0213
1.0919
V
54
54
1.0147
1.081
V
55
55
1.0113
1.0819
V
56
56
1.0131
1.0814
V
59
59
1.0424
1.096
V
61
61
1.0252
1.0911
V
62
62
1.0284
1.0873
V
65
65
1.0377
1.0945
V
66
66
1.0381
1.0983
V
69
69
1.0161
1.0972
V
70
70
0.9551
1.0795
V
72
72
0.9793
1.087
V
73
73
0.9269
1.0852
V
74
74
0.9466
1.0593
V
76
76
0.938
1.0639
V
77
77
1.0049
1.0777
V
80
80
1.0194
1.0918
V
85
85
1.0303
1.095
V
87
87
1.09
1.0848
V
89
89
1.0361
1.0979
V
90
90
0.9907
1.0811
V
91
91
1.0087
1.0864
V
92
92
1.0183
1.0965
V
99
99
1.0311
1.084
V
100
100
1.0112
1.0975
V
103
103
1.0027
1.0885
V
104
104
1
1.091
V
105
105
1.0101
1.0829
V
107
107
0.9857
1.0867
V
110
110
0.9663
1.0647
V
111
111
0.972
1.0728
V
112
112
0.9529
1.0521
V
113
113
1.0241
1.0938
V
116
116
1.0285
1.0979
Q
5
5
0
−0.3
Q
34
34
0.1
0
Q
37
37
−0.25
−0.25
Q
44
44
0.1
0.05
Q
45
45
0.15
0.05
Q
46
46
0.2
0.1
Q
48
48
0.05
0.1
Q
74
74
0.1
0.05
Q
79
79
0.15
0.15
Q
82
82
0.2
0.2
Q
83
83
0.3
0
Q
105
105
1
1.05
Q
107
107
0.2
0.1
Q
110
110
0.05
0.05
T
1
5~8
1.025
1.0125
T
2
25~26
1.0125
1.0125
T
3
17~30
0.9875
0.975
T
4
37~38
0.9875
0.9875
T
5
59~63
1
1
T
6
61~64
1
0.9875
T
7
66~65
1
0.9875
T
8
69~68
0.975
1
T
9
80~81
1.025
0.9875
P
loss
—
1.2033
1.1605
S
V
—
0.000585
0.007313
S
T
—
18
8


## 6. Conclusion

In this paper, we developed an opposition-based improved PSO for multiobjective reactive power optimization. The main novelty of the algorithm is the integration of the opposition-based computing into the basic PSO with inertia weight factors, crossover and mutation, and neighborhood model in order to enhance the diversity and produce some additional exploration ability of the population. The performance of the proposed OIPSO algorithm is demonstrated through its calculation on IEEE 30- and 118-bus systems; the comparison results with other algorithms show that OIPSO has better global search ability and fast searching speed. Meanwhile, when the new multiobjective model of reactive power optimization is being built, switching operation cost is defined by the life cycle cost and is emphasized to reflect the actual situation. So, the optimized results are more realistic and more reliable for practical operation.



---

*Source: 754582-2015-06-01.xml*