2008 IEEE Region 10 Colloquium and the Third ICIIS, Kharagpur, INDIA December 8-10. 

Paper ID: 250 a curve through 49 data points for each of α and β and obtain an algebraic relation between α or β and the features of problem environment. The results are displayed in the following two figures (fig 13 and 14) along with the approximated equations establishing the relation between two sets of parameters. This exhaustive experimentation allows determination of optimum values of α and β when the features of problem environment are known in advance. 

![0_image_0.png](0_image_0.png)

[ x": x scaled 0 to π, y": y scaled 0 to π; x ≡ number of nodes in 200 sq unit area,y ≡**standard deviation]** 
α=a+bcos(x")+ccos(y")+dcos(2x")+ecos(x")cos(y")+ fcos(2y")+ 
gcos(3x")+hcos(2x")cos(y")+icos(x")cos(2y") +jcos(3y")+ 
kcos(4x")+lcos(3x")cos(y")+mcos(2x")cos(2y") + 
ncos(x")cos(3y")+ocos(4y") 
Co-efficient values: 
a=0.935,b=-0.237,c=-0.020,d=-0.011,e=-0.028, 

![0_image_1.png](0_image_1.png)

[ x': x scaled -1 to +1, y': y scaled -1 to +1 Si=2..n(x')=-1+2/(1+exp(-(x'+1-(i-1)*(2/n))/0.12)),S1(x')= x'] 
β=a+bS1(x')+cS1(y')+dS2(x')+eS1(x')S1(y')+fS2(y')+ gS3(x')+ 
hS2(x')S1(y')+iS1(x')S2(y')+jS3(y')+kS4(x')+ lS3(x')S1(y') + 
mS2(x')S2(y')+nS1(x')S3(y')+oS4**(y')** 
Co-efficient values: 
a=3.742, b=0.323, c=0.422, d=-0.090, e=0.414 f=-0.124, g=-0.105, h=-0.12, i=-0.131, j=-0.111 k=0.019, l=-0.196, m=0.100, n=0.007, o=-0.139 VI. CONCLUSIONS AND SCOPE OF FUTURE WORK
The paper presents a novel approach of stability analysis as well as a new kind of pheromone deposition rule which outperforms the traditional approach of pheromone deposition used so far in all variants of ant system algorithms. Our future effort is focused in comparing the two kinds of deposition approach with other models of ant system like Max-Min Ant System (MMAS) and Rank-Based Ant System and estimate the optimum parameter setting of proposed deposition approach for these models. 

REFERENCES
[1] C. Blum and M. Dorigo, "Search bias in ant colony: On the role of competition balanced systems," IEEE Transactions on Evolutionary Computation, vol. 9, no.2, pp. 159-174, 2005. 

[2] Marco Dorigo, Vittorio Maniezzo and Alberto Colorni "The Ant System: Optimization by a colony of cooperating agents" IEEE 
Transactions on Systems, Man, and Cybernetics–Part B, Vol.26, No.1, 1996, pp.1-13 
[3] M. Dorigo and C. Blum "Ant colony optimization theory: A survey" Theoretical Computer Science 344 (2005) 243 - 278
[4] D. Merkle and M. Middendorf, "Modeling the dynamics of ant colony optimization algorithms," *Evolutionary Computation*, vol.10, no. 3, pp. 235-262, 2002. 

[5] J.L, Deneubourge, S. Aron, S. Goss, and J. M Pasteels, "The Selforganizing exploratory patterns of the Argentine ant," Journal of Insect Behavior, vol. 3, pp. 159, 1990. 

[6] L.M. Gambardella and M.Dorigo, "Solving symmetric and asymmetric TSPs by ant colonies," in Proc. 1996 IEEE International Conference on Evolutionary Computation T.Baeck et al., Eds. IEEE 
Press, Piscataway, NJ, pp. 622-627,1996. 

[7] M. Dorigo, V. Maniezzo, and A. Colorni, "Positive feedback as a search strategy", Dipartimento di Electtronica, Politecnico di Milano, Italy, Tech Rep. 91-016, 1991. 

[8] Abraham, A.Konar, N.R.Samal,S. Das "Stability Analysisof the Ant System Dynamics with Non-uniform Pheromone Deposition Rules" in Proc. IEEE Congress on Evolutionary Computation, 2007. 

[9] M. Dorigo, V. Maniezzo, and A. Colorni," Ant System:Optimization by a colony of cooperating agents," *IEEE Transactions on Systems,* 
Man, and Cybernetics-Part B, vol. 26, no. 1, pp. 29-41, 1996. 

[10] M. Dorigo, et al., "Ant Colony System: A cooperative learning approach to the traveling salesman problem," IEEE Transactions on Evolutionary Computation, vol. 1, no.1, pp. 53-66, 1997. 

[11] M. Dorigo and G. Di Caro, " The Ant Colony Optimization metaheuristic," IEEE Transactions on System, Man, and Cybernetics-Part B, vol. 34, no. 2, pp. 1161-1172, 2004. 

[12] T.Stiitzle and M.Dorigo, "A short convergence proof for a class of ACO algorithms," *IEEE Transactions on Evolutionary Computation*, vol. 6, no.4, pp. 358-365, 2002. 

[13] W.J.Gutjahr, "On the finite-time dynamics of ant colony optimization," 
Methodology and Computing in Applied Probability, vol. 8, no. 1, pp. 105-133, 2006. 

[14] W.J.Gutjahr. "A graph-based ant system and its convergence," Future Generation Computer Systems, vol. 16, no.9, pp. 873-888. 

[15] M. Dorigo and T. Stutzle. 2005 Ant Colony Optimization, *PrenticeHall of India Private Limited ISBN*-81-203-2684-9 
[16] http://en.wikipedia.org/wiki/Dijkstra's_algorithm
[17] B. S. Grewal, *Higher Engineering Mathematics*, Khanna Publisher, New Delhi, 1996. 