基于分布均匀度的适应蚁群算法.pdf

1000-9825/2003/14(08) 1379 ©2003 Journal of Software 软 件 学 报 Vol.14, No.8 基于分布均匀度的自适应蚁群算法 1 , 2 + 1 1 1 陈 崚 , 沈 洁 , 秦 玲 , 陈宏建 1(扬州大学 计算机科学与工程系, 江苏 扬州 225009) 2 (南京大学 计算机软件新技术国家重点实验室, 江苏 南京 210093) An Adaptive Ant Colony Algorithm Based on Equilibrium of Distribution 1,2+ 1 1 1 CHEN Ling , SHEN Jie , QIN Ling , CHEN Hong-Jian 1(Department of Computer Science and Engineering, Yangzhou University, Yangzhou 225009, China) 2 (National Key Laboratory for Novel Software Technology , Nanjing University, Nanjing 210093, China) + Corresponding author: Phn: 86-514-7978307, Fax: 86-514-7887937, E-mail: lchen@yzcn .net http://www. Received 2002-11-12 ; A ccepted 2003-01-20 Chen L, Shen J, Qin L, Chen HJ. An adaptive ant colony algorithm based on equilibrium of distribution. Journal of Software, 2003,14(8):1379~1387. /1000-9825/14/1379.htm Abstract : To settle the contradictory between convergence speed and precocity and stagnation in ant colony algorithm, an adaptive ant colony algorithm, which is based on the equilibrium of the ant distribut ion, is presented. By dynamically adjusting the influence of each ant to the trail information updating and the selected probabilities of the paths according to the equilibrium of the ant distribut ion, the algorithm can keep good balance between accelerating convergence and averting precocity and stagnation. Experimental results on symmetric and asymmetric TSP show that the method presented in this paper has much higher convergence speed and stability than that of classical ant colony algorithm, and is more suitable for solving large scale TSP. Key words : ant colony algorithm; optimization; traveling salesman problem 摘 要: