Professional Documents
Culture Documents
net/publication/331153232
CITATIONS READS
0 131
2 authors:
Some of the authors of this publication are also working on these related projects:
Non-linear numerical control using a FPGA of a doubly-fed induction machine for electric traction View project
All content following this page was uploaded by Sirine Essallah on 10 July 2019.
Where ri and I i are respectively the resistance and the • Radial topology constraint
current of the ith branch, ki is a binary variable which Since most distribution systems operate in a radial topology as
represents the state of the branches, N is the total number of a compromise between investment cost (mainly related to
distribution network buses, X is the control variables vector, protection systems) and reliability, the radial topology is
xi is the state of the ith branch, and Nc is the total number of considered as a constraint.
branches. III. BPSO ALGORITHM
The PSO algorithm developed by Kennedy and Eberhart
B. Constraints [15] is one of the most used heuristic methods to solve many
For each proposed configuration, the power flow analysis problems related to electrical network. The PSO algorithm is
should be carried out to compute system power losses, bus based on the social behavior of a set of particles that move
voltages and branch current. The objective function is towards an optimal solution. The latter will depend on their
subjected to the following constraints: own experiences as well as that of the other particles of the
group.
• Power flow equations:
Each particle i of the D-dimensional search space is
N
associated with a position vector and a velocity vector
Pi = ViV j Yij cos(θij − δ i + δ j ) represented respectively by X i = [ xi1 , xi 2 ,..., xiD ] and
i =1
N
(2) Vi = [vi1 , vi 2 ,..., viD ] . The best position of the particle is
Q = V V Y sin(θ − δ + δ )
i i j ij ij i j recorded and represented by Pbesti = { Pi1 , Pi 2 , , PiD } . The
i =1 particle having the best position among all the particles of the
group is represented by Gbest = PbestG = { PG1 , PG 2 ,..., PGD } .
Where Pi and Qi are respectively the active and reactive
Position and velocity of each particle are updated as
powers injected at the ith bus, Vi and δ i are respectively the follows:
amplitude and the angle of the voltage at the ith bus. Yij and θij ( k +1) (k ) (k )
Vi = ω × Vi + c1 × rand1 (ο )( Pbesti − X i ) +
are respectively the amplitude and the angle of the branch (6)
(k )
admittance between buses i and j. c2 × rand 2 (ο )(Gbesti − X i )
Ligne Ligne
Pij < Pij max (3)
Where k is the iteration number, ω is the inertial weight, c1 Begin
and c2 are the weighting factors of the stochastic acceleration
that pull each particle to the Pbest and Gbest positions, rand1
Read network Data and compute system power losses
and rand2 are random numbers between 0 and 1, Pbesti is the by means of Newton Raphson algorithm
best previous experience of the ith particle, Gbesti is the best
particle among the entire population and N is the total number
of particles composing the swarm. Set BPSO parameters and iteration number k
ωmax − ωmin
ω ( k +1) = ωmax − ×k (8)
k max Calculate the objective function for each particle,
based on distribution load flow results
Where kmax is the maximum number of iterations, ωmax and
ωmin are respectively the maximum and minimum inertia Select the global position Gbest based on the objective
function values
weights.
In the network reconfiguration problem, the switches can
Select the ith particle
have only two states open/close. Thus, the status of the switch k=k+1
can be described by a binary vector. The BPSO was introduced
by Kennedy and Eberhart to allow the PSO algorithm to
operate in binary search spaces [17]. Each element of the Select the local position Pbest for the ith particle
position vector can only take binary values and the particle i=i+1
velocity is represented by a probability which takes its values
Update velocity and position of each particle using
in [0,1]. A logical transformation S (Vi (k) ) is used to equations (7) and (10) respectively
π
π π π π π π
π
π π π π π π π π π π π
0.98
0.96
π
π π π
0.94
0.92 Case 1 BR
Fig.3. IEEE 33-bus system before reconfiguration Case 2 BR
Case 3 BR
0.9 Case 1 AR
B. Results and discussion Case 2 AR
Case 3 AR
Referring to literature [20] [21] and by testing the BPSO 0.88
0 5 10 15 20 25 30
algorithm several times to correctly adjust the population size, Bus Number
the number of iterations and the inertia weight, the BPSO Fig. 5. Voltage profil of the 33-bus system before reconfiguration (BR) and
parameters are selected as follows: after reconfiguration (AR)
π π π π π π
π
Loss
reduction - 33.5 - 34.46 - 28.25
π
(%)
π
π π π
Vmin ( p.u ) 0.90845 0.93935 0.8937 0.9313 0.8928 0.9292
Voltage
(a) improvement - 3.4 - 4.21 - 4.07
(%)
π 33-34- 33-34- 7-9- 33-34- 7-14-
Open 7-9-14-
35-36- 35-36- 14-32- 35-36- 32-35-
switches 32-37
37 37 37 37 37
LI (%) - - 20 53 15 33
π π π π π
π
π
π
π π π π π π
π
π π π π π π π π π Referring to Table I, the minimum bus voltage after
reconfiguration has increased from 0.90845 to 0.93935 for the
first case, from 0.8937 p.u to 0.9312 p.u for the second case
π
and from 0.8928 p.u to 0.931 p.u for the third case. Thus, an
π π π
improvement of 3.4%, 4.21% and 4.07% for cases 1, 2 and 3
respectively is recorded. With the new network configuration,
(b) we can reach up to 53% of load increase for the second case
Fig.4. New network configuration: a) Cases 1 and 2, b) Case 3
and up to 33% for the third one without affecting the network
performance. This proves that the BPSO based network those of other approaches developed in the literature as shown
reconfiguration is effective for a long period since this load in Table II. Referring to Table II, it can be seen that the
level will not be quickly reached. proposed reconfiguration solution has a better performance
To ensure the reliability of the proposed approach, the compared to other methods in terms of reducing network
obtained results for the nominal load level are compared with losses and voltage drop.
TABLE II. COMPARISON OF SIMULATION RESULTS FOR CASE 1 WITH APPROACHES DEVELOPED IN LITERATURE
Item
Approach
PLoss ( kW ) PLoss ( kW ) Loss reduction Vmin ( p.u ) Vmin ( p.u ) Voltage
Open switches
(BR) (AR) (%) (BR) (AR) improvement (%)
Proposed approach 7-9-14-32-37 197 131 33.5 0.90845 0.93935 3.4
GA-PSO [22] 7-9-14-32-37 202.7 139.5 31.2 0.9131 0.9378 2.7
CSA [23] 7-9-14-32-37 203.67 138.87 30.93 0.9108 0.9424 3.46
IAICA [24] 7-9-14-32-37 203.67 139.51 31.5 0.9108 0.9378 2.96
FWA [3] 7-9-14-28-32 203.67 139.98 31.27 0.9131 0.9413 3.09