Professional Documents
Culture Documents
Department of Electronics and Communication Engineering, Indian Institute of Technology, Roorkee, India
Department of Electronics and Communication Engineering, Indian Institute of Technology, Roorkee, India
ABSTRACT
I.
INTRODUCTION
www.ijsret.org
225
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
2.
3.
4.
5.
where
P
:Probability of kth ant going from source node s
to destination node d.
IV.
MODIFICATIONS DONE IN ANT
COLONY ALGORITHM AND RESULTS
A.
Deposition of pheromone on optimal nodes
It is known that the pheromone deposition on each node
is proportional to the value of objective function
obtained at the end of iteration for each path ants have
travelled for this iteration. The objective function is in
fact inversely proportional to ISE (Integral Square of
Error) [4][5]. Suppose the most optimal path was found
during the second or higher iteration, then the ants would
not settle to the new found optimal path because the
optimal path obtained from previous iterations will have
significant deposition of pheromone on it. From
simulation results it was seen that, although we did found
out the most optimal path but it took significant number
or in most cases maximum number of iterations for all
the ants to settle on it.
We know that at the end of every iteration ,the
pheromone deposition on every node gets updated.
Based on the ISE value, obtained for a particular path,
this update takes place [4][5]. So in order to save time
what we can do is that at the end of each iteration we can
increment the pheromone deposition by certain factor on
the nodes of the most optimal path. Along with this we
need to define a pre optimal path, which we can say that
it was the optimal path in the previous iterations, at the
end of each iteration reduce its pheromone contents by
certain large factor so that the probability of ants
following that path decrease or in other words we are
increasing the probability of rejecting this pre optimal
path and increasing the probability of settling of all the
ants on the optimal path.
At the end of iteration let
www.ijsret.org
226
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
For the same system, the Ant Colony Algorithm was run
10 times for original algorithm and 10 times after
modification to see whether the algorithm is terminating
or not with modification. The above results also conform
that the solution proposed is giving us an early
termination to the algorithm.
www.ijsret.org
227
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882
1
2
3
4
5
6
7
8
9
10
6
10(max)
10(max)
10(max)
10(max)
10(max)
10(max)
10(max)
9
10(max)
5
8
10(max)
4
6
5
4
5
5
4
1.2
1
Response
Original
1.4
0.8
0.6
0.4
0.2
0
0
2000
4000
6000
8000
Time(.003 secs)
10000
12000
1
Response
S.no
0.8
0.6
0.4
0.2
0
0
2000
4000
6000
8000
Time(.003sec)
10000
12000
VI. CONCLUSION
[3]
[4]
[5]
REFERENCES
www.ijsret.org
228