Академический Документы
Профессиональный Документы
Культура Документы
I.
INTRODUCTION
1341
GENETIC ALGORITHM
A. Initialization of Population
The strategy used to determine the initial population
consists of randomly generating non-dominated feasible
solutions only. This strategy produced better results when
compared with strategies that randomly generate solutions of
any type (feasible or non-feasible) or feasible solutions
(dominated or non-dominated) only.
B. Genetic Operators
The genetic operators are section, crossover and mutation.
The operator selection involves the process of selecting best
population of individuals for new generation. During each
successive generation, a proportion of the existing population
is selected to breed a new generation.
In the crossover, the values are going to change according
to the objective function by comparing two successive values.
Two-point crossover has been used, because it produced better
results than one-point and uniform crossover. The mutation
indicates the self changing of values to solve the problem.
1342
w = wmax
wmax wmin
iter
itermax
(1)
Vmax,t = Vmax
(2)
Position and velocity of each particle change with time.
Velocity and position of each particle in the next generation
(time step) can be calculated as:
(3)
(4)
(5)
Vmax Vmin
iter
itermax
(6)
1343
V.
(7)
(8)
rsh j =
48000
2
30 365 24
3
= 0 .2 7 3 9
($MVAr)
1344
VI.
PROBLEM FORMULATION
A. Nomenclature
Nb- Set of numbers of total buses
Nt- Set of numbers of tap-setting transformer
branches
Nc- Set of numbers of possible reactive power source
installation buses.
Npv- Set of numbers of PV buses
No- the swing bus
Pgi- ith bus real power supply
Qgi- ith bus reactive power supply
Pdi- ith bus real power load
Qdi- ith bus reactive power load
Vi- ith bus voltage magnitude
i- ith bus voltage phase angle
ij- Phase angle difference between bus i and j
Gij- mutual conductance between bus i and j
Bij- mutual susceptance between bus i and j
Gii- ith bus self conductance
Bii- ith bus self susceptance
Qci- reactive power source
Tk- Transformer k taps
ij
In this section, the reactive power is simulated using IEEE30 bus test system and the results obtained for optimal reactive
power are presented. The performance of reactive power is
studied for two different techniques. In the first case, Genetic
Algorithm is used to optimize the reactive power. In the
second case, Particle Swarm Optimization technique is used to
optimize the reactive power. The co-efficient for the cost
function to calculate the reactive power cost are given in the
table below
TABLE1. Coefficient Factors of Equation (8)
(10)
V j ]}
j =1
ji
(11)
(1 .0 V m ( i ))
Ti-min Ti Ti-max, i NT
VII. SYSTEM STUDIES AND RESULTS
B. Objective Function
The objective function is to minimize the reactive power
which is given as follows:
Q i = i {V i * [ V i Y i i +
GEN
a($/ MW2)
b($/MW)
c($)
Kg
GEN1
GEN2
GEN13
GEN22
GEN23
GEN27
0.02
0.0175
0.0625
0.0083
0.025
0.025
2
1.75
1
1.25
3
3
0.0
0.0
0.0
0.0
0.0
0.0
0.1
0.1
0.1
0.1
0.1
0.1
i =1
(12)
Fig5. Voltage comparison chart for all buses
C. Equality Constraint
V V (G
i
ij
j =1
(13)
V V (G
i
j =1
ij
sin ij + B ij cos ij )
D. Inequality Constraints
Vi-min Vi Vi-max, iN
QGi-min QGi QGi-max, i {N pv, No}
qci-min qci qci-max, iNc
(14)
1345
1346