1.Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei 230031 2.Department of Automation, University of Science and Technology of China, Hefei 230027
Abstract Basic ant colony algorithm, which is based on bionics, has been successfully used in many fields, especially on combinatorial optimization problems. Because many parameters need to be adjusted in application, it is inconvenient for many users especially those who have little experience. A novel ant colony algorithm based on real time model, which regresses to the base of ant colony algorithm is put forward. It is supposed that each ant’s velocity is equal to dmin per second and all ants are crawling in full time. Ants communicate with others by the pheromone that is left on the road. After some time the ants’ trails will be on the optimal route between the food and the nest. It is testified by the experiment that the novel algorithm is as efficient as other ant colony algorithms and it is simpler to justify the parameters. This novel algorithm also can be used in simulating application and distributed computing.
[1] Colorni A, Dorigo M, Maniezzo V. Distributed Optimization by Ant Colonies. In: Proc of the 1st European Conference on Artificial Life. Paris, France, 1992, 134-142 [2] Dorigo M, Maniezzo V, Colorni A. The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Trans on Systems, Man, and Cybernetics, 1996, 26(1): 29-41 [3] Dorigo M, Gambardella L M. Ant Colonies for the Traveling Salesman Problem. BioSystems, 1997, 43(2): 73-81 [4] Dorigo M, Gambardella L M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans on Evolutionary Computation, 1997, 1(1): 53-66 [5] Sun T, Wang X K, Liu Y X, et al. Ant Algorithm and Analysis on Its Convergence. Mini-Micro Systems, 2003, 24(8): 1524-1527 (in Chinese) (孙 焘,王秀坤,刘业欣,等.一种简单蚂蚁算法及其收敛性分析.小型微型计算机系统, 2003, 24(8): 1524-1527) [6] Jin P, Fan J B, Tan Y D. Neural Network and Neural Computer. Chengdu, China: Southwest Jiaotong University Press, 1991, 375-377 (in Chinese) (靳 藩,范俊波,谭永东.神经网络与神经计算机.成都:西南交通大学出版社,1991, 375-377) [7] Jin P. Basic of Neural Computational Intelligence. Chengdu, China: Southwest Jiaotong University Press, 2000, 300-308 (in Chinese) (靳 藩.神经计算智能基础.成都:西南交通大学出版社,2000, 300-308) [8] Kang L S, Xie Y, You S Y, et al. Non-Numerical Parallel Algorithm-Simulated Annealing Algorithm. Beijing, China: Science Press, 1994, 150-151 (in Chinese) (康立山,谢 云,尤矢勇,等.非数值并行算法——模拟退火算法.北京:科学出版社, 1994, 150-151) [9] Website. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp/ [10]Website. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/TSPFAQ.html
2006, Vol. 19 
