OPTIMAL PATH FINDER USING GENETIC ALGORITHM

CHAPTER 6

ANALYSIS

6.1 DISTANCE MATRIX COMPARISION

City 1 2 3 4 5
1 0 5.8933 5.7802 9.2343 6.5674
2 5.8933 0 7.7894 4.8336 8.6143
3 5.7802 7.7894 0 9.8393 8.5619
4 9.2343 4.8336 9.8393 0 2.7254
5 6.5674 8.6143 8.5619 2.7254 0

Table 6.1 Distance Matrix 1

Table 6.2 Distance Matrix 2

DEPARTMENT OF COMPUTER SCIENCE AND TECHNOLOGY 22

 OPTIMAL PATH FINDER USING GENETIC ALGORITHM

6.2 GENE MATRIX COMPARISION

2 1 5 3 4
3 5 2 4 1
4 5 3 2 1
3 2 4 1 5
4 1 3 5 2
1 2 5 3 4
5 2 1 3 4
4 2 3 1 5
5 2 1 3 4
5 2 1 3 4
5 3 2 1 4

Table 6.3 Gene Matrix 1

2 5 3 4 1

1 4 3 5 2

4 3 2 1 5

3 5 4 2 1

4 1 5 3 2

2 4 3 5 1

3 2 1 4 5

2 4 1 5 3

4 1 5 3 2

Table 6.4 Gene Matrix 2

DEPARTMENT OF COMPUTER SCIENCE AND TECHNOLOGY 23

 OPTIMAL PATH FINDER USING GENETIC ALGORITHM

6.3 OBSERVATION AND ANALYSIS RESULT

When the random coordinates are selected in use then overall calculation
depends on the coordinate value which is generated using rand function. If the
coordinates are close then the more optimistic graph will be generated and
chromosome having more fit value in comparison to the chromosomes whose
randomly generated chromosomes have more distance.

The optimal path or the chromosome value even depends upon the generation
value which means that more the generation value more mutation and
crossover will take place and more optimal path or chromosome can be
generated when compared to the less generation value.
The main graph output basically depends upon the random coordinates
generated and the generation number or the total number of iteration.

DEPARTMENT OF COMPUTER SCIENCE AND TECHNOLOGY 24