International Journal of Engineering Sciences, 2(8) August 2013, Pages: 388-398

TI Journals
ISSN
2306-6474

International Journal of Engineering Sciences

www.tijournals.com

Optimal Grid Topology using Genetic Algorithm to

Maintain Network Security
Brahim Allagui *1, Ismail Marouani 2, Hsen Hadj Abdallah 3
1,2,3

Department of Electrical Engineering, ENIS, 3038 Sfax, Tunisia.

AR TIC LE INF O

AB STR AC T

Keywords:

The modern world needs more and more the electrical energy. This latter is distributed under
different topologies of electrical network. It is in this context that unfolds the subject of my paper.
This paper presents the application of a genetic algorithm (GA) for optimal grid topology in order
to minimize the real power losses in transmission lines, while satisfying several equality and
inequality constraints. The problem constraints are the load flow equations and the security limits.
An IEEE 14 bus system is used as an example to illustrate the technique of optimization. Results
show that the GA it is able to find the optimal grid topology to maintain the security network. A
detailed description of this approach, results and conclusions are also presented.

Optimal topology
network distribution
Power losses
security limits
Genetic Algorithm

2013 Int. j. eng. sci. All rights reserved for TI Journals.

1.

Introduction

The generating stations, the transmission systems and the distribution systems are the three principles which compose an electric power
system. It is through the transmission system that the electric power produced by generators will be consumed by loads. In the present day,
the system of transmission became increasingly subjected several constraints and difficulties to operate, because the growing and tight
demand of power flow. This demand of power flow is distributed under different topologies of electrical network depending on the
objectives it is desired to obtain. In recent years, scientific research and technological development although they looking to solve similar
problems related to electrical network are trying to find the best solutions.In this paper, a mono objective optimization problem has been
considered for optimal grid topology to maintain security network.The mono objective optimization problem consists to minimize total
system transmission loss and improve voltage profile [1]. In previous work, several methods are used to solve this similar optimization
problem .In [2], a linear programming algorithm was introduced. Reference [3] proposes a nonlinear programming algorithm. Actually,
new algorithms are proposed to solve the mono objective optimization problem. However, these researches consider the problem as monoobjective and it was solved using several methods, such as, iterative techniques [1], particle swarm optimization (PSO) technique
[4],[5],[6], differential evolution [7] and (GA) [8],[9]. This paper presents an approach to find the optimal grid topology to maintain
security network in a power system, with minimum transmission losses and voltage deviation at load buses. This approach is based on
genetic algorithm [10]. In the computer science field of artificial intelligence, a genetic algorithm (GA) is a search heuristic that mimics the
process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic
algorithms belong to the larger class of evolutionary algorithms (EA), which generate solutions to optimization problems using techniques
inspired by natural evolution, such as inheritance, mutation, selection, and crossover.The power losses and the voltage deviation are
provided by the load flow program which is formulated by the equality and inequality constraints. In the literature, many power flow
algorithms are proposed. The majority of these methods are based on Newton-Raphson algorithm because of its quadratic convergence
properties [11],[12]. An existing Newton-Raphson load flow algorithm is presented in [12]. In this paper, this algorithm is used in order to
find the initial state into the power system. The proposed algorithm is tested on the IEEE-14 bus test system and using MATLAB software
package.

2.

Methodology

Electrical energy is distributed through the power lines, this is the reason why it is necessary first of all to modeling a transmission line and
define an initial state by applying the program of load flow distribution from which we apply our optimization technique.
2.1 Subheading 1
The figure.1 shows a simple transmission line represented by its lumped equivalent parameters connected between bus-i and bus-j. The
real and reactive power flow from bus-i to bus-j can be written as:

* Corresponding author.
Email address: allagui5555@yahoo.fr

Optimal Grid Topology using Genetic Algorithm to Maintain Network Security

389

Internat ional Jour nal of Engineeri ng Science s, 2(8) Au gust 2013

Pij Vi 2 Gij ViV j [Gij cos( ij ) Bij sin( ij )

(1)

Qij Vi 2 ( Bij Bsh ) ViV j [Gij sin( ij ) Bij cos( ij )

(2)

Where

ij i j . Similarly, the real and reactive power flow from bus-j to bus-i

Pji V j2 Gij ViV j [cos( ij ) Bij sin( ij )

(3)

Q ji V j2 ( Bij Bsh ) ViV j [Gij sin( ij ) Bij cos( ij )

(4)

Figure 1. Transmission line model

2.2 Power flow analysis

Consider a power system with N buses. For each bus i, the injected real and reactive powers given by equations (1) to (4). The power flow
equations are solved using the Newton-Raphson method where the nonlinear system is represented by the linearized Jacobian equation
given by the following equation:

J1
3
J

J 2 P

J 4 Q

(5)

The ij-th elements of the sub-jacobian matrices J1, J2,J3 and J4 are respectively

J 1 (i , j )

3.

Pi
P
Qi
Qi
, J 2 (i , j ) i , J 3 (i , j )
andJ 4 (i , j )
j
V j
j
V j

Problem formulation

3.1Objective function formulation

The optimization problem can be formulated as follows:
Minimize:
Nl

fobjective

* I k2

k 1

Where:
Nl: Number of line.
RK: The resistor of the kth line.
IK: The current in the kth line
Subject to the equality and inequality constraints:
g (I, U, Z =0 : Kirchhoff's laws
h(I,U,Z)<=0 : The security constraints
j(Z)=1: The topology constraints.
K(Z)<=0: The maneuvers Constraints

(6)

Brahim Allagui et al.

390

Int ernational Journal of Engi neering Sc iences, 2(8) Au gust 2013

Where :
I: set of currents in lines
U : set of nodal voltages
j : Function expressing the topology constraints
k: Function expressing the maneuvers constraints
Z : Set to open / close states of branches such as:
Zi = 1 if branch i is closed.
Zi = 0 if branche i is open.
3.2 Constraints formulation
Security constraints:
Security constraints are related to the voltage at each bus and the current level of network lines. These constraints can be expressed
respectively by:

vin vi
vin

i max

(7)

Ij

(8)

I j max prem I
Where :
vin: Nominal voltage at bus i.
vi: Module voltage at bus i.

i max : Maximum permitted voltage deviation.

Ij: The current on the branch j.
Ij max prem: The maximum permissible current in the branch j.
Topology constraints
Nb _ buckles = Nb _ branch- Nb _ summits+1

(9)

X i , X j N , Ci C j ( nk Z ik nk Z jk 1)
Nb ( Ci

(10)

Cj ) = 1

X i N p , X i N s , Ci C j ( nk Z ik nk Z jk 1)
Nb ( Ci

(11)

C j ) >=2

Where :
N: The set of nodes of a graph.
Np: The set of buses priority.
Ns: The set of sources buses.

Ci C j : The unique path connecting the buses i and j.

Zik et Zjk : Topological states (0 or 1) of the n branches which constitute the path
K: Index of branches that constitute the path Ci
Nb ( Ci

Ci C j .

Cj

C j ): The number of paths between the bus i and the bus j.

Maneuvers Constraints
This constraint can be formulated as follows:
=

Where:
Nman : The number of maneuvers.
Nman max : The maximum number of maneuvers.
Zi initial: The initial state of the branch i.
Zi final: The final state (in the optimal configuration) of the branch i.

(12)

Optimal Grid Topology using Genetic Algorithm to Maintain Network Security

391

Internat ional Jour nal of Engineeri ng Science s, 2(8) Au gust 2013

4.

Overview of GA

In this paper, GA has been used for minimize the function of the power losses in the transmissions lines. The first step GA is to fix a
random initial population, which is a set of candidate solutions. In general, candidate solutions are represented as coded number
corresponding to each variable of the optimization problem, called chromosome. Also, for each individual, a fitness function, related to the
objective function, is affected. GA operates in generations.
4.1 Steps of one generation
One generation is as follows:
For each individual of the current population, a fitness function is affected.
One or more parents are chosen according to their fit-ness function.
GA operators, such as, crossover and mutation are ap-plied to parents to produce children.
Theses children are inserted into the following popula-tion. This process is repeated until the population size is reached.

Figure 2. Flow chart of the GA

4.2 Example
In this section we present an example to illustrate the coding applied, the crossover and the mutation process.
Coding applied
For our study we mainly interested in this coding technique called coding of spanning trees which is the way (in terms of computer)
modeling the connections between the buses of a graph (directed or undirected). Most often, these connections are expressed by matrixes
Consider the network formed by 8 buses and 10 branches shown in figure.3 [3]

Figure 3. Graph 8 buses and 10 branches

Brahim Allagui et al.

392

Int ernational Journal of Engi neering Sc iences, 2(8) Au gust 2013

The incidence matrix of figure.3 is defined as follows:

1
0

1
A
0

0
0

1 0 0 0 0 0 0 0 0
1 1 0 0 0 0 0 0 0

0 1 1 1 0 0 0 0 0

0 0 1 0 0 1 0 0 1
0 0 0 1 1 0 0 0 1

0 0 0 0 1 1 1 0 0
0 0 0 0 0 0 1 1 0

0 0 0 0 0 0 0 1 1

(13)

From this matrix, we can be derived the vectors that represent the extremity of each branch which is shown in figure.3
Table 1.Identification of extremities of branches

Vector

Extremity 1

Extremity 2

Branch

14
12
23
34
35
56
46
67
78
48

1
1
2
3
3
5
4
6
7
4

4
2
3
4
5
6
6
7
8
8

1
2
3
4
5
6
7
8
9
10

We choose to eliminate the branches: 3 5 7

Figure 4. Graph 8 buses with 3 branches out of service

This solution will be represented by the following individual:

3

In our study we will use a fundamental buckle coding, each individual in the population will be represented by the branches to remove.

Crossover process
For crossover, in this paper the GA uses a crossover called fundamental crossover.Based on this type of coding of spanning trees. This
crossover is shown as follows:

Optimal Grid Topology using Genetic Algorithm to Maintain Network Security

393

Internat ional Jour nal of Engineeri ng Science s, 2(8) Au gust 2013

Figure 5. Fundamental crossover

The figure.5 illustrates how we can identify the crossover for this type of coding.

Mutation process
We illustrated the mutation of a chromosome for this type of coding. We can make the same remark about the validity of the resulting
chromosome. The references that offer different types of coding, indicate the need for testing the validity of chromosomes resulting from
each crossover and mutation operation. This amounts to perform a graph traversal to test its connection after each operation.
From the example considered in the figure.3, the mutation for the coding of spanning trees is illustrated as follows:
Step 1: branch close (random choice)

3 57

Step 2: random choice to open a branch in the buckle, the branch chosen in step 1 is part.

367

5.

Simulation Results

The studied network is a network IEEE test consisting of 14 bus (1 bus generator 13 load buses) and 20 branches, this network is shown
schematically in FIG III.1.all algorithms are implemented on the MATLAB software version 7.0 .4.
5.1. Operating results for the initial condition
Application of the algorithm for load distribution
The calculation of load distribution based on the Newton-Raphson method (decoupled) allowed us based on the data network studied to
determine the electrical quantities at a given time as the currents in the lines (the current in branch k ) and voltage at load buses, power
(active and reactive) transited. This algorithm also allows us to evaluate the power losses in our network. In an initial state, for a network
with branches not eliminated, the load balancing algorithm allows us to identify the state that is the object of study network such as losses
transited, currents and voltages at load buses.The convergence characteristic for the power flow program is given in figure.7.

Brahim Allagui et al.

394

Int ernational Journal of Engi neering Sc iences, 2(8) Au gust 2013

Figure 6. IEEE 14 bus Network (All data of the system are given from tables 4 and 5).

0.8

Convergence criterion

0.7
0.6
0.5
0.4
0.3
0.2
0.1
0

Iterations number

Figure 7. Convergence criterion of the power flow algorithm

Initial presentation topological network

Figure.8 shows the topology of the network IEEE 14 bus.

Figure 8.IEEE Network 14 bus topological

10

Optimal Grid Topology using Genetic Algorithm to Maintain Network Security

395

Internat ional Jour nal of Engineeri ng Science s, 2(8) Au gust 2013

Exploitation of results
In figure.9, the x-axis represents the buses and the y-axis represents the voltage across each bus.

Figure 9. Histogram voltages of the buses in mesh network (initial state)

In this initial situation (distribution network is meshed ), where the all branches are in services, losses are evaluated to: Losses = 0.1694 pu.
5.2. Results of network optimization IEEE 14 bus
To get the optimal configuration of our network IEEE study, we apply the genetic algorithm. From the equation (9), we can deduce the
number of branches removed for the IEEE Network 14 buses. Therefore the number of variables of the problem is var = 7. We will search
for a new network configuration that minimizes losses by eliminating seven branches. Table 2 gives the parameter values for GA.
Table 2.Parameter values for GA
Parameter

GA

Population size

100

Generations

35

Probability of selection

0.1

Probability of crossover

0.8

Probability of mutation

0.02

Search for new configuration

To identify the configuration best suited to the optimization criteria considered, it has seven branches removed for a radial network to
minimal losses. The genetic algorithm randomly seeking the combination of the seven branches formed the most appropriate in order to
have an optimal configuration.
0.22
0.21

Power losses [pu]

0.2
0.19
0.18
0.17
0.16
0.15
0.14
0.13
0

10

15

20

25

30

Generations

Figure 10. Convergence of power losses

35

Brahim Allagui et al.

396

Int ernational Journal of Engi neering Sc iences, 2(8) Au gust 2013

11

14

10
6

13

4
12

Figure 11. Topology after opening branches

14

11

10
6

13

12

Figure 12. New network architecture IEEE14 bus

Figure.10 shows the convergence of the genetic algorithm after 31 iterations gives the minimization of power losses.The best configuration
is: [7 5 4 3 13 17 18]
Losses = 0.1375 pu
The new network topology after the opening of branches 7, 5, 4, 3, 13, 17 and 18 is shown in figure.11and 12.
Table 3.Combination of branches with their losses
Branch 1

Branch 2

Branch3

Branch4

Branch 5

Branch6

Branch 7

Losses

20
13
20
20
20
20
20
20
20
20
7
7

6
5
17
5
5
5
5
5
5
5
5
5

13
7
7
7
7
7
7
7
7
7
4
4

12
8
8
8
8
8
8
8
8
8
3
3

8
4
4
4
4
4
4
4
4
4
13
13

19
20
13
13
13
13
13
13
13
13
17
17

16
4
19
19
19
19
19
19
19
19
18
18

0.1786
0.1741
0.1660
0.1489
0.1489
0.1489
0.1489
0.1489
0.1489
0.1489
0.1375
0.1375

7
7
7
7
7
7
7

5
5
5
5
5
5
5

4
4
4
4
4
4
4

3
3
3
3
3
3
3

13
13
13
13
13
13
13

17
17
17
17
17
17
17

18
18
18
18
18
18
18

0.1375
0.1375
0.1375
0.1375
0.1375
0.1375
0.1375

The continuity of service is verified since all buses are connected, we say that the network is a connected graph in which all buses are
connected to the source.
This configuration shows that there is no isolated bus, so we checked the connectivity constraint. We also check that there is only one path
between each peer buses therefore constraint topology is also verified.

Optimal Grid Topology using Genetic Algorithm to Maintain Network Security

397

Internat ional Jour nal of Engineeri ng Science s, 2(8) Au gust 2013

5.3.Verification of security constraints

Security constraints related to current:
Verify constraints current means that the current in the lines Ib do not exceed the maximum current line Ibmax, ( Ib < Ibmax).
It has 7 branches removed figure.13 shows the currents in the open branch are zero, so we verify the currents in the branches which are
services that do not exceed the maximum allowable current that can be support each branch.
2.5
2.25
Ib

Ibmax
Current in line [pu]

1.75
1.5
1.25
1
0.75
0.5
0.25
0

9 10 11 12 13 14 15 16 17 18 19 20
Branch number

Figure 13. Histogram of the currents in the branches

Security constraints related to voltage deviation:

The voltage profile at load buses of the system before and after optimization are shown in figure.14. As shown in the figure, the voltage at
all buses is in the acceptable limits (0.9<Vi<1.1 pu) and improved significantly after optimization for the optimal system security of the
net-work distribution system.

Uper limit
Low er limit
1.15

Case 1
Case 2

1.1

Voltage [pu]

1.05

0.95

0.9

0.85

0.8

10

11

12

13

14

Bus number

Figure 14. Voltage profile after and before optimization

Case 1: Before optimization
Case 2: After optimization

6.

Conclusion

In this paper, GA has been used for minimize the function of the power losses in the transmissions lines in order to find the optimal grid
topology while satisfying several equality and inequality constraints related to network security. A Newton-Raphson algorithm is used to
solve the load flow equations. The simulations results obtained for the IEEE-14 bus network showed the effectiveness of the proposed
method that is translated by a considerable reduction on the real power losses and the generation cost, and also an improvement in the
voltage profile to maintain the network security.

Brahim Allagui et al.

398

Int ernational Journal of Engi neering Sc iences, 2(8) Au gust 2013

Table 4. Data lines-IEEE 14 bus

branch

Bus i

Bus j

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

1
1
1
1
1
2
2
2
3
3
4
4
5
6
7
7
8
8
12
13

2
3
4
12
13
11
13
14
4
10
5
9
6
11
8
11
9
11
13
14

0.01335
0
0
0.06701
0.05811
0
0.05695
0.05403
0
0
0.03181
0.12711
0.08205
0.09498
0.22092
0.12291
0.17093
0.06615
0.04699
0.01938

X
0.04211
0.20912
0.55618
0.17103
0.17632
0.25202
0.17388
0.22304
0.111001
0.176151
0.0845
0.27038
0.19207
0.1989
0.19988
0.25581
0.34802
0.13027
0.19797
0.05917

0.0128*s
0
0
0.0346*s
0.0374*s
0
0.034*s
0.0492*s
0
0
0
0
0
0
0
0
0
0
0.0438*s
0.0528*s

Table 5. Data buses-IEEE 14 bus

BUS

PS

QS

PC

QC

1
2
3
4
5
6
7
8
9
10
11
12
13
14

0
0
0
0
0
0
0
0
0
0
0
0
0
0

0
0
0
0
0
0
0
0
0
0
0
0
0
0

0.478
0.076
0
0.295
0.149
0.135
0.035
0.09
0.061
0
0.112
0.942
0.217
0

0.039
0.016
0
0.166
0.05
0.058
0.018
0.058
0.016
0
0.075
0.19
0.127
0

1
1
1
1
1
1
1
1
1
1
1
1
1
1.06

References
[1]
[2]
[3]
[4]
[5]

[6]

[7]
[8]
[9]
[10]

P. Preedavichit and S. C. Srivastava, Optimal reactive power dispatch considering FACTS devices, Electric Power Systems Research, Vol. 46, pp.
251-257, 1998.
Mamandur KRC, Chnoweth RD. Optimal control of reactive power flow for improvement in voltage profiles and for real power loss minimization.
IEEE Trans Power Apparat Syst. 1981;PAS-100(7):3185-93.
Mansour MO, Abdel-Rahman TM, Non-linear VAR optimization using decomposition and coordination. IEEE Trans Power Apparat Syst 1984;
PAS-103(2):246-55.
A. El-Zonkoly, Optimal sizing of SSSC controllers to minimize transmission loss and a novel model of SSSC to study transient response, Electric
power systems research, Vol. 78, pp. 1856-1864, 2008.
M. Saravanan, S. Mary Raja Slochanal, P. Venkatesh and J. Prince Stephen Abraham, Application of particle swarm optimization technique for
optimal location of FACTS devices considering cost of installation and system loadability, Electric Power Systems Research Vol. 77, pp. 276-283,
2007.
H. R. Baghaee, M. Mirsalim, A. Kashefi-Kaviani and G. B. Gharehpetian, Optimal Allocation of Multi-type FACTS Devices to Improve Security
and Reduce the Losses and Fault Level using Multi-Objective Particle Swarm Optimization , International Review of Electrical Engineering
(IREE), Vol. 4, No.6, Dec. 2009 (ISI-ranked)
M. Basu, Optimal Power Flow with FACTS Devices using differential evolution, Electrical Power and Energy Systems, Vol. 30, pp. 150-156,
2008.
K. Vijayakumar and R. P. Kumudinidevi, A hybrid genetic algorithm for optimal power flow incorporating FACTS devices, Asian Journal of
Scientific Research Vol. 1, No. 4, pp. 403-411, 2008.
Javad Javidan, Ali Ghasemi, Environmental/Economic Power Dispatch Using Multi-objective Honey Bee Mating Optimization, International
Review of Electrical Engineering (IREE), Vol. 7, No.1, pp. 3667-3675.
Srinvas N. and Deb K., Multi-objective function optimization using non-dominated sorting genetic algorithms , Evolutionary Computation, 2(3),
PP. 221-248, 1994.