Analysis and Optimization of IEEE 33 Bus Radial Distributed System Using Optimization Algorithm
Analysis and Optimization of IEEE 33 Bus Radial Distributed System Using Optimization Algorithm
17
(JETAE) Journal of Emerging Trends in Applied Engineering (ISSN 2518-4059),
Vol. 1, No. 2, 2016
IV. M ETHODOLOGY
Appling HGAPSO algorithm in order to find the optimal
solution of the network configuration to minimize the loss
problem, following steps being followed in order to imple-
Fig. 1: Flow chart of HGAPSO ment:
1) Loop counter and counter of global best improvement
are set to zero.
Nb
X 2) Find the possible matches from the bidding.
Qx = − |Zxy Vx Vy | cos (θxy + δx − δy ) (3) 3) Initial population is generated.
y=1 4) Calculate the fitness (utility) for each chromosome and
where particle variables (velocity and position are set to zero
It must be observed that the limit of voltage busses must be while local and global best positions are set.
within the rage 5) Preserve global best, to be compared to the new one, in
V min ≤ V i ≤ V max order to decide whether it is improved or not.
Moreover, capability of feeders has the limits |Ik | ≤ 6) Selection operation is conducted to find best chromo-
Ikmax k {1, 2, 3, ..., l} some in population and copy the best chromosome in
Format of the configuration must ne radial No load-point the new population Pn.
interruption 7) Population P is mutated and crossed-over based on the
where V min , V min and Ikmax represent the minimum probability of crossover and mutation and then put into
voltage, maximum voltage and maximum capability of current Pn.
that k branch can have 8) Calculate Pn fitness and particles values
9) Update Count according to the value of Pg . If the global
III. H YBRID G ENETIC A LGORITHM PARTICLE S WARM best did not improve after the selection, between original
O PTIMIZATION HGAPSO P and Pn , then the counter will be increased. This step
The hybrid of GA and PSO named HGAPSO shown in takes advantage of PSO in order to reduce the time.
Fig. 1S, originally presented by Juang [11], is used. This 10) Increase the loop counter.
algorithm consists of four major operators: enhancement, 11) Check the termination condition. If the maximum gen-
selection, crossover, and mutation. eration number is reached or when the global best is not
To overcome the limitations of PSO, hybrid algorithms with improved for a specific number of times (i.e., Count Pg
GA are proposed. The basis behind this is that such a hybrid variable equals quarter maximum generation number),
approach is expected to have merits of PSO with those of GA. then stop the algorithm and put P into W, which have the
18
(JETAE) Journal of Emerging Trends in Applied Engineering (ISSN 2518-4059),
Vol. 1, No. 2, 2016
20
(JETAE) Journal of Emerging Trends in Applied Engineering (ISSN 2518-4059),
Vol. 1, No. 2, 2016
21